Anonymous traceable disclosure scheme using pairing over elliptic curve

Anonymity can protect a user's privacy, however it is hard to manage. It is hard to disclose anonymously. In addition, it is also hard to make people trust anonymous information. In this paper, we provide a key exchange scheme for not only anonymous, but also traceable disclosure. To be more precise, one who provides information can anonymously guarantee communication with particular person. Furthermore, his anonymity can be retained even if he discloses communication contents. These features can not realized by using signature scheme, or any other existing methods. Our method enable those features, and it can be useful when a group is dealing with confidential information.

[1]  Divya Nalla.  ID-based tripartite key agreement with signatures , 2003, IACR Cryptol. ePrint Arch..

[2]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

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

[4]  F O R M A T I O N S O F T W A R E A N D T H E G R A.  Magic Ink , .

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

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

[7]  Florian Hess,et al.  Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.

[8]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[9]  Markus Jakobsson,et al.  Distributed "Magic Ink" Signatures , 1997, EUROCRYPT.

[10]  David Pointcheval,et al.  The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.

[11]  Masayuki Abe,et al.  Provably Secure Fair Blind Signatures with Tight Revocation , 2001, ASIACRYPT.

[12]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[13]  Ivan Damgård,et al.  Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes , 2000, ASIACRYPT.

[14]  Giuseppe Ateniese,et al.  Efficient verifiable encryption (and fair exchange) of digital signatures , 1999, CCS '99.

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

[16]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

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