A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Shafi Goldwasser; Silvio Micali; Ronald L. Rivest

doi:https://doi.org/10.1137/0217017

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

1988 · SIAM Journal on Computing · 2,819 citations · 8 from inside this corpus

Shafi Goldwasser, Silvio Micali, Ronald L. Rivest

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

12 of 12 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

Random oracles are practical→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Universally composable security: a new paradigm for cryptographic protocols→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Short Signatures from the Weil Pairing→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Efficient Identity-Based Encryption Without Random Oracles→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Entity Authentication and Key Distribution→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
Short Signatures Without Random Oracles→A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksLegacy edge — source detail unavailable
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks→A public key cryptosystem and a signature scheme based on discrete logarithmsLegacy edge — source detail unavailable
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks→A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsLegacy edge — source detail unavailable
Universally composable security: a new paradigm for cryptographic protocols→Entity Authentication and Key DistributionLegacy edge — source detail unavailable
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Entity Authentication and Key Distribution→Random oracles are practicalLegacy edge — source detail unavailable
Efficient Identity-Based Encryption Without Random Oracles→Short Signatures from the Weil PairingLegacy edge — source detail unavailable
Efficient Identity-Based Encryption Without Random Oracles→Short Signatures Without Random OraclesLegacy edge — source detail unavailable
Short Signatures from the Weil Pairing→Random oracles are practicalLegacy edge — source detail unavailable
Short Signatures from the Weil Pairing→Security Arguments for Digital Signatures and Blind SignaturesLegacy edge — source detail unavailable
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps→Short Signatures from the Weil PairingLegacy edge — source detail unavailable
Random oracles are practical→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Random oracles are practical→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A public key cryptosystem and a signature scheme based on discrete logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A public key cryptosystem and a signature scheme based on discrete logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Short Signatures Without Random Oracles→Short Signatures from the Weil PairingLegacy edge — source detail unavailable
Short Signatures Without Random Oracles→Random oracles are practicalLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→Random oracles are practicalLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→A public key cryptosystem and a signature scheme based on discrete logarithmsLegacy edge — source detail unavailable
Security Arguments for Digital Signatures and Blind Signatures→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable

What this paper cites, inside the corpus

Paper	Year	Cited
A method for obtaining digital signatures and public-key cryptosystems	1978	13,242
A method for obtaining digital signatures and public-key cryptosystems	1983	13,151
A public key cryptosystem and a signature scheme based on discrete logarithms	1985	8,086
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms	2007	1,585

What cites it, inside the corpus

Paper	Year	Cited
Random oracles are practical	1993	4,733
Universally composable security: a new paradigm for cryptographic protocols	2001	3,340
Short Signatures from the Weil Pairing	2001	3,000
Security Arguments for Digital Signatures and Blind Signatures	2000	2,223
Efficient Identity-Based Encryption Without Random Oracles	2005	2,032
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps	2003	1,821
Entity Authentication and Key Distribution	2007	1,764
Short Signatures Without Random Oracles	2004	1,461

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
Cryptographic Implementations and Security	Computer Science
DNA and Biological Computing	Biochemistry, Genetics and Molecular Biology

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports3 author record(s) attached.
supports35 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:48+00:00.

sha256 46f669157f96ea35…