Improving the efficiency of AES protocols in multi-party computation
From MaRDI portal
Publication:2145388
DOI10.1007/978-3-662-64322-8_11OpenAlexW3209702503MaRDI QIDQ2145388
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Overdrive: making SPDZ great again
- Maliciously secure matrix multiplication with applications to private deep learning
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
- Multiparty Computation from Somewhat Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Secure Multiparty AES
- In How Many Ways Can You Write Rijndael?
- Theory of Cryptography
This page was built for publication: Improving the efficiency of AES protocols in multi-party computation