The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
A Signature Scheme with Efficient Protocols
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 2×
“Most notably, those are the RSA [32], the Fiat-Shamir [21], and the Schnorr [34] signature schemes.”
BackgroundMethodA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
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
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
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
Self-citationEfficient group signature schemes for large groups: Extended abstract
Camenisch, J., & Stadler, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052252 · Cited by 1,083
Self-citationUniversal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
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
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Ateniese, G., Camenisch, J., Joye, M., & Tsudik, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_16 · Cited by 800
Self-citationThe 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
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Brands, S. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/5931.001.0001 · Cited by 685
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
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
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521
Self-citationStatistical 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
Efficient Proofs that a Committed Number Lies in an Interval
Boudot, F. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_31 · Cited by 489
Buchmann, J. A. (2004) · Undergraduate Texts in Mathematics · doi:10.1007/978-1-4419-9003-7 · Cited by 410
Secure Hash-and-Sign Signatures Without the Random Oracle
Gennaro, R., Halevi, S., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_9 · Cited by 347
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
Self-citationEfficient Concurrent Zero-Knowledge in the Auxiliary String Model
Damgård, I. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_30 · Cited by 295
On the generation of cryptographically strong pseudorandom sequences
Shamir, A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 268
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
Damgård, I., & Fujisaki, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_8 · Cited by 221
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319716 · Cited by 193
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
Self-citationGroup signature schemes and payment systems based on the discrete logarithm problem
Camenisch, J. L. (1998) · CERN Document Server (European Organization for Nuclear Research) · doi:10.3929/ethz-a-001923735 · Cited by 170
Self-citationA Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between Organizations
Chaum, D., & Evertse, J. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_10 · Cited by 157
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
Damgård, I. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_26 · Cited by 146
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
An Integer Commitment Scheme based on Groups with Hidden Order.
Damgård, I., & Fujisaki, E. (2001) · Cited by 86
Chen, L. (1996) · Lecture notes in computer science · doi:10.1007/bfb0032362 · Cited by 80
Cited by
Signature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
Self-citationCharm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Survey in Smart Grid and Smart Home Security: Issues, Challenges and Countermeasures
Komninos, N., Philippou, E., & Pitsillides, A. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320093 · Cited by 560
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Self-citationA capability-based security approach to manage access control in the Internet of Things
Gusmeroli, S., Piccione, S., & Rotondi, D. (2013) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2013.02.006 · Cited by 361
Metadata
- Authors
- Camenisch, J., & Lysyanskaya, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 268-289
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1851031742
- Cited by
- 662
- References
- 37
- FWCI
- 14.24
- 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.