Chosen Ciphertext Security via BARGs
T Matsuda - Cryptology ePrint Archive, 2023 - eprint.iacr.org
T Matsuda
Cryptology ePrint Archive, 2023•eprint.iacr.orgIn this paper, we show a new set of cryptographic primitives that generically leads to chosen
ciphertext secure (CCA secure) public-key encryption (PKE). Specifically, we show how a
(non-interactive, publicly verifiable) batch argument (BARG) for NP can be combined with a
chosen plaintext secure PKE scheme to achieve a CCA secure one. The requirement of the
succinctness of the proof size of a BARG in our result is rather mild: The proof size is $ O
(k^{\epsilon}) $ for some non-negative constant $\epsilon< 1$ when the correctness of $ k …
ciphertext secure (CCA secure) public-key encryption (PKE). Specifically, we show how a
(non-interactive, publicly verifiable) batch argument (BARG) for NP can be combined with a
chosen plaintext secure PKE scheme to achieve a CCA secure one. The requirement of the
succinctness of the proof size of a BARG in our result is rather mild: The proof size is $ O
(k^{\epsilon}) $ for some non-negative constant $\epsilon< 1$ when the correctness of $ k …
Abstract
In this paper, we show a new set of cryptographic primitives that generically leads to chosen ciphertext secure (CCA secure) public-key encryption (PKE). Specifically, we show how a (non-interactive, publicly verifiable) batch argument (BARG) for NP can be combined with a chosen plaintext secure PKE scheme to achieve a CCA secure one. The requirement of the succinctness of the proof size of a BARG in our result is rather mild: The proof size is for some non-negative constant when the correctness of statements is simultaneously proved.
eprint.iacr.org
Показан лучший результат поиска по этому запросу. Все результаты