Abstract
We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.
Supported by nsf Career Award, DARPA, and Packard Foundation.
Supported by Microsoft Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Barić and B. Pfitzmann, “Collision-free accumulators and fail-stop signature schemes without trees,” Proc. of Eurocrypt’97, pp. 480–494, 1997. 100
D. Boneh and M. Franklin, “Identity based encryption from the Weil pairing,” Proc. of CRYPTO’01, pp. 213–229, 2001. Also http://eprint.iacr.org/2001/090/. 99, 100, 108
D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the Weil pairing,” Proc. of Asiacrypt’01, pp. 514–532, 2001. 99
M. Bellare and P. Rogaway, “Optimal asymmetric encryption—how to encrypt with RSA,” Proc. of Eurocrypt’94, pp. 92–111, 1994. 101
R. Cramer and I. Damgård, “Secure signature schemes based on interactive protocols,” Proc. of CRYPTO’95, pp. 297–310, 1995. 99, 102
R. Cramer and I. Damgård, “New generation of secure and practical RSAbased signatures,” Proc. of CRYPTO’96, pp. 173–185, 1996. 98, 102, 103
R. Cramer and V. Shoup, “Signature schemes based on the Strong RSA assumption,” Proc. of ACM CCS’99, pp. 46–51, 1999. Full version appeared in ACM TISSEC, v. 3(3), pp. 161–185, 2000. 98, 102, 103
C. Dwork and M. Naor, “An efficient existentially unforgeable signature scheme and its applications,” Proc. of CRYPTO’94, pp. 234–246, 1994. Full version appeared in J. of Cryptology, v. 11(2), pp. 187–208, 1998. 98, 102, 103
U. Feige, A. Fiat, and A. Shamir, “Zero-knowledge proofs of identity,” J. of Cryptology, v. 1, pp. 77–94, 1988.
R. Gennaro, S. Halevi, and T. Rabin, “Secure hash-and-sign signatures without the random oracle,” Proc. of Eurocrypt’99, pp. 123–139, 1999. 98, 102, 103
C. Gentry and A. Silverberg, “Hierarchical ID-based cryptography”, Proc. of Asiacrypt’02, pp. 548–566, 2002. 99
O. Goldreich, “Two remarks concerning the Goldwasser-Micali-Rivest signature scheme,” Proc. of CRYPTO’86, pp. 104–110, 1986. 103, 104
S. Goldwasser, S. Micali, and R. Rivest, “A ‘paradoxical’ solution to the signature problem (extended abstract),” Proc. of FOCS’84, pp. 441–448, 1984. Journal version in [GMR88]. 101, 102
S. Goldwasser, S. Micali, and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM J. on Computing, 17(2), pp. 281–308, 1988. 101, 110
J. Horwitz and B. Lynn, “Towards hierarchical identity-based encryption”, Proc. of Eurocrypt’02, pp. 466–481, 2002. 99
A. Joux, “A one-round protocol for tripartite Diffie-Hellman,” Proc. of ANTS’00, pp. 385–394, 2000. 99
A. Lysyanskaya, “Unique signatures and verifiable random functions from DH-DDH separation,” Proc. of CRYPTO’02, pp. 597–612, 2002. 99, 102
S. Micali, M. Rabin, and S. Vadhan, “Verifiable random functions,” Proc. of FOCS’99, pp. 120–130, 1999. 99
A. Miyaji, M. Nakabayashi, and S. Takano, “New explicit condition of elliptic curve trace for FR-reduction,” IEICE Trans. Fundamentals, v. E84 A(5), May 2001. 109
M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications,” Proc. of STOC’89, pp. 33–43, 1989. 98, 102
D. Pointcheval and J. Stern, “Security proofs for signature schemes,” in Proc. of Eurocrypt’96, pp. 387–398, 1996. 99
J. Rompel, “One-way functions are necessary and sufficient for secure signatures,” Proc. of STOC’90, pp. 387–394, 1990. 98, 102
E. Verheul, “Self-Blindable Credential Certificates from the Weil Pairing,” Proc. of Asiacrypt’01, pp. 533–551, 2001. 99
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boneh, D., Mironov, I., Shoup, V. (2003). A Secure Signature Scheme from Bilinear Maps. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-36563-X_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00847-7
Online ISBN: 978-3-540-36563-1
eBook Packages: Springer Book Archive