Improving the efficiency of AES protocols in multi-party computation

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

Fatma Betül Durak, Jorge Guajardo

Publication date: 17 June 2022

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

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)