Making p2p accountable without losing privacy
暂无分享,去创建一个
Alptekin Küpçü | Mira Belenkiy | Melissa Chase | Anna Lysyanskaya | John Jannotti | Eric Rachlin | C. Christopher Erway | John Jannotti | Anna Lysyanskaya | Melissa Chase | M. Belenkiy | C. Erway | Alptekin Küpçü | E. Rachlin
[1] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[2] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[3] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.
[4] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[5] Markus Jakobsson,et al. Ripping Coins For a Fair Exchange , 1995, EUROCRYPT.
[6] Michael Stonebraker,et al. Mariposa: a wide-area distributed database system , 1996, The VLDB Journal.
[7] Robert H. Deng,et al. Efficient and practical fair exchange protocols with off-line TTP , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).
[8] Paul F. Syverson,et al. Onion routing , 1999, CACM.
[9] Paul Syverson,et al. Onion Routing for Anonymous and Private Internet Connections , 1999 .
[10] N. Asokan,et al. Optimistic fair exchange of digital signatures , 1998, IEEE Journal on Selected Areas in Communications.
[11] Eytan Adar,et al. Free Riding on Gnutella , 2000, First Monday.
[12] Kevin Leyton-Brown,et al. Incentives for sharing in peer-to-peer networks , 2001, EC '01.
[13] E. Friedman,et al. The Social Cost of Cheap Pseudonyms , 2001 .
[14] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[15] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[16] William P. Marnane,et al. Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic , 2002, FPGA '02.
[17] Angelos D. Keromytis,et al. Fileteller: Paying and Getting Paid for File Storage , 2002, Financial Cryptography.
[18] Bryce Wilcox-O'Hearn,et al. Experiences Deploying a Large-Scale Emergent Network , 2002, IPTPS.
[19] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[20] Hector Garcia-Molina,et al. Identity crisis: anonymity vs reputation in P2P systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).
[21] R. Dingledine,et al. Reputation in P2P Anonymity Systems , 2003 .
[22] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .
[23] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[24] Kostas G. Anagnostakis,et al. Exchange-based incentive mechanisms for peer-to-peer file sharing , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..
[25] Jon M. Kleinberg,et al. Query incentive networks , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[26] Jeff Chase,et al. Self-recharging virtual currency , 2005, P2PECON '05.
[27] Atul Singh,et al. Scrivener: Providing Incentives in Cooperative Content Distribution Systems , 2005, Middleware.
[28] Nazareno Andrade,et al. Influences on cooperation in BitTorrent communities , 2005, P2PECON '05.
[29] Mustaque Ahamad,et al. Incentives in BitTorrent induce free riding , 2005, P2PECON '05.
[30] Alberto Blanc,et al. Designing incentives for peer-to-peer routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[31] Matthew K. Wright,et al. Building Reliable Mix Networks with Fair Exchange , 2005, ACNS.
[32] M. Coates,et al. BitTorrent Fairness : Analysis and Improvements , 2005 .
[33] Chaki Ng,et al. Mirage: a microeconomic resource allocation system for sensornet testbeds , 2005, The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II..
[34] Bin Fan,et al. The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.
[35] Mohan S. Kankanhalli,et al. Building trust in peer-to-peer systems: a review , 2006, Int. J. Secur. Networks.
[36] Michael Dahlin,et al. BAR gossip , 2006, OSDI '06.
[37] Stefan Schmid,et al. Free Riding in BitTorrent is Cheap , 2006, HotNets.
[38] Venkata N. Padmanabhan,et al. Analyzing and Improving a BitTorrent Networks Performance Mechanisms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[39] Michael Walfish,et al. Distributed Quota Enforcement for Spam Control , 2006, NSDI.
[40] Eddie Kohler,et al. Exploiting BitTorrent For Fun , 2006, IPTPS.
[41] Joseph Y. Halpern,et al. Efficiency and nash equilibria in a scrip system for P2P networks , 2006, EC '06.
[42] Hector Garcia-Molina,et al. Taxonomy of trust: Categorizing P2P reputation systems , 2006, Comput. Networks.
[43] Eddie Kohler,et al. Clustering and sharing incentives in BitTorrent systems , 2006, SIGMETRICS '07.
[44] Arun Venkataramani,et al. Do incentives build robustness in bit torrent , 2007 .
[45] Robert Grimm,et al. Ensuring Content Integrity for Untrusted Peer-to-Peer Content Distribution Networks , 2007, NSDI.
[46] Jan Camenisch,et al. Endorsed E-Cash , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).