Attack-Resistant Trust Metrics
Human-computer interaction seriesPublished 1 January 2009
Raph Levien
Citations206
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This chapter presents two specific trust metrics developed and deployed on the Advogato Website, which is a community blog for free software developers, and demonstrates that the trust metrics fulfilled their goals, but that for good results, it is important to match the assumptions of the abstract trust metric computation to the real-world implementation.
Abstract
The Internet is an amazingly powerful tool for connecting people together, unmatched in human history. Yet, with that power comes great potential for spam and abuse. Trust metrics are an attempt to compute the set of which people are trustworthy and which are likely attackers. This chapter presents two specific trust metrics developed and deployed on the Advogato Website, which is a community blog for free software developers. This real-world experience demonstrates that the trust metrics fulfilled their goals, but that for good results, it is important to match the assumptions of the abstract trust metric computation to the real-world implementation.
Keywords
Social SciencesComputer Science
Journal of Computer-Mediated CommunicationSocial Network Sites: Definition, History, and Scholarship
16,091 Citations2007danah boyd, Nicole B. Ellison
This introductory article describes features of SNSs and proposes a comprehensive definition, and one perspective on the history of such sites is presented, discussing key changes and developments.
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
ACM Transactions on Programming Languages and SystemsThe Byzantine Generals Problem
5,966 Citations1982Leslie Lamport, Robert E. Shostak +1 more
It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Lecture notes in computer scienceThe Sybil Attack
4,328 Citations2002John R. Douceur
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
The Eigentrust algorithm for reputation management in P2P networks
3,353 Citations2003Sepandar Kamvar, Mario Schlösser +1 more
An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.
Operating Systems Design and ImplementationPractical Byzantine fault tolerance
3,311 Citations1999Miguel Castro, Barbara Liskov
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Lecture notes in computer scienceKademlia: A Peer-to-Peer Information System Based on the XOR Metric
3,000 Citations2002Petar Maymounkov, David Mazières
A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
First MondayFree riding on Gnutella
1,529 Citations2000Eytan Adar, Bernardo A. Huberman
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Physica A Statistical Mechanics and its ApplicationsScale-free characteristics of random networks: the topology of the world-wide web
1,409 Citations2000Albert-Ĺaszló Barabási, Réka Albert +1 more
This work introduces a model that leads to a scale-free network, capturing in a minimal fashion the self-organization processes governing the world-wide web.
Google's PageRank and Beyond: The Science of Search Engine Rankings
1,202 Citations2006Amy N. Langville, Carl D. Meyer
This talk will survey some of the concepts that have revolutionized Web search to the extent that it has been charged in Federal Court with driving the direction of commerce on the Internet.
ComputerSelf-organization and identification of Web communities
1,007 Citations2002Gary William Flake, Sandra Lawrence +2 more
This work shows that the Web self-organizes and its link structure allows efficient identification of communities and is significant because no central authority or process governs the formation and structure of hyperlinks.
Internet MathematicsDeeper Inside PageRank
908 Citations2004Amy N. Langville, Carl D. Meyer
A comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, and suggested alternatives to the traditional solution methods.
Digital Repository at the University of Maryland (University of Maryland College Park)Computing and applying trust in web-based social networks
839 Citations2005Jennifer Golbeck, James Hendler
It is shown that, in the case where the user's opinion is divergent from the average, the trust-based recommended ratings are more accurate than several other common collaborative filtering techniques.
Princeton University Press eBooksGoogle's PageRank and Beyond
791 Citations2006Amy N. Langville, Carl D. Meyer
Lecture notes in computer scienceValuation of trust in open networks
656 Citations1994Thomas Beth, Malte Borcherding +1 more
A method for the valuation of trustworthiness which can be used to accept or reject an entity as being suitable for sensitive tasks is presented, an extension of the work of Yahalom, Klein and Beth.
Information and ComputationRegion-Based Memory Management
617 Citations1997Mads Tofte, Jean-Pierre Talpin
A region-based dynamic semantics for a skeletal programming language extracted from Standard ML is defined and the inference system which specifies where regions can be allocated and de-allocated is presented and a detailed proof that the system is sound with respect to a standard semantics is presented.
ACM Transactions on Internet TechnologyInside PageRank
535 Citations2005Monica Bianchini, Marco Gori +1 more
A circuit analysis is introduced that allows to understand the distribution of the page score, the way different Web communities interact each other, the role of dangling pages (pages with no outlinks), and the secrets for promotion of Web pages.
Lecture notes in computer scienceThe Free Haven Project: Distributed Anonymous Storage Service
334 Citations2001Roger Dingledine, Michael J. Freedman +1 more
A design for a system of anonymous storage which resists the attempts of powerful adversaries to find or destroy any stored data is presented, and a way to classify anonymous systems based on the kinds of anonymity provided is suggested.
Lecture notes in computer scienceModelling a public-key infrastructure
323 Citations1996Ueli Maurer
An approach to modelling and reasoning about a PKI from a user Alice's point of view is proposed, which includes confidence values for statements and can exploit arbitrary certification structures containing multiple intersecting certification paths to achieve a higher confidence value than for any single certification path.
Typed memory management in a calculus of capabilities
249 Citations1999Karl Crary, David Walker +1 more
A compiler intermediate language, called the Capability Calculus, is presented that supports region-based memory management, enjoys a provably safe type system, and is straightforward to compile to a typed assembly language.
Building peer-to-peer systems with chord, a distributed lookup service
229 Citations2005Frank Dabek, Eric W. Brunskill +5 more
It is argued that the core problem facing peer-to-peer Systems is locating documents in a decentralized network and Chord, a distributed lookup primitive is proposed, which provides an efficient method of locating documents while placing few constraints on the applications that use it.
Attack-resistant trust metrics for public key certification
187 Citations1998Raph Levien, Alex Aiken
An analytical framework for understanding the effectiveness of trust metrics in resisting attacks is presented, including a characterization of the space of possible attacks, and the theoretical best case for a trust metric is established.
Language support for regions
151 Citations2001David Gay, Alex Aiken
This work generalises type annotations that make the structure of a program's regions more explicit in a region type system whose main novelty is the use of existentially quantified abstract regions to represent pointers to objects whose region is partially or totally unknown.
Lecture notes in computer scienceReliable MIX Cascade Networks through Reputation
94 Citations2003Roger Dingledine, Paul Syverson
A MIX cascade protocol and a reputation system that together increase the reliability of a network of MIX cascades and eliminate the need for global trusted witnesses are described.
Toward acceptable metrics of authentication
92 Citations2002M.K. Reiter, Stuart G. Stubblebine
A set of guiding principles for the design of metrics to evaluate the confidence afforded by a set of paths for authentication are developed and a direction for constructing metrics that come closer to meeting these principles is proposed.
Lecture notes in computer scienceExperiences Deploying a Large-Scale Emergent Network
91 Citations2002Bryce Wilcox-O’Hearn
Several specific problems in the design of Mojo Nation are described, some of which appear to be soluble with simple practical improvements, and others of which are not yet addressed in the literature, suggesting opportunities for further research.
Communications of the ACMThe AED free storage package
80 Citations1967Douglas T. Ross
The Free Storage Package of the AED-1 Compiler System allows blocks of available storage to be obtained and returned for reuse and performs high level functions automatically, but also allows access and control of fine internal details as well.
Path independence for authentication in large-scale systems
59 Citations1997Michael K. Reiter, Stuart G. Stubblebine
This paper formalizes the problems of locating maximum sets of paths with independence properties in a graph-theoretic framework, gives evidence that they are not polynomial-time solvable, and proposes approximation algorithms for these problems.
A SURVEY OF PUBLIC- KEY INFRASTRUCTURES
35 Citations1997Marc. Branchaud
A set of characteristics that are common to all public-key in-frastructures are presented, intended to encapsulate the fundamental issues that arise when dealing with such systems, to enhance rather than restrict development in the field.
Lecture notes in computer scienceAssociating metrics to certification paths
31 Citations1992Anas Tarah, Christian Huitema
The Chimaera model tries to cover all X509's lacks specially for what concerns Certification Authorities CA and describes a protocol for the exchange and evaluation of both certificates and CP, Certification Paths, hence ensuring a secure propagation of trust and knowledge over the network.
Lecture notes in computer scienceOblivious key escrow
18 Citations1996Matt Blaze
An architecture for a distributed key escrow system that might be suitable for deployment over very large-scale networks such as the Internet is sketched and a new cryptographic primitive, oblivious multicast, is introduced that can serve as the basis for such a system.