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
Proceedings of the First 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
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Discrete Applied Mathematics
Sphinx: A Compact and Provably Secure Mix Format
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Proceedings of the 16th ACM conference on Computer and communications security
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Improving efficiency and simplicity of Tor circuit establishment and hidden services
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
A practical congestion attack on tor using long paths
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Using sphinx to improve onion routing circuit construction
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
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
| Hi-index | 0.00 |
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless onion routing. Our new circuit constructions are also secure in the universal composability framework, a property that was missing from the original constructions. Further, we compare the performance of our schemes with their older counterparts as well as with each other.