The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
Anonymous Web transactions with Crowds
Communications of the ACM
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
The disadvantages of free MIX routes and how to overcome them
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Anonymity on the Internet: why the price may be too high
Communications of the ACM - Supporting community and building social capital
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Cocaine Auction Protocol: On the Power of Anonymous Broadcast
IH '99 Proceedings of the Third International Workshop on Information Hiding
From a Trickle to a Flood: Active Attacks on Several Mix Types
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
RSA-OAEP Is Secure under the RSA Assumption
Journal of Cryptology
Off-the-record communication, or, why not to use PGP
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Secure off-the-record messaging
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Eluding carnivores: file sharing with strong anonymity
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Efficient anonymity-preserving data collection
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
M2: Multicasting Mixes for Efficient and Anonymous Communication
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Cryptography (Discrete Mathematics and Its Applications)
Cryptography (Discrete Mathematics and Its Applications)
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Advances in cryptographic voting systems
Advances in cryptographic voting systems
PeerReview: practical accountability for distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Denial of service or denial of security?
Proceedings of the 14th ACM conference on Computer and communications security
Membership-concealing overlay networks
Proceedings of the 16th ACM conference on Computer and communications security
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Reliable MIX cascade networks through reputation
FC'02 Proceedings of the 6th international conference on Financial cryptography
Synchronous batching: from cascades to free routes
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Towards a formal model of accountability
Proceedings of the 2011 workshop on New security paradigms workshop
Faceless: decentralized anonymous group messaging for online social networks
Proceedings of the Fifth Workshop on Social Network Systems
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
Dissent in numbers: making strong anonymity scale
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Hang with your buddies to resist intersection attacks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Accountability and deterrence in online life
Proceedings of the 3rd International Web Science Conference
Proactively accountable anonymous messaging in verdict
SEC'13 Proceedings of the 22nd USENIX conference on Security
Crypto-Book: an architecture for privacy preserving online identities
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Hi-index | 0.00 |
Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group's communication. Existing messaging protocols such as DC-nets leave groups vulnerable to denial-of-service and Sybil attacks, Mix-nets are difficult to protect against traffic analysis, and accountable voting protocols are unsuited to general anonymous messaging. We present the first general messaging protocol that offers provable anonymity with accountability for moderate-size groups, and efficiently handles unbalanced loads where few members wish to transmit in a given round. The N group members first cooperatively shuffle an N x N matrix of pseudorandom seeds, then use these seeds in N "pre-planned" DC-nets protocol runs. Each DC-nets run transmits the variable-length bulk data comprising one member's message, using the minimum number of bits required for anonymity under our attack model. The protocol preserves message integrity and one-to-one correspondence between members and messages, makes denial-of-service attacks by members traceable to the culprit, and efficiently handles large, unbalanced message loads. A working prototype demonstrates the protocol's practicality for anonymous messaging in groups of 40+ members.