The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Perfect Non-interactive Zero Knowledge for NP
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
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
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
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
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
Self-citationNon-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Self-citationBlum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
Robust Non-interactive Zero Knowledge
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., & Sahai, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_33 · Cited by 293
Self-citationOn Deniability in the Common Reference String and Random Oracle Model
Pass, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_19 · Cited by 190
A complete problem for statistical zero knowledge
Sahai, A., & Vadhan, S. (2003) · Journal of the ACM · doi:10.1145/636865.636868 · Cited by 178
Self-citationThe complexity of perfect zero-knowledge
Fortnow, L. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28418 · Cited by 170
Non-interactive and non-malleable commitment
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276722 · Cited by 159
Self-citationEfficient and Non-interactive Non-malleable Commitment
Crescenzo, G. D., Katz, J. I., Ostrovsky, R., & Smith, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_4 · Cited by 121
Self-citationOn Simulation-Sound Trapdoor Commitments
MACKENZIE, P. D., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_23 · Cited by 106
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
Kilian, J., & Petrank, E. (1998) · Journal of Cryptology · doi:10.1007/s001459900032 · Cited by 90
Strengthening Zero-Knowledge Protocols Using Signatures
Garay, J. A., MACKENZIE, P. D., & Yang, K. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_11 · Cited by 77
Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$
Groth, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_4 · Cited by 57
Self-citationUnconditional Characterizations of Non-interactive Zero-Knowledge
Pass, R., & Shelat, A. A. (2005) · Lecture notes in computer science · doi:10.1007/11535218_8 · Cited by 37
Computational Complexity and Knowledge Complexity
Goldreich, O., Ostrovsky, R., & Petrank, E. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795280524 · Cited by 21
Self-citation
Cited by
Decentralizing Attribute-Based Encryption
Lewko, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_31 · Cited by 1,194
Efficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
Self-citationQuadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
Metadata
- Authors
- Groth, J., Ostrovsky, R., & Sahai, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 339-358
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1590713339
- Cited by
- 381
- References
- 22
- FWCI
- 19.45
- 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
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.