The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Abstract
We present a digital signature scheme based on the computational difficulty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a way that depends on the signatures of previously chosen messages) cannot later forge the signature of even a single additional message. This may be somewhat surprising, since in the folklore the properties of having forgery being equivalent to factoring and being invulnerable to an adaptive chosen-message attack were considered to be contradictory. More generally, we show how to construct a signature scheme with such properties based on the existence of a “claw-free” pair of permutations—a potentially weaker assumption than the intractibility of integer factorization. The new scheme is potentially practical: signing and verifying signatures are reasonably fast, and signatures are compact.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Self-citationA 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
Self-citationA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Self-citationHow to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Self-citationCryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
Self-citationProbabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
Hiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
Constructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 649
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
A fair protocol for signing contracts
Ben-Or, M., Goldreich, O., Micali, S., & Rivest, R. L. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.50372 · Cited by 287
Self-citationA polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
Shamir, A. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056964 · Cited by 275
A modification of the RSA public-key encryption procedure (Corresp.)
Williams, H. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056264 · Cited by 271
Blum, M. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357360.357368 · Cited by 205
Almost all primes can be quickly certified
Goldwasser, S., & Kilian, J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12162 · Cited by 198
Self-citationYuval, G. (1979) · Cryptologia · doi:10.1080/0161-117991854025 · Cited by 139
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Adi Shamir, Z. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.5 · Cited by 108
An efficient signature scheme based on quadratic equations
Ong, H., Schnorr, C. P., & Adi Shamir, Z. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808683 · Cited by 82
A “Paradoxical” Solution to The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_37 · Cited by 73
Self-citationA Fast Signature Scheme Based on Quadratic Inequalities
Okamoto, T., & Shibaishi, A. (1985) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.1985.10026 · Cited by 40
Adi Shamir, Z. (1978) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 34
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
Brickell, E. F., & DeLaurentis, J. M. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_4 · Cited by 28
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
Estes, D. R., Adleman, L. M., Kompella, K., McCurley, K. S., & Miller, G. L. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_1 · Cited by 24
Digital signatures — An overview
Matyas, S. M. (1979) · Computer Networks (1976) · doi:10.1016/0376-5075(79)90007-2 · Cited by 24
Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
Ong, H., Schnorr, C. P., & Shamir, A. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_4 · Cited by 22
Cited by
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Metadata
- Authors
- Goldwasser, S., Micali, S., & Rivest, R. L.
- Venue
- SIAM Journal on Computing
- Published
- 1988-04
- Volume
- 17
- Issue
- 2
- Pages
- 281-308
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2151413173
- Cited by
- 2,804
- References
- 30
- FWCI
- 18.64
- Type
- journal article
- 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.