Paper 2024/735
Secure Multiparty Computation in the Presence of Covert Adaptive Adversaries
Abstract
We design a new MPC protocol for arithmetic circuits secure against erasure-free covert adaptive adversaries with deterrence 1/2. The new MPC protocol has the same asymptotic communication cost, the number of PKE operations and the number of exponentiation operations as the most efficient MPC protocol for arithmetic circuits secure against covert static adversaries. That means, the new MPC protocol improves security from covert static security to covert adaptive adversary almost for free. For MPC problems where the number of parties n is much larger than the number of multiplication gates M, the new MPC protocol asymptotically improves communication complexity over the most efficient MPC protocol for arithmetic circuits secure against erasure-free active adaptive adversaries.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Covert Adaptive AdversaryThreshold EncryptionLossy EncryptionPublic Key EncryptionHomomorphic Encryption.
- Contact author(s)
-
isheeta @ gmail com
ahasan @ uwaterloo ca - History
- 2024-05-16: approved
- 2024-05-13: received
- See all versions
- Short URL
- https://ia.cr/2024/735
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/735,
author = {Isheeta Nargis and Anwar Hasan},
title = {Secure Multiparty Computation in the Presence of Covert Adaptive Adversaries},
howpublished = {Cryptology ePrint Archive, Paper 2024/735},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/735}},
url = {https://eprint.iacr.org/2024/735}
}
