Bridging and Fingerprinting: Epistemic Attacks on Route Selection
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Information leaks in structured peer-to-peer anonymous communication systems
Proceedings of the 15th ACM conference on Computer and communications security
A Kademlia-Based Node Lookup System for Anonymization Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Proceedings of the 16th ACM conference on Computer and communications security
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Hashing it out in public: common failure modes of DHT-based anonymity schemes
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Survey on anonymous communications in computer networks
Computer Communications
Proceedings of the 17th ACM conference on Computer and communications security
Scalable anonymous communication with provable security
HotSec'10 Proceedings of the 5th USENIX conference on Hot topics in security
PIR-Tor: scalable anonymous communication using private information retrieval
SEC'11 Proceedings of the 20th USENIX conference on Security
Trust-based anonymous communication: adversary models and routing algorithms
Proceedings of the 18th ACM conference on Computer and communications security
Information Leaks in Structured Peer-to-Peer Anonymous Communication Systems
ACM Transactions on Information and System Security (TISSEC) - Special Issue on Computer and Communications Security
Protocol-level attacks against Tor
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only gain random knowledge of part of the network, their traffic can be detected by the uniqueness of the information they have learnt. We discuss this problem, which occurred in the initial design of Tarzan, and other related problems from the literature.