Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Provably Secure Blind Signature Schemes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Distributed "magic ink" signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
StemCerts-2: pairs of X.509 v3 certificates for greater security, flexibility and convenience
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Hi-index | 0.00 |
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.