Secure Multiparty AES [chapter]

Ivan Damgård, Marcel Keller
2010 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 encrypted
more » ... 2 seconds. We also argue that this result could be improved by an optimized implementation. The security requirements are the same as for the underlying MPC scheme.
doi:10.1007/978-3-642-14577-3_31 fatcat:ad6o7rsmrredrm77bsvdv7vv3e