Secure Multiparty AES (full paper)

Ivan Damgård; Marcel Keller

Paper 2009/614

Secure Multiparty AES (full paper)

Ivan Damgård and Marcel Keller

Abstract

We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires $2200 + \frac{400}{255}$ expected elementary operations in expected $70 + \frac{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 in 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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. A short version will appear in the proceedings of Financial Crypto '10.
Keywords: multiparty computation AES
Contact author(s): mkeller @ cs au dk
History: 2009-12-14: received
Short URL: https://ia.cr/2009/614
License: CC BY

BibTeX

@misc{cryptoeprint:2009/614,
      author = {Ivan Damgård and Marcel Keller},
      title = {Secure Multiparty {AES} (full paper)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/614},
      year = {2009},
      url = {https://eprint.iacr.org/2009/614}
}