Improving the efficiency of AES protocols in multi-party computation

DOI10.1007/978-3-662-64322-8_11OpenAlexW3209702503MaRDI QIDQ2145388FDOQ2145388

Authors: Jorge Guajardo, Fatma Betül Durak 

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_11

Recommendations

• Secure Multiparty AES
• Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• Faster secure multi-party computation of AES and DES using lookup tables
• An empirical study and some improvements of the MiniMac protocol for secure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)

Cites Work

• Homomorphic evaluation of the AES circuit
• (Leveled) fully homomorphic encryption without bootstrapping
• Multiparty Computation from Somewhat Homomorphic Encryption
• Title not available (Why is that?)
• Theory of Cryptography
• In How Many Ways Can You Write Rijndael?
• Title not available (Why is that?)
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Faster secure multi-party computation of AES and DES using lookup tables
• Overdrive: making SPDZ great again
• Secure Multiparty AES
• Maliciously secure matrix multiplication with applications to private deep learning
• Implementing AES via an actively/covertly secure dishonest-majority MPC protocol

Cited In (3)

• Improving the computation of the optimal ate pairing for a high security level
• Secure Multiparty AES
• Optimizing Online Permutation-Based AE Schemes for Lightweight Applications

Uses Software

• Sharemind
• TinyGarble
• MP-SPDZ

This page was built for publication: Improving the efficiency of AES protocols in multi-party computation

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