Abstract
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even if an adversary breaks the scheme’s underlying computational hard problem and hence forges a signature, then with overwhelming probability the signer is able to prove that a forgery has occurred (i.e. that the underlying hard problem has been broken). Although there is a practical FSS scheme based on the discrete logarithm problem, no provable secure FSS scheme is known that is based on the pure factorization problem (i.e. the assumption that integer factoring for arbitrary integers is hard). To be more concrete, the most popular factorization based FSS scheme relies on the assumption that factoring a special kind of Blum integers is intractable. All other FSS schemes related to integer factoring are based on even stronger assumptions or insecure.
In this paper, we first cryptanalyze one of those schemes and show how to construct forged signatures that don’t enable the signer to prove forgery. Then we repair the scheme at the expense of a reduced message space. Finally, we develop a new provable secure scheme based on the difficulty of factoring integers of the shape p 2 q for primes p,q.
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
Adleman, L., McCurley, K.S.: Open problems in number-theoretic complexity ii. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291–322. Springer, Heidelberg (1994)
Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring N = p’q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 326–337. Springer, Heidelberg (1999)
Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 366–377. Springer, Heidelberg (1997)
Bleumer, G., Pfitzmann, B., Waidner, M.: A remark on signature scheme where forgery can be proved. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 441–445. Springer, Heidelberg (1991)
Fujisaki, E., Kobayashi, T., Morita, H., Oguro, H., Okamoto, T., Okazaki, S., Pointcheval, D., Uchiyarna, S.: EPOC: Efficient probabilistic public-key encryption
Fujioka, A., Okamoto, T., Miyaguchi, S.: ESIGN: An efficient digital signature implementation for smart cards. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 446–457. Springer, Heidelberg (1991)
Goldwasscr, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281–308 (1988)
Lcnstra Jr., I.W.: Factoring integers with elliptic curves. Ann. of Math. 126, 649–673 (1987)
Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Heidelberg (1993)
Okamoto, T., Uchiyarna, S.: A new public-key cryptosys-tem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–317. Springer, Heidelberg (1998)
Peralta, R., Okamoto, E.: Faster factoring of integers of a special form. TIE ICE: IEICE Transactions on Communica-tions/Eleetrxmicu/Information and Systems (1996)
Pedersen, T.P., Pfitzmann, B.: Fail-stop signatures. SIAM Journal on Computing 26(2), 291–330 (1997)
Pfitzmann, B., Waidner, M.: Formal aspects of fail-stop signatures. Technical report, Universitat Karlsruhe (1990)
Shoup, V.: On the security of a practical identification scheme. Journal of Cryptology: the journal of the International Association for Cryptologic Research 12(4), 247–260 (1999)
Schmidt-Samoa, K.: Factorization-based fail-stop signatures revisited. Technical Iteport Ti-7/04, Teclmische Universitat Darmstadt (2004)
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-Nairn, R., Gysin, M., Seberry, J.: A new and efficient fail-stop signature scheme. The Computer Journal 43(5), 430–437 (2000)
Susilo, W., Safavi-Nairn, R., Pieprzyk, J.: RSA-based fail-stop signature schemes. In: ICPP Workshop, pp. 161–166 (1999)
Takagi, T.: Fast RSA-typc cryptosystcm modulo pkq. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 318–326. Springer, Heidelberg (1998)
Takagi, T.: A fast RSA-typc public-key primitive modulo pkq using hensel lifting. IEICE Iransactions E87-A(l), 94–101 (2004)
van Heyst, E., Pedersen, T.P.: How to make efficient fail-stop signatures. In: Advances in Cryptology - EUROCRYPT 1992, Berlin. lecture Notes in Computer Science, vol. 1070, pp. 366–377. Springer-, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt-Samoa, K. (2004). Factorization-Based Fail-Stop Signatures Revisited. In: Lopez, J., Qing, S., Okamoto, E. (eds) Information and Communications Security. ICICS 2004. Lecture Notes in Computer Science, vol 3269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30191-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30191-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23563-7
Online ISBN: 978-3-540-30191-2
eBook Packages: Springer Book Archive