New blind signatures equivalent to factorization (extended abstract)

In this paper, we present new blind signature schemes based on the factorization problem. They are the first blind signat,ure schemes proved secure relatively to factorization. By security, we mean that no “one-more forgery” is possible even under a parallel attack. In other terms, a user that receives k electronic coins cannot manufacture K + 1. Those security definitions have been introduced by Pointcheval and Stern [lS] for use in electronic cash. In fact, blind signatures were defined with this aim and it is still their most important application, together with anonymous voting. In the following, we will present an efficient reduction of an attack to a factorization algorithm in the random oracle model [l].

[1]  Jean-Jacques Quisquater,et al.  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.

[2]  Stefan A. Brands.  A note on parallel executions of restrictive blind issuing protocols for secret-key certificates , 1995 .

[3]  Stefan A. Brands,et al.  An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .

[4]  Adi Shamir,et al.  Witness indistinguishable and witness hiding protocols , 1990, STOC '90.

[5]  C. P. Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.

[6]  Stefan A. Brands,et al.  Untraceable Off-line Cash in Wallet with Observers , 2002 .

[7]  Stefan Brands,et al.  Off-Line Electronic Cash Based on Secret-Key Certificates , 1995, LATIN.

[8]  Stefan BrandsCWI,et al.  Untraceable Oo-line Cash in Wallets with Observers , 1993 .

[9]  Claus-Peter Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1990, EUROCRYPT.

[10]  Jean-Jacques Quisquater,et al.  A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge , 1988, CRYPTO.

[11]  Jacques Stern,et al.  Security Proofs for Signature Schemes , 1996, EUROCRYPT.

[12]  Berry Schoenmakers.  An efficient electronic payment system withstanding parallel attacks , 1995 .

[13]  Claus-Peter Schnorr,et al.  Fast Signature Generation With a Fiat Shamir-Like Scheme , 1991, EUROCRYPT.

[14]  Jacques Stern,et al.  Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.

[15]  Stefan A. Brands.  Restrictive blind issuing of secret-key certificates in parallel mode , 1995 .

[16]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[17]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[18]  David Chaum,et al.  Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .

[19]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[20]  Niels Ferguson,et al.  Single Term Off-Line Coins , 1994, EUROCRYPT.

[21]  Victor Shoup.  On the Security of a Practical Identification Scheme , 1996, EUROCRYPT.

[22]  Niels Ferguson,et al.  Extensions of Single-term Coins , 1993, CRYPTO.

[23]  Tatsuaki Okamoto,et al.  Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.

[24]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[25]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.