Unconditionally Secure Digital Signature Schemes Admitting Transferability

A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new generation of computing devices such as quantum computers. Therefore while these signature schemes represent an efficient solution to the short term integrity (unforgeability and non-repudiation) of digital data, they provide no confidence on the long term (say of 20 years) integrity of data signed by these schemes. In this work, we focus on signature schemes whose security does not rely on any unproven assumption. More specifically, we establish a model for unconditionally secure digital signatures in a group, and demonstrate practical schemes in that model. An added advantage of the schemes is that they allow unlimited transfer of signatures without compromising the security of the schemes. Our scheme represents the first unconditionally secure signature that admits provably secure transfer of signatures.

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

[2]  David Chaum,et al.  Unconditionally Secure Digital Signatures , 1990, CRYPTO.

[3]  Reihaneh Safavi-Naini,et al.  Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions , 1999, Inf. Comput..

[4]  David Chaum,et al.  Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer , 1991, CRYPTO.

[5]  Y Desmedt,et al.  ARBITRATED UNCONDITIONALLY SECURE AUTHENTICATION CAN BE UNCONDITIONALLY PROTECTED AGAINST ARBITER ATTACKS , 1991, CRYPTO 1991.

[6]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[7]  Jennifer Seberry,et al.  HAVAL - A One-Way Hashing Algorithm with Variable Length of Output , 1992, AUSCRYPT.

[8]  Reihaneh Safavi-Naini,et al.  New Results on Multi-Receiver Authentication Codes , 1998, EUROCRYPT.

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

[10]  Gustavus J. Simmons,et al.  Message Authentication with Arbitration of Transmitter/Receiver Disputes , 1987, EUROCRYPT.

[11]  Thomas Johansson.  Further Results on Asymmetric Authentication Schemes , 1999, Inf. Comput..

[12]  Reihaneh Safavi-Naini,et al.  A3-Codes under Collusion Attacks , 1999, ASIACRYPT.

[13]  Reihaneh Safavi-Naini,et al.  Broadcast authentication for group communication , 2001, Theor. Comput. Sci..

[14]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[15]  Richard Taylor,et al.  Near Optimal Unconditionally Secure Authentication , 1994, EUROCRYPT.

[16]  Thomas Johansson.  Lower bounds on the probability of deception in authentication with arbitration , 1994, IEEE Trans. Inf. Theory.

[17]  Moti Yung,et al.  Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[18]  Satoshi OBANA,et al.  A2-code = Affine resolvable = BIBD , 1997, ICICS.

[19]  Tatsuaki Okamoto.  A fast signature scheme based on congruential polynomial operations , 1990, IEEE Trans. Inf. Theory.

[20]  Jeff Gilchrist,et al.  Factorization of a 512-Bit RSA Modulus , 2000, EUROCRYPT.

[21]  Satoshi Obana,et al.  Combinatorial Bounds on Authentication Codes with Arbitration , 1995, Des. Codes Cryptogr..

[22]  Kaoru Kurosawa,et al.  New Bound on Authentication Code with Arbitration , 1994, CRYPTO.

[23]  Air Force Air Force Materiel Command Hq.  FIPS-PUB-180-1 , 1995 .

[24]  Moti Yung,et al.  Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract) , 1990, CRYPTO.

[25]  Richard J. Lipton,et al.  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.

[26]  Gustavus J. Simmons,et al.  Authentication Theory/Coding Theory , 1985, CRYPTO.

[27]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[28]  Reihaneh Safavi-Naini,et al.  Bounds and Constructions for Multireceiver Authentication Codes , 1998, ASIACRYPT.

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

[30]  Bart Preneel,et al.  RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.