Abstract
An automorphic signature scheme is a signature scheme that is structure-preserving (messages are group elements and never hashed or sliced into bits in the signing function) and allows self-signing (can sign its own verification-key, i.e., the message space covers the verification-key space). Given an automorphic signature scheme that can sign only one group element as a message, we show how to efficiently sign n group elements where n is sufficiently large or even unbounded. With an existing construction, the size of the resulting signature grows with factor of 4n and it is claimed to be optimal in some sense. Our constructions achieve 3n and even 2n. Since the signature scheme may be used repeatedly or even recursively in applications, the improvement in the multiplicative factor results in considerable efficiency gain in practice.
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
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209–236. Springer, Heidelberg (2010)
Abe, M., Haralambiev, K., Ohkubo, M.: Signing on group elements for modular protocol designs. Cryptology ePrint Archive, Report 2010/133 (2010), http://eprint.iacr.org
Cathalo, J., Libert, B., Yung, M.: Group encryption: Non-interactive realization in the standard model. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 179–196. Springer, Heidelberg (2009)
Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, Aula der Universiteit (1996)
Fuchsbauer, G.: Automorphic signatures in bilinear groups. IACR ePrint Archive 2009/320. Version 20100317:094214 (dated March 17, 2010)
Garay, J., MacKenzie, P., Yang, K.: Strengthening zero-knowledge protocols using signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 177–194. Springer, Heidelberg (2003); Full version available from IACR e-print archive 2003/037
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281–308 (1988)
Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444–459. Springer, Heidelberg (2006)
Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008); Full version available: IACR ePrint Archive 2007/155
Katz, J.: Digital Signatures. Springer, Heidelberg (2010)
Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27(4) (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abe, M., Haralambiev, K., Ohkubo, M. (2011). Efficient Message Space Extension for Automorphic Signatures. In: Burmester, M., Tsudik, G., Magliveras, S., Ilić, I. (eds) Information Security. ISC 2010. Lecture Notes in Computer Science, vol 6531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18178-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-18178-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18177-1
Online ISBN: 978-3-642-18178-8
eBook Packages: Computer ScienceComputer Science (R0)