Networks without user observability—design options
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Unconditional sender and recipient untraceability in spite of active attacks
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The design, implementation and operation of an email pseudonym server
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The tracker: a threat to statistical database security
ACM Transactions on Database Systems (TODS)
A protocol for anonymous communication over the Internet
Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
COCA: A Secure Distributed On-line Certification Authority
COCA: A Secure Distributed On-line Certification Authority
Receiver anonymity via incomparable public keys
Proceedings of the 10th ACM conference on Computer and communications security
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
Information Leakage in Optimal Anonymized and Diversified Data
Information Hiding
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
| Hi-index | 0.00 |
Public and private communication networks have a growing importance for our daily life. The globally networked society places great demand on the dissemination and sharing of person-specific data. In order to protect the anonymity of individuals to whom released the data refer, data holders often remove or encrypt explicit identifiers such as names, addresses and phone numbers. But these cannot solve the problem well. Anonymous communication protocols address the problem of concealing who communicates with whom, as in the case of letters from a secret admirer. To gain efficiency, k-anonymous message transmission is presented. Informally, a communication protocol is sender k-anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down its search to a set of k suspects. Receiver k-anonymity places a similar guarantee on the receiver: an adversary, at best, can only narrow down the possible receivers to a set of size k. In this paper, a k-anonymous transmission protocol is presented. The protocol is based on asymmetric encryption algorithm. All the members in the protocol is divided into smaller groups, and if all the members in the group perform the protocol correctly, the protocol is sender k-anonymous and receiver k-anonymous. Furthermore, as long as the asymmetric encryption algorithm is secure, our protocol is secure, too.