Anonymous addresses for efficient and resilient routing in F2F overlays
暂无分享,去创建一个
[1] Prateek Mittal,et al. X-Vine: Secure and Pseudonymous Routing in DHTs Using Social Networks , 2012, NDSS.
[2] Robert D. Kleinberg. Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[3] Nicholas Hopper,et al. Membership-concealing overlay networks , 2009, CCS.
[4] Mark Crovella,et al. Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.
[5] George Danezis,et al. SybilInfer: Detecting Sybil Nodes using Social Networks , 2009, NDSS.
[6] Keith W. Ross,et al. The Index Poisoning Attack in P2P File Sharing Systems , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[7] Bernhard Heep. R/Kademlia: Recursive and topology-aware overlay routing , 2010, 2010 Australasian Telecommunication Networks and Applications Conference.
[8] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[9] Atul Singh,et al. Eclipse Attacks on Overlay Networks: Threats and Defenses , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[10] Stefanie Roos,et al. VOUTE-Virtual Overlays Using Tree Embeddings , 2016, ArXiv.
[11] Ian Goldberg,et al. SkypeMorph: protocol obfuscation for Tor bridges , 2012, CCS.
[12] Christos H. Papadimitriou,et al. On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.
[13] Cédric Westphal,et al. Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.
[14] Andrew S. Tanenbaum,et al. Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System , 2004, Security Protocols Workshop.
[15] Christian Grothoff,et al. Routing in the Dark: Pitch Black , 2007, Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007).
[16] Vitaly Shmatikov,et al. De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.
[17] Christian Grothoff,et al. R5N: Randomized recursive routing for restricted-route networks , 2011, 2011 5th International Conference on Network and System Security.
[18] Stefanie Roos,et al. On the impossibility of efficient self-stabilization in virtual overlays with churn , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).
[19] Thomas E. Anderson,et al. Privacy-preserving P2P data sharing with OneSwarm , 2010, SIGCOMM '10.
[20] Stefanie Roos,et al. Greedy Embedding, Routing and Content Addressing for Darknets , 2013, 2013 Conference on Networked Systems.
[21] David Eppstein,et al. Succinct Greedy Graph Drawing in the Hyperbolic Plane , 2008, GD.
[22] Oskar Sandberg,et al. Distributed Routing in Small-World Networks , 2006, ALENEX.
[23] Radia J. Perlman,et al. An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.