Paper 2025/283
Honest Majority MPC with Communication in Minicrypt
Abstract
In this work, we consider the communication complexity of MPC protocols in honest majority setting achieving malicious security in both information-theoretic setting and computational setting. On the one hand, we study the possibility of basing honest majority MPC protocols on oblivious linear evaluation (OLE)-hybrid model efficiently with information-theoretic security. More precisely, we instantiate preprocessing phase of the recent work Sharing Transformation (Goyal, Polychroniadou, and Song, CRYPTO 2022) assuming random OLE correlations. Notably, we are able to prepare packed Beaver triples with malicious security achieving amortized communication of
Note: Acknowledgement added.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2025
- Keywords
- Communication complexityMultiparty computationInformation-theoretic securityLightweight cryptography
- Contact author(s)
-
yfsong @ mail tsinghua edu cn
yexx23 @ mails tsinghua edu cn - History
- 2025-02-24: revised
- 2025-02-19: received
- See all versions
- Short URL
- https://ia.cr/2025/283
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2025/283, author = {Yifan Song and Xiaxi Ye}, title = {Honest Majority {MPC} with $\tilde{O}(|C|)$ Communication in Minicrypt}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/283}, year = {2025}, url = {https://eprint.iacr.org/2025/283} }