Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility

In this paper, we present the firstconcrete example of identity-based undeniable signature withselective and universal convertibility, where the signer can release a selective proof to make a single undeniable signature publicly verifiable, or publish a universal proof to convert all his undeniable signatures into ordinary digital signatures. Furthermore, we also formalized the security models of identity-based convertible undeniable signatures. The new models capture more essence of the property "convertibility" of identity-based undeniable signatures, compared with other known security models. Our scheme can be regarded as an improvement of Libert and Quisquater's identity-based undeniable signature scheme published in CT-RSA 2004. The security of our scheme is formally proven in the random oracle model under some well-known complexity assumptions. Its unforgeability relies on the hardness of the Computational Diffie-Hellman problem, while the invisibility (and anonymity) is based on the hardness of Decisional Bilinear Diffie-Hellman problem.

[1]  Dongho Won,et al.  Information Security and Cryptology — ICISC 2000 , 2001, Lecture Notes in Computer Science.

[2]  Markus Jakobsson,et al.  Designated Verifier Proofs and Their Applications , 1996, EUROCRYPT.

[3]  Colin Boyd,et al.  Advances in Cryptology - ASIACRYPT 2001 , 2001 .

[4]  David Chaum,et al.  Convertible Undeniable Signatures , 1990, CRYPTO.

[5]  Patrick Horster,et al.  Breaking and repairing a convertible undeniable signature scheme , 1996, CCS '96.

[6]  Ivan Damgård,et al.  New Convertible Undeniable Signature Schemes , 1996, EUROCRYPT.

[7]  Jan Camenisch,et al.  Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.

[8]  Tatsuaki Okamoto.  Topics in Cryptology – CT-RSA 2004 , 2004, Lecture Notes in Computer Science.

[9]  Sherman S. M. Chow.  Verifiable Pairing and Its Applications , 2004, WISA.

[10]  Steven D. Galbraith,et al.  Invisibility and Anonymity of Undeniable and Confirmer Signatures , 2003, CT-RSA.

[11]  Serge Vaudenay.  Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings , 2005, Public Key Cryptography.

[12]  Jean-Jacques Quisquater,et al.  Identity Based Undeniable Signatures , 2004, CT-RSA.

[13]  Fabien Laguillaumie,et al.  Time-Selective Convertible Undeniable Signatures , 2005, CT-RSA.

[14]  Hugo Krawczyk,et al.  RSA-Based Undeniable Signatures , 1997, Journal of Cryptology.

[15]  Marc Joye,et al.  Topics in Cryptology — CT-RSA 2003 , 2003 .

[16]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[17]  Hugo Krawczyk,et al.  RSA-Based Undeniable Signatures , 2007, Journal of Cryptology.

[18]  Kenneth G. Paterson,et al.  RSA-Based Undeniable Signatures for General Moduli , 2002, CT-RSA.

[19]  Dan Boneh,et al.  Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.

[20]  Burton S. Kaliski.  Advances in Cryptology - CRYPTO '97 , 1997 .

[21]  Song Han,et al.  Identity-based confirmer signatures from pairings over elliptic curves , 2003, EC '03.

[22]  Bart Preneel,et al.  Topics in Cryptology — CT-RSA 2002 , 2002, Lecture Notes in Computer Science.

[23]  Alfred Menezes,et al.  Topics in Cryptology – CT-RSA 2005 , 2005 .

[24]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[25]  Kefei Chen,et al.  Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings , 2006, ASIACRYPT.

[26]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[27]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[28]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[29]  Reihaneh Safavi-Naini,et al.  Attack on Han et al.'s ID-based confirmer (undeniable) signature at ACM-EC'03 , 2005, Appl. Math. Comput..

[30]  Javier Herranz,et al.  On the Generic Construction of Identity-Based Signatures with Additional Properties , 2006, ASIACRYPT.

[31]  Ueli Maurer,et al.  Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.

[32]  Takeru Miyazaki.  An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA , 2000, ICISC.

[33]  Aggelos Kiayias,et al.  Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.

[34]  Kaoru Kurosawa,et al.  The security of the FDH variant of Chaum's undeniable signature scheme , 2005, IEEE Transactions on Information Theory.