A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expected 70 + 20 255 rounds to encrypt one 128-bit block with a 128-bit key. We implemented the variants using VIFF, a software framework for implementing secure multiparty computation (MPC). Tests with three players (passive security against at most one corrupted player) in a local network showed that one block can be encrypteddoi:10.1007/978-3-642-14577-3_31 fatcat:ad6o7rsmrredrm77bsvdv7vv3e