We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires expected elementary operations in expected 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 in 2 seconds. We also argue that this result could be improved by an optimized implementation. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Damgård, I., & Keller, M. (2010). Secure multiparty AES. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6052 LNCS, pp. 367–374). https://doi.org/10.1007/978-3-642-14577-3_31
Mendeley helps you to discover research relevant for your work.