Committal deniable signatures over elliptic curves

In this paper, a new deniable signature scheme, i.e. the committal deniable signature scheme is proposed. This scheme has been constructed by use of bilinear pairings over elliptic curves. In addition to the general property possessed by other deniable signature schemes, there are some new features for this new scheme. One important of them is that signer is not able to forge this type of deniable signatures on behalf of the verifier or any third party. Another feature is that any third party, even though she can obtain the committal deniable signatures by tapping, cannot distinguish the actual signer between the verifier and the signer in the underlying system.

[1]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[2]  Steven D. Galbraith,et al.  Implementing the Tate Pairing , 2002, ANTS.

[3]  Nigel P. Smart,et al.  AN IDENTITY BASED AUTHENTICATED KEY AGREEMENT PROTOCOL BASED ON THE WEIL PAIRING , 2001 .

[4]  Jean-Jacques Quisquater,et al.  A new identity based signcryption scheme from pairings , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

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

[6]  Ronald Cramer,et al.  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[7]  Claus-Peter Schnorr,et al.  Efficient signature generation by smart cards , 2004, Journal of Cryptology.

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  Antoine Joux A One Round Protocol for Tripartite Diffie-Hellman , 2000, ANTS.

[10]  Paulo S. L. M. Barreto,et al.  Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[11]  Antoine Joux,et al.  Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptology ePrint Archive.

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

[13]  Tad Hogg,et al.  Enhancing privacy and trust in electronic communities , 1999, EC '99.

[14]  Liqun Chen,et al.  Applications of Multiple Trust Authorities in Pairing Based Cryptosystems , 2002, InfraSec.

[15]  Andreas Enge,et al.  Practical Non-Interactive Key Distribution Based on Pairings , 2002, IACR Cryptology ePrint Archive.

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

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

[18]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..