Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
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
SIAM Journal on Computing
Limits of Anonymity in Open Environments
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 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
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Provably secure public-key encryption for length-preserving chaumian mixes
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
The traffic analysis of continuous-time mixes
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
On flow correlation attacks and countermeasures in mix networks
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Privacy-preserving demographic filtering
Proceedings of the 2006 ACM symposium on Applied computing
Achieving privacy in mesh networks
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Journal of Computer Security
Probabilistic analysis of onion routing in a black-box model
Proceedings of the 2007 ACM workshop on Privacy in electronic society
An Analysis Study on Zone-Based Anonymous Communication in Mobile Ad Hoc Networks
IEEE Transactions on Dependable and Secure Computing
Adaptive trust-based anonymous network
International Journal of Security and Networks
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Breaking and Provably Fixing Minx
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Anonymous return route information for onion based mix-nets
Proceedings of the workshop on Applications of private and anonymous communications
Quantification of Anonymity for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 16th ACM conference on Computer and communications security
A Parallelism-Based Approach to Network Anonymization
NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
Anonymous Transactions in Computer Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Rerandomizable RCCA encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
A model of onion routing with provable anonymity
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Conditional probabilities over probabilistic and nondeterministic systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Pairing-Based Onion Routing with Improved Forward Secrecy
ACM Transactions on Information and System Security (TISSEC)
Preventing active timing attacks in low-latency anonymous communication
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Security of sequential multiple encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
AOS: an anonymous overlay system for mobile ad hoc networks
Wireless Networks
Fully non-interactive onion routing with forward-secrecy
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Trust-based anonymous communication: adversary models and routing algorithms
Proceedings of the 18th ACM conference on Computer and communications security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Using sphinx to improve onion routing circuit construction
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Klein bottle routing: an alternative to onion routing and mix network
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Anonymous transactions in computer networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
Universally composable security with local adversaries
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Enhanced security in internet voting protocol using blind signatures and dynamic ballots
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
International Journal of Security and Networks
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks
ACM Transactions on Sensor Networks (TOSN)
On the limits of provable anonymity
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Enhanced security in internet voting protocol using blind signature and dynamic ballots
Electronic Commerce Research
| Hi-index | 0.00 |
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the cryptographic aspects of onion routing have not been sufficiently explored: no satisfactory definitions of security have been given, and existing constructions have only had ad-hoc security analysis for the most part. We provide a formal definition of onion-routing in the universally composable framework, and also discover a simpler definition (similar to CCA2 security for encryption) that implies security in the UC framework. We then exhibit an efficient and easy to implement construction of an onion routing scheme satisfying this definition.