Faster secure multi-party computation of AES and DES using lookup tables
From MaRDI portal
Publication:6487205
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
Cites work
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- A Unified Approach to MPC with Preprocessing Using OT
- A new approach to practical active-secure two-party computation
- An empirical study and some improvements of the MiniMac protocol for secure computation
- Ciphers for MPC and FHE
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Efficient lookup-table protocol in secure multiparty computation
- Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- Faster secure two-party computation in the single-execution setting
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Higher order masking of look-up tables
- Higher-order masking schemes for S-boxes
- Homomorphic evaluation of the AES circuit
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Multiparty Computation from Somewhat Homomorphic Encryption
- On the power of correlated randomness in secure computation
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Provably secure higher-order masking of AES
- Reducing the number of non-linear multiplications in masking schemes
- Secure two-party computation is practical
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Towards sound approaches to counteract power-analysis attacks
Cited in
(12)- On multiparty garbling of arithmetic circuits
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- Efficient, actively secure MPC with a dishonest majority: a survey
- Efficient lookup-table protocol in secure multiparty computation
- Compilation of function representations for secure computing paradigms
- Oblivious TLS via multi-party computation
- Actively secure setup for SPDZ
- Block cipher invariants as eigenvectors of correlation matrices
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- From oblivious AES to efficient and secure database join in the multiparty setting
- Improving the efficiency of AES protocols in multi-party 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)
