The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
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 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
A 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
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
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
Cryptanalysis of short RSA secret exponents
Wiener, M. J. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.54902 · Cited by 698
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5 · Cited by 681
(1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4 · Cited by 661
(2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7 · Cited by 620
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
On the generation of cryptographically strong pseudorandom sequences
Shamir, A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 268
(1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3 · Cited by 258
Advances in Cryptology--Eurocrypt '92
Rueppel, R. A. (1993) · Cited by 206
Waidner, M., & Pfitzmann, B. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_69 · Cited by 134
Self-citationLow-Exponent RSA with Related Messages
Coppersmith, D., Franklin, M., Patarin, J., & Reiter, M. K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_1 · Cited by 130
N Using RSA with Low Exponent in a Public Key Network
Håstad, J. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_29 · Cited by 115
New Generation of Secure and Practical RSA-Based Signatures
Cramer, R., & Damgård, I. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_14 · Cited by 95
An Efficient Existentially Unforgeable Signature Scheme and its Applications
Dwork, C., & Naor, M. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_23 · Cited by 64
Pedersen, T. P., & Pfitzmann, B. (1997) · SIAM Journal on Computing · doi:10.1137/s009753979324557x · Cited by 56
Self-citationHow to Make Efficient Fail-stop Signatures
van Heyst, E., & Pedersen, T. P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-47555-9_30 · Cited by 54
New Constructions of Fail-Stop Signatures and Lower Bounds
van Heijst, E., Pedersen, T. P., & Pfitzmann, B. (1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4_2 · Cited by 28
Self-citationNew Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
van Heijst, E., Pedersen, T. P., & Pfitzmann, B. (1992) · International Cryptology Conference · Cited by 18
Self-citation
Cited by
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983
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
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
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
Metadata
- Authors
- Barić, N., & Pfitzmann, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 480-494
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1589205472
- Cited by
- 557
- References
- 21
- FWCI
- 5.74
- 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.