Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Notions of Key Exchange and Secure Channels
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
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
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
A survey of certificateless encryption schemes and security models
International Journal of Information 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
The twin Diffie-Hellman problem and applications
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Pairing-Based Onion Routing with Improved Forward Secrecy
ACM Transactions on Information and System Security (TISSEC)
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
HMQV: a high-performance secure diffie-hellman protocol
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
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
Toward pairing-free certificateless authenticated key exchanges
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
Ace: an efficient key-exchange protocol for onion routing
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
| Hi-index | 0.00 |
Onion routing protocols allow users to establish anonymous channels to preserve their privacy over a public network. Several protocols implementing this primitive have been proposed in recent years, and TOR, a real-life implementation, provides an onion routing service to thousands of users over the internet. This paper presents Certificateless Onion Routing a new approach to the problem. Starting from the identity based solution (PB-OR) of Kate et al. [23], we adopt the certificateless setting introduced by Al-Riyami and Paterson [2]. Such a setting is particularly well suited in practice as it retains the good aspects of identity based cryptography (no PKI is required) and traditional public key cryptography (there is no key escrow). Next, we present a novel certificateless anonymous key-agreement (KA) protocol and we show how to turn it into a very efficient (and provably secure!) certificateless onion routing protocol. When compared with Tor and PB-OR, our protocol offers better performances, especially when current security levels (i.e. 128 bits) are considered. In particular, our scheme significantly improves the computational costs required from each router. In this sense our solution is up to 7 times faster than PB-OR and up to 11 times faster than Tor.