Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
Proceedings of the First International Workshop on Information Hiding
Toward Secure Key Distribution in Truly Ad-Hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Identity-based Key Agreement Protocol for Mobile Ad-hoc Networks Using Bilinear Pairing
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Journal of Cryptology
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Provably secure non-interactive key distribution based on pairings
Discrete Applied Mathematics - Special issue: Coding and cryptography
Anonymous secure communication in wireless mobile ad-hoc networks
ICUCT'06 Proceedings of the 1st international conference on Ubiquitous convergence technology
Improving efficiency and simplicity of Tor circuit establishment and hidden services
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Practical security for disconnected nodes
NPSEC'05 Proceedings of the First international conference on Secure network protocols
Cryptosystems based on elliptic curve pairing
MDAI'05 Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the security of the tor authentication protocol
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
On anonymity in an electronic society: A survey of anonymous communication systems
ACM Computing Surveys (CSUR)
Proceedings of the 16th ACM conference on Computer and communications security
Improving efficiency and simplicity of Tor circuit establishment and hidden services
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
An anonymous communication mechanism without key infrastructure based on multi-paths network coding
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Pairing-Based Onion Routing with Improved Forward Secrecy
ACM Transactions on Information and System Security (TISSEC)
Drac: an architecture for anonymous low-volume communications
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Distributed private-key generators for identity-based cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
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
Proceedings of the 27th Annual Computer Security Applications Conference
Using sphinx to improve onion routing circuit construction
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Privacy-preserving identity-based broadcast encryption
Information Fusion
Ace: an efficient key-exchange protocol for onion routing
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
Computers and Electrical Engineering
| Hi-index | 0.00 |
This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactively constructing circuits with a telescoping method, our approach builds a circuit with a single pass. The cornerstone of the improved protocol is a new pairing-based privacy-preserving non-interactive key exchange. Compared to previous single-pass designs, our algorithm provides practical forward secrecy and leads to a reduction in the required amount of authenticated directory information. In addition, it requires significantly less computation and communication than the telescoping mechanism used by Tor. These properties suggest that pairing-based onion routing is a practical way to allow anonymity networks to scale gracefully.