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 knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
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
Perfectly secure message transmission
Journal of the ACM (JACM)
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A Secure Group Membership Protocol
IEEE Transactions on Software Engineering
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
Anonymity-preserving data collection
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Anonymity and information hiding in multiagent systems
Journal of Computer Security
On the effectiveness of k;-anonymity against traffic analysis and surveillance
Proceedings of the 5th ACM workshop on Privacy in electronic society
A k-anonymous communication protocol for overlay networks
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
BitBlender: light-weight anonymity for BitTorrent
Proceedings of the workshop on Applications of private and anonymous communications
Efficient and Anonymous Online Data Collection
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Collusion-resistant anonymous data collection method
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Sciences: an International Journal
Anonymous opinion exchange over untrusted social networks
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Providing Source-Location Privacy in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Online anonymity for personalized web services
Proceedings of the 18th ACM conference on Information and knowledge management
Preserving source-location privacy in wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Survey on anonymous communications in computer networks
Computer Communications
SPM: source privacy for mobile ad hoc networks
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks
Pervasive and Mobile Computing
Source-location privacy through dynamic routing in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Dissent: accountable anonymous group messaging
Proceedings of the 17th ACM conference on Computer and communications security
Event handoff unobservability in WSN
iNetSec'10 Proceedings of the 2010 IFIP WG 11.4 international conference on Open research problems in network security
"Mix-in-Place" anonymous networking using secure function evaluation
Proceedings of the 27th Annual Computer Security Applications Conference
A new k-anonymous message transmission protocol
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Selectively traceable anonymity
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
On partial anonymity in secret sharing
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Brief announcement: scalable anonymous communication with byzantine adversary
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proactively accountable anonymous messaging in verdict
SEC'13 Proceedings of the 22nd USENIX conference on Security
| Hi-index | 0.01 |
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 we introduce the notions of sender and receiver k-anonymity and consider their applications. We show that there exist simple and efficient protocols which are k-anonymous for both the sender and the receiver in a model where a polynomial time adversary can see all traffic in the network and can control up to a constant fraction of the participants. Our protocol is provably secure, practical, and does not require the existence of trusted third parties. This paper also provides a conceptually simple augmentation to Chaum's DC-Nets that adds robustness against adversaries who attempt to disrupt the protocol through perpetual transmission or selective non-participation.