journal article·2021-04-08Open access

Revisiting NIZK-Based Technique for Chosen-Ciphertext Security: Security Analysis and Corrected Proofs

Youngkyung Lee, Dong Hoon Lee, Jong Hwan Park

Applied Sciences· Volume 11· Issue 8

Abstract

Non-interactive zero-knowledge (NIZK) proofs for chosen-ciphertext security are generally considered to give an impractical construction. An interesting recent work by Seo, Abdalla, Lee, and Park (Information Sciences, July 2019) proposed an efficient semi-generic conversion method for achieving chosen-ciphertext security based on NIZK proofs in the random oracle model. The recent work by Seo et al. demonstrated that the semi-generic conversion method transforms a one-way (OW)-secure key encapsulation mechanism (KEM) into a chosen-ciphertext secure KEM while preserving tight security reduction. This paper shows that the security analysis of the semi-generic conversion method has a flaw, which comes from the OW security condition of the underlying KEM. Without changing the conversion method, this paper presents a revised security proof under the changed conditions that (1) the underlying KEM must be chosen-plaintext secure in terms of indistinguishability and (2) an NIZK proof derived from the underlying KEM via the Fiat–Shamir transform must have the properties of zero-knowledge and simulation soundness. This work extended the security proof strategy to the case of identity-based KEM (IBKEM) and also revise the security proof for IBKEM of previous method by Seo et al. Finally, this work gives a corrected security proof by applying the new proofs to several existing (IB)KEMs.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Cryptography and Data Security · Privacy-Preserving Technologies in Data · Complexity and Algorithms in Graphs

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Graduate School of Information Security, Korea University, Seoul 02841, Korea

Department of Computer Science, Sangmyung University, Seoul 03016, Korea

Funding

Institute for Information and Communications Technology Promotion

References (27)

Show source-provided references
1. Blum, M., Feldman, P., and Micali, S. (1988, January 2–4). Non-interactive zero-knowledge and its applications. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC’88), Chicago, IL, USA.10.1145/62212.62222 ↗
2. Noninteractive zero-knowledge10.1137/0220068 ↗
3. Feige, U., Lapidot, D., and Shamir, A. (1990, January 22–24). Multiple non-interactive zero knowledge proofs based on a single random string. Proceedings of the 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, USA.
4. An efficient NIZK scheme for privacy-preserving transactions over account-model blockchain10.1109/TDSC.2020.2969418 ↗
5. Lin, C., Luo, M., Huang, X., Choo, K.-K.R., and He, D. (2021). An Efficient Privacy-Preserving Credit Score System Based on Noninteractive Zero-Knowledge Proof. IEEE Syst. J., 1–10.10.1109/JSYST.2020.3045076 ↗
6. Ortiz, H. (1990, January 14–16). Public-key cryptosystems provably secure against chosen ciphertext attacks. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC’90, Baltimore, MD, USA.
7. Nonmalleable cryptography10.1137/S0097539795291562 ↗
8. Sahai, A. (1999, January 17–18). Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS ’99, New York, NY, USA.
9. Multiple noninteractive zero knowledge proofs under general assumptions10.1137/S0097539792230010 ↗
10. Toward Non-interactive Zero-Knowledge Proofs for NP from LWE10.1007/s00145-020-09365-w ↗
11. Chosen-ciphertext security from identity-based encryption10.1137/S009753970544713X ↗
12. New technique for chosen-ciphertext security based on non-interactive zero-knowledge10.1016/j.ins.2019.03.063 ↗
13. How to prove yourself: Practical solutions to identification and signature problems
14. On the non-malleability of the Fiat-Shamir transform
15. Tightly secure signatures from lossy identification schemes10.1007/s00145-015-9203-7 ↗
16. Tightly CCA-secure encryption scheme in a multi-user setting with corruptions10.1007/s10623-020-00794-z ↗
17. Camenisch, J., and Stadler, M. (1997). Proof Systems for General Statements about Discrete Logarithms, Institute for Theoretical Computer Science (ETH Zurich). Technical Report 260.
18. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
19. A Signature Scheme as Secure as the Diffie-Hellman Problem
20. Zero Knowledge in the Random Oracle Model, Revisited
21. Short Group Signatures
22. Identity-Based Encryption from the Weil Pairing
23. Libert, B. (2006). New Secure Applications of Bilinear Maps in Cryptography. [Ph.D. Thesis, Universitï Catholique de Louvain].
24. Efficient Selective-Id Secure Identity-Based Encryption without Random Oracles10.1007/978-3-540-24676-3_14 ↗
25. A knowledge-based pilot study on assessing the music influence
26. Trust based cluster head election of secure message transmission in MANET using multi secure protocol with TDES
27. Integrated Applications with Laser Technology10.12948/issn14531305/17.1.2013.05 ↗