Faster secure multi-party computation of AES and DES using lookup tables

DOI10.1007/978-3-319-61204-1_12zbMATH Open1521.94047MaRDI QIDQ6487205FDOQ6487205

Authors: Marcel Keller, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek 

Publication date: 1 July 2022

Recommendations

• Efficient lookup-table protocol in secure multiparty computation
• Secure Multiparty AES
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• From oblivious AES to efficient and secure database join in the multiparty setting

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Homomorphic evaluation of the AES circuit
• Multiparty Computation from Somewhat Homomorphic Encryption
• A new approach to practical active-secure two-party computation
• Constant-overhead secure computation of Boolean circuits using preprocessing
• Secure two-party computation is practical
• Towards sound approaches to counteract power-analysis attacks
• Ciphers for MPC and FHE
• Provably secure higher-order masking of AES
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Higher-order masking schemes for S-boxes
• Higher order masking of look-up tables
• On the power of correlated randomness in secure computation
• A Unified Approach to MPC with Preprocessing Using OT
• Faster secure two-party computation in the single-execution setting
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Reducing the number of non-linear multiplications in masking schemes
• Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
• An empirical study and some improvements of the MiniMac protocol for secure computation
• Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• Efficient lookup-table protocol in secure multiparty computation

Cited In (12)

• Efficient, actively secure MPC with a dishonest majority: a survey
• Compilation of function representations for secure computing paradigms
• Oblivious TLS via multi-party computation
• Block cipher invariants as eigenvectors of correlation matrices
• Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
• Improving the efficiency of AES protocols in multi-party computation
• On multiparty garbling of arithmetic circuits
• Look-up table-based large finite field multiplication in memory constrained cryptosystems
• From oblivious AES to efficient and secure database join in the multiparty setting
• Actively secure setup for SPDZ
• Efficient lookup-table protocol in secure multiparty computation

This page was built for publication: Faster secure multi-party computation of AES and DES using lookup tables

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