The design, implementation and operation of an email pseudonym server
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Proceedings of the First International Workshop on Information Hiding
Efficiency Improvements of the Private Message Service
IHW '01 Proceedings of the 4th 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
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Preserving privacy in a network of mobile computers
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
A pseudonymous communications infrastructure for the internet
A pseudonymous communications infrastructure for the internet
Reusable anonymous return channels
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Minx: a simple and efficient anonymous packet format
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Low-Cost Traffic Analysis of Tor
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Why Johnny can't encrypt: a usability evaluation of PGP 5.0
SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
Privacy-enhancing technologies for the internet, II: five years later
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Practical traffic analysis: extending and resisting statistical disclosure
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
The traffic analysis of continuous-time mixes
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
How to Bypass Two Anonymity Revocation Schemes
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Enforcing behaviour with anonymity
Proceedings of the workshop on Applications of private and anonymous communications
On anonymity in an electronic society: A survey of anonymous communication systems
ACM Computing Surveys (CSUR)
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
Space-efficient private search with applications to rateless codes
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
"Mix-in-Place" anonymous networking using secure function evaluation
Proceedings of the 27th Annual Computer Security Applications Conference
Optimally robust private information retrieval
Security'12 Proceedings of the 21st USENIX conference on Security symposium
| Hi-index | 0.01 |
We describe the Pynchon Gate, a practical pseudonymous message retrieval system. Our design uses a simple distributed-trust private information retrieval protocol to prevent adversaries from linking recipients to their pseudonyms, even when some of the infrastructure has been compromised. This approach resists global traffic analysis significantly better than existing deployed pseudonymous email solutions, at the cost of additional bandwidth. We examine security concerns raised by our model, and propose solutions.