Abstract
Fail-stop signature (FSS) is information theoretically secure digital signature in the sense that even if a signature is forged, the signer can prove the forgery with overwhelming probability. There are many known constructions of FSS schemes based on various assumptions. Among them, factoring-based schemes are important due to their high reliability. However, known factoring-based FSS schemes generally suffer from their large signature sizes, which are larger than |N|, where |N| is the length of an underlying composite number.
In this paper, we propose a new factoring-based FSS scheme. For this purpose, we propose a variant of the generic construction of FSS schemes based on a bundling homomorphism. Specifically, we introduce a notion of a collision resistant group generator, which can be seen as a variant of a bundling homomorphism, and propose a generic construction of FSS schemes based on it. Then we propose a construction of a collision resistant group generator based on the factoring assumption. This yields the first factoring-based FSS scheme whose signature size is smaller than |N|.
The first author is supported by a JSPS Fellowship for Young Scientists.
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
Coron, J.-S., Joux, A., Mandal, A., Naccache, D., Tibouchi, M.: Cryptanalysis of the RSA subgroup assumption from TCC 2005. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 147–155. Springer, Heidelberg (2011)
Girault, M.: Self-certified public keys. In: Davies, D.W. (ed.) Advances in Cryptology - EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)
Groth, J.: Cryptography in subgroups of \(\mathbb{Z}_n^*\). In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 50–65. Springer, Heidelberg (2005)
Mashatan, A., Ouafi, K.: Efficient fail-stop signatures from the factoring assumption. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 372–385. Springer, Heidelberg (2011)
Torben, P.: Pedersen and Birgit Pfitzmann: Fail-stop signatures. SIAM J. Comput. 26(2), 291–330 (1997)
Pointcheval, D.: The composite discrete logarithm and secure authentication. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 113–128. Springer, Heidelberg (2000)
Schmidt-Samoa, K.: Factorization-based fail-stop signatures revisited. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 118–131. Springer, Heidelberg (2004)
Susilo, W.: Short fail-stop signature scheme based on factorization and discrete logarithm assumptions. Theor. Comput. Sci. 410(8-10), 736–744 (2009)
Susilo, W., Mu, Y.: Provably secure fail-stop signature schemes based on RSA. IJWMC 1(1), 53–60 (2005)
Susilo, W., Safavi-Naini, R.: An efficient fail-stop signature scheme based on factorization. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 62–74. Springer, Heidelberg (2003)
Susilo, W., Safavi-Naini, R., Gysin, M., Seberry, J.: A new and efficient fail-stop signature scheme. Comput. J. 43(5), 430–437 (2000)
van Heyst, E., Pedersen, T.P.: How to make efficient fail-stop signatures. In: Rueppel, R.A. (ed.) Advances in Cryptology - EUROCRYPT 1992. LNCS, vol. 658, pp. 366–377. Springer, Heidelberg (1993)
Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco - underconditional sender and recipient untraceability with computationally secure serviceability (abstract). In: Quisquater, J.-J., Vandewalle, J. (eds.) Advances in Cryptology - EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yamakawa, T., Kitajima, N., Nishide, T., Hanaoka, G., Okamoto, E. (2014). A Short Fail-Stop Signature Scheme from Factoring. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds) Provable Security. ProvSec 2014. Lecture Notes in Computer Science, vol 8782. Springer, Cham. https://doi.org/10.1007/978-3-319-12475-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-12475-9_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12474-2
Online ISBN: 978-3-319-12475-9
eBook Packages: Computer ScienceComputer Science (R0)