Improving the efficiency of AES protocols in multi-party computation
From MaRDI portal
Publication:2145388
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
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Faster secure multi-party computation of AES and DES using lookup tables
- Homomorphic evaluation of the AES circuit
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- In How Many Ways Can You Write Rijndael?
- Maliciously secure matrix multiplication with applications to private deep learning
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure Multiparty AES
- Theory of Cryptography
Cited in
(3)
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)