CryptoDB
Short Signatures Without Random Oracles
Authors: | |
---|---|
Download: | |
Abstract: | We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the {\em Strong Diffie-Hellman} assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes without random oracles. However, signatures generated by our scheme are much shorter and simpler than signatures from schemes based on Strong RSA. Furthermore, our scheme provides a limited form of message recovery. |
BibTeX
@misc{eprint-2004-12143, title={Short Signatures Without Random Oracles}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / digital signatures, provable security}, url={http://eprint.iacr.org/2004/171}, note={An extended abstract appears in EUROCRYPT 2004. eprint@boyen.org 12620 received 20 Jul 2004, last revised 21 Jul 2004}, author={Dan Boneh and Xavier Boyen}, year=2004 }