The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Efficient Proofs that a Committed Number Lies in an Interval
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
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
Statistical zero knowledge protocols to prove modular polynomial relations
Fujisaki, E., & Okamoto, T. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052225 · Cited by 497
Girault, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_42 · Cited by 479
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
Chaum, D., Evertse, J.-H., & Graaf, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/3-540-39118-5_13 · Cited by 246
Easy come — Easy go divisible cash
Chan, A., Frankel, Y., & Tsiounis, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054154 · Cited by 216
Separability and Efficiency for Generic Group Signature Schemes
BRICS, Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_27 · Cited by 182
A practical and provably secure scheme for publicly verifiable secret sharing and its applications
Fujisaki, E., & Okamoto, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054115 · Cited by 139
A Group Signature Scheme Based on an RSA-Variant
Camenisch, J. L., & Michels, M. (1998) · BRICS Report Series · doi:10.7146/brics.v5i27.19433 · Cited by 96
Gradual and Verifiable Release of a Secret (Extended Abstract)
Brickell, E. F., Chaum, D., Damgård, I., & van de Graaf, J. (1988) · Lecture notes in computer science · doi:10.1007/3-540-48184-2_11 · Cited by 73
Proofs of partial knowledge and simplified design of witness hiding protocols
Cramer, R., Damgård, I., & Schoenmakers, L. B. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 56
Cited by
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Brickell, E., Camenisch, J., & Chen, L. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030103 · Cited by 935
A Signature Scheme with Efficient Protocols
Camenisch, J., & Lysyanskaya, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36413-7_20 · Cited by 662
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J., & Shoup, V. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_8 · Cited by 541
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Metadata
- Authors
- Boudot, F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 431-444
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1494775996
- Cited by
- 489
- References
- 16
- FWCI
- 8.17
- 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.