Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Digital Signature Scheme
Integer Factorization
Related Publications
(129)
How to Generate Cryptographically Strong Sequences of Pseudo Random Bits
Probabilistic encryption
A Discrete Logarithm Implementation of Perfect ZeroKnowledge Blobs
An Efficient Existentially Unforgeable Signature Scheme and its Applications
Minimum Disclosure Proofs of Knowledge
Subscribe
Academic
Publications
A digital signature scheme secure against adaptive chosenmessage attacks
A digital signature scheme secure against adaptive chosenmessage attacks,10.1137/0217017,Siam Journal on Computing,Shafi Goldwasser,Silvio Micali,Ron
Edit
A digital signature scheme secure against adaptive chosenmessage attacks
(
Citations: 1340
)
BibTex

RIS

RefWorks
Download
Shafi Goldwasser
,
Silvio Micali
,
Ronald L. Rivest
We present a
digital signature scheme
based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage 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) can not later forge the signature of even a single additional message. This may be somewhat surprising, since the properties of...
Journal:
Siam Journal on Computing  SIAMCOMP
, vol. 17, no. 2, pp. 281308, 1988
DOI:
10.1137/0217017
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
link.aip.org
)
Citation Context
(886)
...Publickey signatures [12,
17
,25] are relatively expensive to generate...
...For publickey signature schemes, the property corresponding to Unforgeability is Chosen Message Attack (CMA) security [
17
]...
...Perfect Transferability instead of Transferability is effectively a publickey signature scheme secure under CMA [
17
]...
Tom Roeder
,
et al.
MultiVerifier Signatures
...In the classical definition of existential unforgeability (EUF) [
GMR88
], a new signature on an already signed message is not considered a valid forgery—as opposed to strong unforgeability (SUF)...
Olivier Blazy
,
et al.
Signatures on Randomizable Ciphertexts
...Moreover, we need a stronger security guarantee than HW signatures gave us (i.e., existential unforgeability under adaptive chosen message attack [
20
].) We need that: it is not only the case that an adversary cannot produce a pair (m, σ) for a new m; now the adversary cannot even produce the pair (g m ,σ )f or an ew...
Matthew Greenand
,
et al.
Practical Adaptive Oblivious Transfer from Simple Assumptions
...FVDS is secure { existentially unforgeable against adaptive chosen message attacks [
13
] { under the assumption that factorization of an RSA modulus is harder...
Jothi Rangasamy
,
et al.
An integrated approach to cryptographic mitigation of denialofservic...
...Specifically, a signature scheme is leakageresilient in the boundedleakage model if it is existentially unforgeable against an adaptive chosenmessage attack [
19
] even when adversarially chosen functions of the signing key are leaked in an adaptive fashion...
Elette Boyle
,
et al.
Fully LeakageResilient Signatures
References
(28)
Coin Flipping by Telephone
(
Citations: 157
)
Manuel Blum
Conference:
International Crytology Conference  CRYPTO
, pp. 1115, 1981
Almost all primes can be quickly certified
(
Citations: 99
)
Shafi Goldwasser
,
Joe Kilian
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 316329, 1986
A Polynomial Time Algorithm for Breaking the Basic MerkleHellman Cryptosystem
(
Citations: 108
)
Adi Shamir
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 279288, 1982
HOW TO SWINDLE RABIN
(
Citations: 64
)
Gideon Yuval
Journal:
Cryptologia
, vol. 3, no. 3, pp. 187191, 1979
A logarithmic time sort for linear size networks
(
Citations: 188
)
John H. Reif
,
Leslie G. Valiant
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 1016, 1983
Sort by:
Citations
(1340)
MultiVerifier Signatures
Tom Roeder
,
Rafael Pass
,
Fred B. Schneider
Journal:
Journal of Cryptology  JOC
, pp. 139, 2012
Signatures on Randomizable Ciphertexts
(
Citations: 3
)
Olivier Blazy
,
Georg Fuchsbauer
,
David Pointcheval
,
DamienVergnaud
Published in 2011.
Practical Adaptive Oblivious Transfer from Simple Assumptions
(
Citations: 2
)
Matthew Greenand
,
Susan Hohenberger
Conference:
Theory of Cryptography
, pp. 347363, 2011
An integrated approach to cryptographic mitigation of denialofservice attacks
(
Citations: 1
)
Jothi Rangasamy
,
Douglas Stebila
,
Colin Boyd
,
Juan González Nieto
Published in 2011.
Efficient traceable signatures in the standard model
(
Citations: 1
)
Benoît Libert
,
Moti Yung
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 1214, pp. 12201242, 2011