A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
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
Authenticated Diffie-Hellman Key Agreement Protocols
SAC '98 Proceedings of the Selected Areas in Cryptography
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
A novel solution for achieving anonymity in wireless ad hoc networks
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Anonymous Secure Routing in Mobile Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Information Sciences: an International Journal
Cashmere: resilient anonymous routing
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
A stable weight-based on-demand routing protocol for mobile ad hoc networks
Information Sciences: an International Journal
Multicast routing in mobile ad hoc networks by using a multiagent system
Information Sciences: an International Journal
Secure anonymous routing in ad hoc networks
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Performance Analysis of Anonymous Communication Channels Provided by Tor
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Shining Light in Dark Places: Understanding the Tor Network
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Distributed routing in wireless sensor networks using energy welfare metric
Information Sciences: an International Journal
Energy efficient all-to-all broadcast in all-wireless networks
Information Sciences: an International Journal
Performance comparison of low-latency anonymisation services from a user perspective
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
AOS: an anonymous overlay system for mobile ad hoc networks
Wireless Networks
PIR-Tor: scalable anonymous communication using private information retrieval
SEC'11 Proceedings of the 20th USENIX conference on Security
New directions in cryptography
IEEE Transactions on Information Theory
Information Sciences: an International Journal
Secure Border Gateway Protocol (S-BGP)
IEEE Journal on Selected Areas in Communications
Hi-index | 0.07 |
Typical anonymous networks mainly focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability with limited routing support. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network by building an overlay network atop a conventional IP network. The overlay network decouples the actual IP addresses of nodes and the virtual addresses that the nodes are using in actual applications. To do so, we use virtual addresses to anonymize the hosts and the physical IP address for efficient routing. The virtual addresses can also be dynamic for enhancing the nodes' anonymity further. This approach also allows the network to support almost any application running on it. Together with a new anonymous routing protocol, our simulation results show that the expected latency of our proposed anonymous system can be reduced by up to 50% compared to existing systems. We also propose a suite of authentication methods which can be applied to the anonymous routing protocol we propose for preventing any malicious path cost reduction. Traditional routing protocols leak network topology information to nodes while existing anonymous routing protocols do not provide authentication for routing information. A malicious node can arbitrarily reduce the path cost value carried in an anonymous route announcement message for the purpose of negatively influencing routing efficiency or facilitating the launch of various attacks such as eavesdropping or man-in-the-middle attacks. We propose three generic schemes and several concrete instantiations to transform an anonymous routing protocol into an authenticated one which not only prevents path cost reduction attacks but also maintains anonymity. These schemes are based on three different primitives, namely one-way trapdoor functions, digital signature schemes and collision-resistant hash functions.