The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Cited by
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
“Nonetheless, it must be noted that, Fiat-Shamir signatures are not known to be completely secure against quantum attacks [157] (only under certain circumstances [158]), so alternatives like the Unruh transformation should be considered [157].”
BackgroundA Modular Analysis of the Fujisaki-Okamoto Transformation
Hofheinz, D., Hövelmanns, K., & Kiltz, E. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70500-2_12 · Cited by 451
Breaking Symmetric Cryptosystems Using Quantum Period Finding
Kaplan, M., Leurent, G., Leverrier, A., & Naya-Plasencia, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53008-5_8 · Cited by 336
The SPHINCS + Signature Framework
Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363229 · Cited by 306
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography
Chailloux, A., Naya-Plasencia, M., & Schrottenloher, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_8 · Cited by 106
Metadata
- Authors
- Unruh, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2015
- Volume
- 2014
- Pages
- 755-784
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2189468733
- Cited by
- 160
- References
- 1
- FWCI
- 6.82
- 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-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model. https://app.cochat.ai/papers/10.1007/978-3-662-46803-6_25
- The paper
- Unruh, D. (2015). Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-46803-6_25
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.