On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Information Leak in the Chord Lookup Protocol
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Location diversity in anonymity networks
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Spectral techniques applied to sparse random graphs
Random Structures & Algorithms
AP3: cooperative, decentralized anonymous communication
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Route Fingerprinting in Anonymous Communications
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
The Effect of Faults on Network Expansion
Theory of Computing Systems
Cashmere: resilient anonymous routing
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Denial of service or denial of security?
Proceedings of the 14th ACM conference on Computer and communications security
Information leaks in structured peer-to-peer anonymous communication systems
Proceedings of the 15th ACM conference on Computer and communications security
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Sampled traffic analysis by internet-exchange-level adversaries
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Breaking the collusion detection mechanism of morphmix
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Low-latency Mix Using Split and Merge Operations
Journal of Network and Systems Management
Proceedings of the 17th ACM conference on Computer and communications security
Recruiting new tor relays with BRAIDS
Proceedings of the 17th ACM conference on Computer and communications security
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Minimising anonymity loss in anonymity networks under DoS attacks
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Proceedings of the 27th Annual Computer Security Applications Conference
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
A game-theoretic analysis of cooperation in anonymity networks
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
PCTCP: per-circuit TCP-over-IPsec transport for anonymous communication overlay networks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of the popular Tor anonymity network, that decreases the bandwidth cost of relay selection and maintenance from quadratic to quasilinear while introducing no new attacks on the anonymity provided by Tor, and no additional delay to connections made via Tor. The resulting bandwidth savings make a modest-sized Torsk network significantly cheaper to operate, and allows low-bandwidth clients to join the network. Unlike previous proposals for P2P anonymity schemes, Torsk does not require all users to relay traffic for others. Torsk utilizes a combination of two P2P lookup mechanisms with complementary strengths in order to avoid attacks on the confidentiality and integrity of lookups. We show by analysis that previously known attacks on P2P anonymity schemes do not apply to Torsk, and report on experiments conducted with a 336-node wide-area deployment of Torsk, demonstrating its efficiency and feasibility.