Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
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
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
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
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
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
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Peikert, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536461 · Cited by 813
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
On Defining Proofs of Knowledge
Bellare, M., & Goldreich, O. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_28 · Cited by 556
Witness indistinguishable and witness hiding protocols
Feige, U., & Shamir, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100272 · Cited by 523
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
Guillou, L. C., & Quisquater, J.-J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_16 · Cited by 451
Generating Shorter Bases for Hard Random Lattices
Alwen, J., & Peikert, C. (2011) · Theory of Computing Systems · doi:10.1007/s00224-010-9278-3 · Cited by 427
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_6 · Cited by 416
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
Zero knowledge proofs of identity
Fiege, U., Fiat, A., & Shamir, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28419 · Cited by 407
Generating Hard Instances of the Short Basis Problem
Ajtai, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48523-6_1 · Cited by 396
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
Self-citationSemi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_11 · Cited by 354
Zero Knowledge Proofs of Knowledge in Two Rounds
Feige, U., & Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_46 · Cited by 294
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_29 · Cited by 254
On the Limits of Nonapproximability of Lattice Problems
Goldreich, O., & Goldwasser, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1686 · Cited by 231
A Group Signature Scheme from Lattice Assumptions
Gordon, S. D., Katz, J., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_23 · Cited by 221
Security Proofs for Identity-Based Identification and Signature Schemes
Bellare, M., Namprempre, C., & Neven, G. (2009) · Journal of Cryptology · doi:10.1007/s00145-008-9028-8 · Cited by 214
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_23 · Cited by 211
A new paradigm for public key identification
Stern, J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556672 · Cited by 180
Lattice-Based Identification Schemes Secure Under Active Attacks
Lyubashevsky, V. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78440-1_10 · Cited by 179
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
Micciancio, D., & Vadhan, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_17 · Cited by 163
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Jain, A., Krenn, S., Pietrzak, K., & Tentes, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_40 · Cited by 136
The Foundations of Cryptography - Volume 1, Basic Techniques.
Goldreich, O. (2001) · Cambridge University Press eBooks · Cited by 125
Rückert, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_14 · Cited by 103
Unifying Zero-Knowledge Proofs of Knowledge
Maurer, U. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02384-2_17 · Cited by 102
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Bendlin, R., & Damgård, I. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_13 · Cited by 100
Improved identification schemes based on error-correcting codes
Véron, P. (1997) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s002000050053 · Cited by 100
Fully Anonymous Attribute Tokens from Lattices
Camenisch, J. L., Neven, G., & Rückert, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32928-9_4 · Cited by 84
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Peikert, C., & Vaikuntanathan, V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_30 · Cited by 74
Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
Rückert, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15317-4_22 · Cited by 20
Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
Damgård, I., & López-Alt, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32928-9_3 · Cited by 5
Metadata
- Authors
- Ling, S., Nguyen, K., Stehlé, D., & Wang, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 107-124
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W147565578
- Cited by
- 159
- References
- 47
- FWCI
- 4.34
- 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.