skip to main content
10.1145/1566374.1566423acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

Sybilproof transitive trust protocols

Published: 06 July 2009 Publication History

Abstract

We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between the two parties. In such situations, it is possible to enable the interaction indirectly through a chain of credit or "trust" links. We introduce a model that provides insight into many disparate applications, including open currency systems, network trust aggregation systems, and manipulation-resistant recommender systems. Each party maintains a trust account for each other party. When a principal's trust balance for an agent is high enough to cover potential losses from a bad interaction, direct trust is sufficient to enable the interaction. Allowing indirect trust opens up more interaction opportunities, but also expands the strategy space of an attacker seeking to exploit the community for its own ends. We show that with indirect trust exchange protocols, some friction is unavoidable: any protocol that satisfies a natural strategic safety property that we call sum-sybilproofness can sometimes lead to a reduction in expected overall trust balances even on interactions that are profitable in expectation. Thus, for long-term growth of trust accounts, which are assets enabling risky but valuable interactions, it may be necessary to limit the use of indirect trust. We present the hedged-transitive protocol and show that it achieves the optimal rate of expected growth in trust accounts, among all protocols satisfying the sum-sybilproofness condition.

References

[1]
A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In P2PECON '05: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 128--132, 2005.
[2]
J. Douceur. The sybil attack. In Peer-to-Peer Systems: First International Workshop, IPTPS '02, volume 2429 of Lecture Notes in Computer Science, pages 251--260. Springer, 2002.
[3]
Epinions, 2009. http://www.epinions.com.
[4]
E. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173--199, 2001.
[5]
J. Hartline and T. Roughgarden. Optimal mechanism design and money burning. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 75--84, New York, NY, USA, 2008. ACM.
[6]
S.D. Kamvar, M.T. Schlosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in P2P networks. In Prooceedings of WWW '03, pages 640--651, 2003.
[7]
N. Kiyotaki and R. Wright. On money as a medium of exchange. Journal of Political Economy, 97(4):927--954, 1989.
[8]
N. Kocherlakota. Money is memory. Technical report, Federal Reserve Bank of Minnesota, 1996.
[9]
R. Landa, D. Griffin, R. Clegg, E. Mykoniati, and M. Rio. A sybilproof indirect reciprocity mechanism for peer-to-peer networks. In Proceedings of IEEE Infocom '09, 2009.
[10]
R. Levien. Attack-Resistant Trust Metrics. PhD thesis, University of California, Berkeley, 2004.
[11]
D. Reeves. Blog article, 2006. Available at http://blog.yootles.com/2006/11/07/yootles-triviaquestion/.
[12]
D.M. Reeves, B.M. Soule, and T. Kasturi. Yootopia! SIGecom Exchanges, 6(2):1--26, 2007.
[13]
P. Resnick and R. Sami. The influence limiter: Provably manipulation-resistant recommender systems. In Proceedings of the ACM Recommender Systems Conference (RecSys07), 2007.
[14]
P. Resnick and R. Sami. The informational cost of manipulation resistance in recommender systems. In Proceedings of the ACM Recommender Systems Conference (RecSys08), 2008.
[15]
Ripplepay, 2009. http://www.ripplepay.com.
[16]
M. Yokoo, Y. Sakuri, and S. Matsubara. The effect of false-name bids in combinatorial auctions: New fraud in internet auctions. Games and Economic Behavior, 46:174--188, 2004.
[17]
P. Zimmermann. Pretty good privacy: public key encryption for the masses, pages 93--107. Springer-Verlag New York, 1995.

Cited By

View all

Index Terms

  1. Sybilproof transitive trust protocols

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EC '09: Proceedings of the 10th ACM conference on Electronic commerce
    July 2009
    376 pages
    ISBN:9781605584584
    DOI:10.1145/1566374
    • General Chair:
    • John Chuang,
    • Program Chairs:
    • Lance Fortnow,
    • Pearl Pu
    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: 06 July 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. indirect reciprocity
    2. open currency
    3. recommender system
    4. reputation system
    5. sybilproof
    6. transitive trust

    Qualifiers

    • Research-article

    Conference

    EC '09
    Sponsor:
    EC '09: ACM Conference on Electronic Commerce
    July 6 - 10, 2009
    California, Stanford, USA

    Acceptance Rates

    Overall Acceptance Rate 664 of 2,389 submissions, 28%

    Upcoming Conference

    EC '25
    The 25th ACM Conference on Economics and Computation
    July 7 - 11, 2025
    Stanford , CA , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 15 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media