The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments
Abstract
Article Free Access Share on Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments Authors: Ronald Cramer Institute for Theoretical Comp. SC., ETH-Z, CH-8092 Zurich, Switzerland Institute for Theoretical Comp. SC., ETH-Z, CH-8092 Zurich, SwitzerlandView Profile , Ivan Damgård Maths. & Comp. sc. Dept., Ny Munkegade, Aarhus, Denmark and Basic Research in Computer Science, Center of the Danish, National Research Foundation Maths. & Comp. sc. Dept., Ny Munkegade, Aarhus, Denmark and Basic Research in Computer Science, Center of the Danish, National Research FoundationView Profile Authors Info & Claims STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computingMay 1997Pages 436–445https://doi.org/10.1145/258533.258635Published:04 May 1997Publication History 26citation539DownloadsMetricsTotal Citations26Total Downloads539Last 12 Months47Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“It is derived from the Diffie-Hellman/El Gamal encryption scheme [13, 14].”
MethodGoldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Zero-knowledge from secure multiparty computation
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250794 · Cited by 412
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., & Ward, N. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45721-1_26 · Cited by 358
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Bootle, J., Cerulli, A., Chaidos, P., Groth, J., & Petit, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_12 · Cited by 325
Succinct Non-interactive Arguments via Linear Interactive Proofs
Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_18 · Cited by 274
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
Verifiable Computation over Large Database with Incremental Updates
Chen, X., Li, J., Weng, J., Ma, J., & Lou, W. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2512870 · Cited by 257
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
Brakerski, Z., Kalai, Y. T., Katz, J., & Vaikuntanathan, V. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.55 · Cited by 242
A Survey of Self-Sovereign Identity Ecosystem
Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131
Metadata
- Authors
- Cramer, R., & Damgård, I.
- Venue
- Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 436-445
- OpenAlex
- W1984685443
- Cited by
- 170
- References
- 2
- FWCI
- 5.10
- 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.