Abstract
Blind signature allows the user to obtain a signature of a message in a way that the signer learns neither the message nor the resulting signature. Recently a lot of signature or encryption schemes are provably secure with random oracle, which could not lead to a cryptographic scheme secure in the standard model. Therefore designing efficient schemes provably secure in the standard model is a central line of modern cryptography. Followed this line, we proposed an efficiently blind signature without using hash function. Based on the complexity of q-SDH problem, we present strict proof of security against one more forgery under adaptive chosen message attack in the standard model. A full blind testimony demonstrates that our scheme bear blind property. Compared with other blind signature schemes, we think proposed scheme is more efficient. To the best of our knowledge, our scheme is the first blind signature scheme from pairings proved secure in the standard model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chaum, D.: Blind Signatures for Untraceable Payments. In: Crypto 1982, Plenum, pp. 199–203 (1983)
Juels, A., Luby, M., Ostrobsky, R.: Security of Blind Digital Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150–164. Springer, Heidelberg (1997)
Boldyreva, A.: Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman group signature scheme. In: Desmedt, Y.G. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 31–46. Springer, Berlin (2003)
Fangguo, Z., Kwangjo, K.: ID-Based Blind Signature and Ring Signature from Pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 533–547. Springer, Heidelberg (2002)
Fangguo, Z., Kwangjo, K.: Effcient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 312–323. Springer, Heidelberg (2003)
Sherman, S.M., Lucas, C.K., Yiu, S.M., Chow, K.P.: Two Improved Partially Blind Signature Schemes from Bilinear Pairings (2004), Available at, http://eprint.iacr.org/2004/108.pdf
Fangguo, Z., Reihaneh, S.N., Willy, S.: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 191–204. Springer, Heidelberg (2003)
Camenisch, J., Koprowski, M., Warinschi, B.: Efficient Blind Signatures without Random Oracles. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 134–148. Springer, Heidelberg (2005)
Boneh, D., Boyen, X.: Short Signature without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liao, J., Qi, Y., Huang, P., Rong, M. (2005). Pairing-Based Provable Blind Signature Scheme Without Random Oracles. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_24
Download citation
DOI: https://doi.org/10.1007/11596981_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30819-5
Online ISBN: 978-3-540-31598-8
eBook Packages: Computer ScienceComputer Science (R0)