Strongly unforgeable signatures based on computational Diffie-Hellman

Strongly unforgeable signatures based on computational Diffie-Hellman (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dan Boneh , Emily Shen , Brent Waters

Venue:	In Proc. of PKC 2006
Citations:	17 - 0 self

BibTeX

@INPROCEEDINGS{Boneh06stronglyunforgeable,
    author = {Dan Boneh and Emily Shen and Brent Waters},
    title = {Strongly unforgeable signatures based on computational Diffie-Hellman},
    booktitle = {In Proc. of PKC 2006},
    year = {2006},
    pages = {229--240},
    publisher = {Springer-Verlag}
}

Bookmark

OpenURL

Abstract

Abstract. A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosen ciphertext secure systems and group signatures. Current efficient constructions in the standard model (i.e. without random oracles) depend on relatively strong assumptions such as Strong-RSA or Strong-Diffie-Hellman. We construct an efficient strongly unforgeable signature system based on the standard Computational Diffie-Hellman problem in bilinear groups. 1

Citations

2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al. - 1997
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
460	signatures from the Weil pairing - Boneh, Lynn, et al.
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
288	The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
220	A one round protocol for tripartite Diffie-Hellman - Joux - 2000
209	A practical and provably secure coalition-resistant group signature scheme - Ateniese, Camenisch, et al. - 2000
201	Short group signatures - Boneh, Boyen, et al. - 2004
186	Short signatures without random oracles and the sdh assumption in bilinear groups - Boneh, Boyen
156	Efficient identity-based encryption without random oracles - Waters - 2005
131	Chosen-ciphertext security from identity-based encryption - Boneh, Canetti, et al.
127	Signature schemes based on the strong RSA assumption - Cramer, Shoup
113	On the security of joint signature and encryption - An, Dodis, et al. - 2002
106	Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi, et al. - 1999
101	On the exact security of full domain hash - Coron - 2000
87	Collision free hash functions and public key signature schemes - Damg˚ard
84	Digitalized signatures - Rabin - 1978
42	M.Naor, An efficient existentially unforgeable signature scheme and its applications - Dwork - 1994
32	Verifiable random functions - Micali, Rabin, et al. - 1999
31	Unique Signatures and Verifiable random functions from DH-DDH Seperation - Lysyanskaya - 2002
30	New generation of secure and practical RSA-based signatures - Cramer, Damg˚ard - 1996
27	Two remarks concerning the Goldwasser-Micali-Rivest signature scheme - Goldreich - 1986
21	Efficient construction of (distributed) verifiable random functions - Dodis
21	A signature scheme as secure as the Diffie-Hellman problem - Goh, Jarecki - 2003
19	Collision-free hash functions and public key signature schemes - Damg˚ard - 1987
18	An Introduction to Threshold Cryptography - Gemmel
16	A secure Signature Scheme from Bilinear Maps - Boneh, Mironov, et al.
10	Improving the exact security of digital signature schemes - Micali, Reyzin