The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Abstract
We introduce the notion of non-malleable non-interactive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-malleability properties. We then show that the elegant encryption scheme of Naor and Yung (1990) can be made secure against the strongest form of chosen-ciphertext attack by using a non-malleable NIZK proof instead of a standard NIZK proof. Our encryption scheme is simple to describe and works in the standard cryptographic model under, general assumptions. The encryption scheme can be realized assuming the existence of trapdoor permutations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Cited by
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Self-citationEfficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Bellare, M., Micciancio, D., & Warinschi, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_38 · Cited by 732
Metadata
- Authors
- Sahai, A.
- Venue
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 543-553
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2159339434
- Cited by
- 575
- References
- 21
- FWCI
- 24.30
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. https://app.cochat.ai/papers/10.1109/sffcs.1999.814628
- The paper
- Sahai, A. (2003). Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). https://doi.org/10.1109/sffcs.1999.814628
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.