Keywords
Computer scienceFactoringHash functionDigital signatureUniversal hashingTheoretical computer scienceCryptographyEncryptionSign (mathematics)Scheme (mathematics)Signature (topology)Random oracleAlgorithmPublic-key cryptographyComputer securityCryptographic hash functionMathematicsDouble hashing
Affiliated Institutions
Related Publications
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
We present a new cryptosystem based on elliptic curves over the ring Z/sub n/, where n=pq, in which the message is held in the exponent and not the group element. The security o...
A public key cryptosystem and a signature scheme based on discrete logarithms
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both s...
HOW TO SWINDLE RABIN
Abstract a computational short-cut is shown, which can compromise the security of Rabin's digital signature system.
Publication Info
- Year
- 1996
- Type
- book-chapter
- Pages
- 399-416
- Citations
- 932
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
932
OpenAlex
Cite This
Mihir Bellare,
Phillip Rogaway
(1996).
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin.
Lecture notes in computer science
, 399-416.
https://doi.org/10.1007/3-540-68339-9_34
Identifiers
- DOI
- 10.1007/3-540-68339-9_34