Implementing AES via an actively/covertly secure dishonest-majority MPC protocol

DOI10.1007/978-3-642-32928-9_14MaRDI QIDQ2912800zbMATH OpenOpenAlexFDO

Authors Marcel Keller, Enrique Larraia, Christian Miles, Ivan B. Damgård, N. P. Smart

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32928-9_14

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Secure Multiparty AES
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• Efficient multiparty computation for arithmetic circuits against a covert majority

Cited in

(10)

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Improving the efficiency of AES protocols in multi-party computation
• Efficient constant-round multi-party computation combining BMR and SPDZ
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• An empirical study and some improvements of the MiniMac protocol for secure computation
• Efficient secure multiparty computation with identifiable abort
• Secure Multiparty AES
• One round threshold ECDSA without roll call
• Faster secure multi-party computation of AES and DES using lookup tables
• Multi-committee MPC: from unanimous to identifiable abort

Describes a project that uses

Uses Software

• TASTY

This page was built for publication: Implementing AES via an actively/covertly secure dishonest-majority MPC protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912800)