Recruiting new tor relays with BRAIDS
暂无分享,去创建一个
[1] Hector Garcia-Molina,et al. The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.
[2] Nicholas Hopper,et al. How much anonymity does network latency leak? , 2007, TSEC.
[3] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[4] Nicholas Hopper,et al. Membership-concealing overlay networks , 2009, CCS.
[5] Ian Goldberg,et al. An improved algorithm for tor circuit scheduling , 2010, CCS '10.
[6] Nicholas Hopper,et al. Don't Clog the Queue! Circuit Clogging and Mitigation in P2P Anonymity Schemes , 2008, Financial Cryptography.
[7] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[8] George Danezis,et al. Low-cost traffic analysis of Tor , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).
[9] Elke Franz,et al. A Payment Scheme for Mixes Providing Anonymity , 1998, Trends in Distributed Systems for Electronic Commerce.
[10] Kevin Jeffay,et al. Tracking the evolution of Web traffic: 1995-2003 , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..
[11] Roger Dingledine,et al. A Practical Congestion Attack on Tor Using Long Paths , 2009, USENIX Security Symposium.
[12] Ling Liu,et al. PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities , 2004, IEEE Transactions on Knowledge and Data Engineering.
[13] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[14] Don Towsley,et al. Using Payments to Promote Cooperation in Anonymity Protocols , 2003 .
[15] George Danezis,et al. Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.
[16] Roger Dingledine,et al. Building Incentives into Tor , 2010, Financial Cryptography.
[17] G. Hardin,et al. The Tragedy of the Commons , 1968, Green Planet Blues.
[18] Yiannis Tsiounis,et al. Efficient Electronic Cash: New Notions and Techniques , 1997 .
[19] Dirk Grunwald,et al. Shining Light in Dark Places: Understanding the Tor Network , 2008, Privacy Enhancing Technologies.
[20] Y VassermanEugene,et al. How much anonymity does network latency leak , 2010 .
[21] Tatsuaki Okamoto,et al. Provably Secure Partially Blind Signatures , 2000, CRYPTO.
[22] Akbar Ghaffarpour Rahbar,et al. PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.
[23] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.
[24] Atul Singh,et al. Scrivener: Providing Incentives in Cooperative Content Distribution Systems , 2005, Middleware.
[25] Paul F. Syverson,et al. Onion routing , 1999, CACM.
[26] Charles F. Hockett,et al. A mathematical theory of communication , 1948, MOCO.
[27] C. Dovrolis,et al. Proportional differentiated services, part II: loss rate differentiation and packet dropping , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).
[28] Nicholas Hopper,et al. Combating Double-Spending Using Cooperative P2P Systems , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).
[29] Angelos Stavrou,et al. PAR: Payment for Anonymous Routing , 2008, Privacy Enhancing Technologies.
[30] Ian Goldberg,et al. Improving Tor using a TCP-over-DTLS Tunnel , 2009, USENIX Security Symposium.
[31] Radu Sion,et al. XPay: practical anonymous payments for tor routing and other networked services , 2009, WPES '09.
[32] Ernesto Damiani,et al. A reputation-based approach for choosing reliable resources in peer-to-peer networks , 2002, CCS '02.
[33] Parameswaran Ramanathan,et al. A case for relative differentiated services and the proportional differentiation model , 1999, IEEE Netw..
[34] Anton Stiglic,et al. Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems , 2001, Information Hiding.
[35] Roger Dingledine,et al. On the Economics of Anonymity , 2003, Financial Cryptography.
[36] Michael K. Reiter,et al. Crowds: anonymity for Web transactions , 1998, TSEC.
[37] Kevin Leyton-Brown,et al. Incentives for sharing in peer-to-peer networks , 2001, EC '01.
[38] Nikita Borisov,et al. A Tune-up for Tor: Improving Security and Performance in the Tor Network , 2008, NDSS.
[39] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[40] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .
[41] Matthew K. Wright,et al. Building Reliable Mix Networks with Fair Exchange , 2005, ACNS.
[42] Parameswaran Ramanathan,et al. Proportional differentiated services: delay differentiation and packet scheduling , 1999, SIGCOMM '99.
[43] Thomas Narten,et al. Privacy Extensions for Stateless Address Autoconfiguration in IPv6 , 2001, RFC.
[44] Markus Jakobsson,et al. Ripping Coins For a Fair Exchange , 1995, EUROCRYPT.
[45] Kai Hwang,et al. PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.
[46] Nicholas Hopper,et al. Scalable onion routing with torsk , 2009, CCS.
[47] Thomas Narten,et al. Privacy Extensions for Stateless Address Autoconfiguration in IPv6 , 2007, RFC.
[48] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[49] Adi Shamir,et al. PayWord and MicroMint: Two Simple Micropayment Schemes , 1996, Security Protocols Workshop.
[50] Bart Preneel,et al. Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.
[51] Noen Given. UDP-OR: A Fair Onion Transport Design , 2008 .
[52] RamanathanParameswaran,et al. Proportional differentiated services , 1999 .