Skip to Main content Skip to Navigation
New interface
Conference papers

Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings

Abstract : We consider threshold public-key encryption, where the decryption servers distributively hold the private key shares, and we need a threshold of these servers to decrypt the message (while the system remains secure when less than the threshold is corrupt). We investigate the notion of chosen-ciphertext secure threshold systems which has been historically hard to achieve. We further require the systems to be, both, adaptively secure (i.e., secure against a strong adversary making corruption decisions dynamically during the protocol), and non-interactive (i.e., where decryption servers do not interact amongst themselves but rather efficiently contribute, each, a single message). To date, only pairing-based implementations were known to achieve security in the standard security model without relaxation (i.e., without assuming the random oracle idealization) under the above stringent requirements. Here, we investigate how to achieve the above using other assumptions (in order to understand what other algebraic building blocks and mathematical assumptions are needed to extend the domain of encryption methods achieving the above). Specifically, we show realizations under the Decision Composite Residuosity (DCR) and Learning-With-Errors (LWE) assumptions.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03381386
Contributor : Benoit Libert Connect in order to contact the contributor
Submitted on : Saturday, October 16, 2021 - 3:51:37 PM
Last modification on : Friday, November 18, 2022 - 9:24:51 AM
Long-term archiving on: : Monday, January 17, 2022 - 6:32:28 PM

File

TPKE-DCR.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Julien Devevey, Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung. Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings. PKC 2021 - 24th edition of the International Conference on Practice and Theory of Public-Key Cryptography, May 2021, Edinburgh (devenu virtuel pour cause de COVID), United Kingdom. pp.1-66, ⟨10.1007/978-3-030-75245-3_24⟩. ⟨hal-03381386⟩

Share

Metrics

Record views

15

Files downloads

80