• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

The exact security of digital signatures: How to sign with RSA and Rabin (1996)

Cached

  • Download as a PDF

Download Links

  • [www.cs.ucsd.edu]
  • [www-cse.ucsd.edu]
  • [www-cse.ucsd.edu]
  • [seclab.cs.ucdavis.edu]
  • [www.cs.ucdavis.edu]
  • [umjy.chonnam.ac.kr]
  • [www.cs.ucdavis.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Mihir Bellare , Phillip Rogaway
Citations:288 - 13 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Bellare96theexact,
    author = {Mihir Bellare and Phillip Rogaway},
    title = {The exact security of digital signatures: How to sign with RSA and Rabin},
    booktitle = {},
    year = {1996},
    pages = {399--416},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We describe an RSA-based signing scheme called PSS which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing, verification takes one RSA encryption plus some hashing, and the size of the signature is the size of the modulus. Assuming the underlying hash functions are ideal, our schemes are not only provably secure, but are so in a tight way — an ability to forge signatures with a certain amount of computational resources implies the ability to invert RSA (on the same size modulus) with about the same computational effort. Furthermore, we provide a second scheme which maintains all of the above features and in addition provides message recovery. These ideas extend to provide schemes for Rabin signatures with analogous properties; in particular their security can be tightly related to the hardness of factoring.

Citations

2292 New Directions in Cryptography - Diffie, Hellman - 1976
1130 Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
711 A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
707 How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
284 M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
253 A public-key cryptosystem and a signature scheme based on discrete logarithms - Gamal - 1985
200 Optimal Asymmetric Encryption - Bellare, Rogaway - 1994
129 Privacy enhancement for Internet electronic mail: Part III: Algorithms, modes, and identifiers - BALENSON - 1993
41 Information technology - Security techniques - Digital signature scheme giving message recovery, Part 2 : Mechanisms using a hash-function - ISOIEC - 1997
33 Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms - El - 1985
31 How to sign given any trapdoor permutation - Bellare, Micali - 1992
7 An e cient existentially unforgeable signature scheme and its applications - Dwork, Naor - 1994
4 eds.), \The development of the number eld sieve - Lenstra, Lenstra
1 Privacy Enhancement forInternet Electronic Mail: Part III: Algorithms, Modes, and Identi ers - Balenson - 1993
1 How tosigngiven any trapdoor permutation - Bellare, Micali - 1992
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University