Article

Making p2p accountable without losing privacy

Authors:

C. Chris Erway,

Alptekin Küpçü,

Anna Lysyanskaya,

Eric RachlinAuthors Info & Claims

WPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society

Pages 31 - 40

https://doi.org/10.1145/1314333.1314339

Published: 29 October 2007 Publication History

Abstract

Peer-to-peer systems have been proposed for a wide variety of applications, including file-sharing, web caching, distributed computation, cooperative backup, and onion routing. An important motivation for such systems is self-scaling. That is, increased participation increases the capacity of the system. Unfortunately, this property is at risk from selfish participants. The decentralized nature of peer-to-peer systems makes accounting difficult. We show that e-cash can be a practical solution to the desire for accountability in peer-to-peer systems while maintaining their ability to self-scale. No less important, e-cash is a natural fit for peer-to-peer systems that attempt to provide (or preserve) privacy for their participants. We show that e-cash can be used to provide accountability without compromising the existing privacy goals of a peer-to-peer system.

We show how e-cash can be practically applied to a file sharing application. Our approach includes a set of novel cryptographic protocols that mitigate the computational and communication costs of anonymous e-cash transactions, and system design choices that further reduce overhead and distribute load. We conclude that provably secure, anonymous, and scalable peer-to-peer systems are within reach.

References

[1]

E. Adar and B. A. Huberman. Free riding on gnutella. First Monday, 5(10), 2000.

[2]

K. G. Anagnostakis and M. B. Greenwald. Exchange-based incentive mechanisms for peer-to-peer file sharing. In ICDCS ¿04, 2004.

Digital Library

[3]

N. Andrade, M. Mowbray, A. Lima, G. Wagner, and M. Ripeanu. Influences on cooperation in bittorrent communities. In P2PECON ¿05, 2005.

Digital Library

[4]

N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):591¿-610, Apr. 2000.

Digital Library

[5]

F. Bao, R. Deng, and W. Mao. Efficient and practical fair exchange protocols with off-line ttp. In IEEE Symposium on Security and Privacy, May 1998.

[6]

A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analyzing and improving a bittorrent network's performance mechanisms. In Proc. IEEE INFOCOM, Mar. 2006.

[7]

A. Blanc, Y.-K. Liu, and A. Vahdat. Designing incentives for peer-to-peer routing. In Proc. IEEE INFOCOM, Mar. 2005.

[8]

J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO 2002, Aug. 2002.

Digital Library

[9]

J. Camenisch, A. Lysyanskaya, and M. Meyerovich. Endorsed e-cash. In IEEE Symposium on Security and Privacy, 2007.

Digital Library

[10]

J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO 2003.

[11]

D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84¿-88, February 1981.

Digital Library

[12]

D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology ¿ CRYPTO ¿82, pages 199¿-203. Plenum Press, 1983.

[13]

D. Chaum. Blind signature systems. In Advances in Cryptology ¿ CRYPTO ¿83, page 153. Plenum Press, 1984.

[14]

B. N. Chun, P. Buonadonna, A. AuYoung, C. Ng, D. C. Parkes, J. Shneidman, A. C. Snoeren, and A. Vahdat. Mirage: A microeconomic resource allocation system for sensornet testbeds. In Proc. of the 2nd IEEE Workshop on Embedded Networked Sensors, 2005.

Digital Library

[15]

B. Cohen. Incentives build robustness in bittorrent. In Proc. 2nd IPTPS, Berkeley, CA, Feb. 2003.

[16]

A. Daly and W. Marnane. Efficient architectures for implementing montgomery modular multiplication and rsa modular exponentiation on reconfigurable logic. In FPGA ¿02.

Digital Library

[17]

R. Dingledine, N. Mathewson, and P. Syverson. Reputation in p2p anonymity systems. In P2PECON ¿03, June 2003.

[18]

R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. In Proc. of the 13th USENIX Security Symposium, August 2004.

Digital Library

[19]

J. Douceur. The sybil attack. In Proc. 1st IPTPS, Mar. 2002.

Digital Library

[20]

B. Fan, D.-M. Chiu, and J. C. S. Lui. The delicate tradeoffs in bittorrent-like file sharing protocol design. In ICNP ¿06, 2006.

Digital Library

[21]

E. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173-¿199, 2001.

[22]

E. J. Friedman, J. Y. Halpern, and I. Kash. Efficiency and nash equilibria in a scrip system for p2p networks. In Proc. of the 7th ACM conference on Electronic commerce, 2006.

Digital Library

[23]

D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM, 42(2):84¿-88, February 1999.

Digital Library

[24]

P. Golle, K. Leyton-Brown, and I. Mironov. Incentives for sharing in peer-to-peer networks. In Proc. of the 3rd ACM Conference on Electronic Commerce, 2001.

Digital Library

[25]

GreedyTorrent. http://www.greedytorrent.com/.

[26]

J. Ioannidis, S. Ioannidis, A. D. Keromytis, and V. Prevelakis. Fileteller: Paying and getting paid for file storage. In Financial Cryptography, 6th International Conference, 2002.

Digital Library

[27]

D. Irwin, J. Chase, L. Grit, and A. Yumerefendi. Self-recharging virtual currency. In P2PECON ¿05, Aug. 2005.

Digital Library

[28]

M. Jakobsson. Ripping coins for a fair exchange. In EUROCRYPT ¿95, 1995.

Digital Library

[29]

S. Jun and M. Ahamad. Incentives in bittorrent induce free riding. In P2PECON ¿05, Aug. 2005.

[30]

I. Kash, E. J. Friedman, and J. Y. Halpern. Efficiency and nash equilibria in a scrip system for p2p networks. In Proc. of the 8th ACM conference on Electronic commerce, 2007.

Digital Library

[31]

J. Kleinberg and P. Raghavan. Query incentive networks. In FOCS ¿05: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.

Digital Library

[32]

A. Legout, N. Liogkas, E. Kohler, and L. Zhang. Clustering and sharing incentives in bittorrent systems. In Proc. of ACM SIGMETRICS¿07, June 2007.

Digital Library

[33]

H. Li, A. Clement, E. Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR gossip. In Proc. of the 7th OSDI, Nov. 2006.

Digital Library

[34]

N. Liogkas, R. Nelson, E. Kohler, and L. Zhang. Exploiting bittorrent for fun (but not profit). In Proc. 5th IPTPS, 2006.

[35]

T. Locher, P. Moor, S. Schmid, and R. Wattenhofer. Free Riding in BitTorrent is Cheap. In Proc. 5th Workshop on Hot Topics in Networking (HotNets-V), Nov. 2006.

[36]

S. Marti and H. Garcia-Molina. Identity crisis: Anonymity vs. reputation in p2p systems. In P2P ¿03, 2003.

Digital Library

[37]

S. Marti and H. Garcia-Molina. Taxonomy of trust: Categorizing p2p reputation systems. Computer Networks, 50(4):472¿-484, 2006.

Digital Library

[38]

R. Merkle. A digital signature based on a conventional encryption function. In CRYPTO ¿87, pages 269¿-278, 1987.

Digital Library

[39]

N. Michalakis, R. Soulé, and R. Grimm. Ensuring content integrity for untrusted peer-to-peer content distribution networks. In Proc. 4th USENIX/ACM NSDI, Apr. 2007.

Digital Library

[40]

A. Nandi, T.-W. J. Ngan, A. Singh, P. Druschel, and D. S. Wallach. Scrivener: Providing incentives in cooperative content distribution systems. In Middleware 2005, Nov. 2005.

Digital Library

[41]

T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO ¿91.

Digital Library

[42]

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Do incentives build robustness in bittorrent? In Proc. 4th USENIX/ACM NSDI, Apr. 2007.

Digital Library

[43]

M. Reiter, X. Want, and M. Wright. Building reliable mix networks with fair exchange. In Applied Cryptography and Network Security: Third International Conference, 2005.

Digital Library

[44]

Rosetta@Home. http://boinc.bakerlab.org/rosetta/.

[45]

M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A wide-area distributed database system. VLDB Journal: Very Large Data Bases, 5(1):48¿-63, 1996.

Digital Library

[46]

R. Thommes and M. Coates. Bittorrent fairness: analysis and improvements. In WITSP ¿05, December 2005.

[47]

V. Vishnumurthy, S. Chandrakumar, and E. G. Sirer. Karma: A secure economic framework for p2p resource sharing. In P2PECON ¿03, 2003.

[48]

M. Walfish, J. Zamfirescu, H. Balakrishnan, D. Karger, and S. Shenker. Distributed quota enforcement for spam control. In Proc. 3rd USENIX/ACM NSDI, May 2006.

Digital Library

[49]

B. Wilcox-O'Hearn. Experiences deploying a large-scale emergent network. In Proc. 1st IPTPS, Mar. 2002.

Digital Library

[50]

B. Zhu and S. Jajodia. Building trust in peer-to-peer systems: a review. International Journal of Security and Networks, 1(1/2):103-¿112, 2006.

Digital Library

Cited By

He SLu YTang QWang GWu C(2023)Blockchain-Based P2P Content Delivery With Monetary Incentivization and Fairness GuaranteeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.321703634:2(746-765)Online publication date: 1-Feb-2023
https://doi.org/10.1109/TPDS.2022.3217036
Uchizono SNakai TWatanabe YIwamoto M(2023)Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and WinnersInformation Security and Cryptology – ICISC 202310.1007/978-981-97-1238-0_8(133-156)Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/978-981-97-1238-0_8
Friolo DMassacci FNgo CVenturi D(2022)Cryptographic and Financial FairnessIEEE Transactions on Information Forensics and Security10.1109/TIFS.2022.319885217(3391-3406)Online publication date: 2022
https://doi.org/10.1109/TIFS.2022.3198852
Show More Cited By

Index Terms

Making p2p accountable without losing privacy

Recommendations

P2P streaming: use of advertisements as incentives
MMSys '12: Proceedings of the 3rd Multimedia Systems Conference

Peer-to-Peer (P2P) streaming systems, such as PPLive, have become a popular service with the widespread deployment of broadband networks. However, P2P streaming systems still face free-riding problems, similar to those that have been observed in P2P ...
Privacy-conscious P2P data sharing scheme with bogus profile distribution

With the increasing use of P2P (peer-to-peer) network technology in everyday services, the issue of privacy protection has gained considerable importance. This paper describes a method to realize an anonymity-conscious P2P data sharing network. The ...
Blogracy: A Peer-to-Peer Social Network

The current approach to build social networking systems is to create huge centralized systems owned by a single company. However, such strategy has many drawbacks, e.g., lack of privacy, lack of anonymity, risks of censorship and operating costs. In ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society

October 2007

116 pages

ISBN:9781595938831

DOI:10.1145/1314333

General Chair:
Peng Ning
North Carolina State University, USA
,
Program Chair:
Ting Yu
North Carolina State University, USA

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 October 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS07

Sponsor:

CCS07: 14th ACM Conference on Computer and Communications Security 2007

October 29, 2007

Virginia, Alexandria, USA

Acceptance Rates

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
814
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

He SLu YTang QWang GWu C(2023)Blockchain-Based P2P Content Delivery With Monetary Incentivization and Fairness GuaranteeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.321703634:2(746-765)Online publication date: 1-Feb-2023
https://doi.org/10.1109/TPDS.2022.3217036
Uchizono SNakai TWatanabe YIwamoto M(2023)Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and WinnersInformation Security and Cryptology – ICISC 202310.1007/978-981-97-1238-0_8(133-156)Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/978-981-97-1238-0_8
Friolo DMassacci FNgo CVenturi D(2022)Cryptographic and Financial FairnessIEEE Transactions on Information Forensics and Security10.1109/TIFS.2022.319885217(3391-3406)Online publication date: 2022
https://doi.org/10.1109/TIFS.2022.3198852
Alper HKüpçü A(2021)Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party ComputationACM Transactions on Privacy and Security10.1145/347753025:1(1-34)Online publication date: 23-Nov-2021
https://dl.acm.org/doi/10.1145/3477530
Wang HYu YZhao JWang J(2021)Blockchain-Based Trusted Instant Messaging Model Research2021 4th International Conference on Hot Information-Centric Networking (HotICN)10.1109/HotICN53262.2021.9680848(32-37)Online publication date: 25-Nov-2021
https://doi.org/10.1109/HotICN53262.2021.9680848
Andola NRaghav Yadav VVenkatesan SVerma S(2021)Anonymity on blockchain based e-cash protocols—A surveyComputer Science Review10.1016/j.cosrev.2021.10039440(100394)Online publication date: May-2021
https://doi.org/10.1016/j.cosrev.2021.100394
Kılınç Alper HKüpçü A(2021)Coin-Based Multi-party Fair ExchangeApplied Cryptography and Network Security10.1007/978-3-030-78372-3_6(130-160)Online publication date: 9-Jun-2021
https://doi.org/10.1007/978-3-030-78372-3_6
Herskind LKatsikouli PDragoni N(2020)Privacy and Cryptocurrencies—A Systematic Literature ReviewIEEE Access10.1109/ACCESS.2020.29809508(54044-54059)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2980950
Da Silva SBen Mokhtar SContiu SNégru DRéveillère LRivière E(2019)PrivaTubeProceedings of the 20th International Middleware Conference10.1145/3361525.3361546(189-201)Online publication date: 9-Dec-2019
https://dl.acm.org/doi/10.1145/3361525.3361546
Cota GMokhtar SGianini GDamiani ELawall JMuller GBrunie L(2019)RACOON++IEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2017.270628616:4(635-650)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1109/TDSC.2017.2706286
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents