Paper 2024/1317
MAESTRO: Multi-party AES using Lookup Tables
Abstract
Secure multi-party computation (MPC) enables multiple distrusting parties to jointly compute a function while keeping their inputs private. Computing the AES block cipher in MPC, where the key and/or the input are secret-shared among the parties is important for various applications, particularly threshold cryptography.
In this work, we propose a family of dedicated, high-performance MPC protocols to compute the non-linear S-box part of AES in the honest majority setting. Our protocols come in both semi-honest and maliciously secure variants. The core technique is a combination of lookup table protocols based on random one-hot vectors and the decomposition of finite field inversion in
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Multi-Party ComputationMPCAESLookup Table
- Contact author(s)
-
hiraku @ cs au dk
erik pohle @ esat kuleuven be
sada @ mist i u-tokyo ac jp
peter scholl @ cs au dk
tozawa kazunari @ mail u-tokyo ac jp
dt @ concordium com - History
- 2024-08-23: approved
- 2024-08-22: received
- See all versions
- Short URL
- https://ia.cr/2024/1317
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1317, author = {Hiraku Morita and Erik Pohle and Kunihiko Sadakane and Peter Scholl and Kazunari Tozawa and Daniel Tschudi}, title = {{MAESTRO}: Multi-party {AES} using Lookup Tables}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1317}, year = {2024}, url = {https://eprint.iacr.org/2024/1317} }