Paper 2022/1733
New and Improved Constructions for Partially Equivocable Public Key Encryption
Abstract
Non-committing encryption (NCE) is an advanced form of public-key encryption which guarantees the security of a Multi-Party Computation (MPC) protocol in the presence of an adaptive adversary. Brakerski et al. (TCC 2020) recently proposed an intermediate notion, termed Packed Encryption with Partial Equivocality (PEPE), which implies NCE and preserves the ciphertext rate (up to a constant factor). In this work, we propose three new constructions of rate-1 PEPE based on standard assumptions. In particular, we obtain the first constant ciphertext-rate NCE construction from the LWE assumption with polynomial modulus, and from the Subgroup Decision assumption. We also propose an alternative DDH-based construction with guaranteed polynomial running time.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. SCN 2022
- DOI
- 10.1007/978-3-031-14791-3_9
- Keywords
- Non-Committing EncryptionStandard AssumptionsCiphertext RateEquivocable Encryption
- Contact author(s)
-
benoit libert @ ens-lyon fr
alain passelegue @ ens-lyon fr
mahshid riahinia @ ens-lyon fr - History
- 2023-01-06: revised
- 2022-12-16: received
- See all versions
- Short URL
- https://ia.cr/2022/1733
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1733,
author = {Benoît Libert and Alain Passelègue and Mahshid Riahinia},
title = {New and Improved Constructions for Partially Equivocable Public Key Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1733},
year = {2022},
doi = {10.1007/978-3-031-14791-3_9},
url = {https://eprint.iacr.org/2022/1733}
}
