@conference {18593,
	title = {Photo-based authentication using social networks},
	booktitle = {Proceedings of the first workshop on Online social networks},
	series = {WOSN {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {55 - 60},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We present Lineup, a system that uses the social network graph in Facebook and auxiliary information (e.g., "tagged" user photos) to build a photo-based Web site authentication framework. Lineup{\textquoteright}s underlying mechanism leverages the concept of CAPTCHAs, programs that are designed to distinguish bots from human users. Lineup extends this functionality to help a Web site ascertain a user{\textquoteright}s identity or membership in a certain group (e.g., an interest group, invitees to a certain event) in order to infer some level of trust. Lineup works by presenting a user with photographs and asking the user to identify subjects in the photo whom a user with the appropriate identity or group membership should know. We present the design and implementation for Lineup, describe a preliminary prototype implementation, and discuss Lineup{\textquoteright}s security properties, including possible guarantees and threats.},
	keywords = {social networks, trust},
	isbn = {978-1-60558-182-8},
	doi = {10.1145/1397735.1397748},
	url = {http://doi.acm.org/10.1145/1397735.1397748},
	author = {Yardi,Sarita and Feamster, Nick and Bruckman,Amy}
}
@article {14367,
	title = {Trusting spam reporters: A reporter-based reputation system for email filtering},
	journal = {ACM Transactions on Information Systems (TOIS)},
	volume = {27},
	year = {2008},
	month = {2008/12//},
	pages = {3:1{\textendash}3:27 - 3:1{\textendash}3:27},
	abstract = {Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.},
	keywords = {reputation systems, Spam filtering, trust},
	isbn = {1046-8188},
	doi = {10.1145/1416950.1416953},
	url = {http://doi.acm.org/10.1145/1416950.1416953},
	author = {Zheleva,Elena and Kolcz,Aleksander and Getoor, Lise}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@conference {17443,
	title = {Trust me, I{\textquoteright}m accountable: trust and accountability online},
	booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {79 - 80},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?},
	keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW},
	isbn = {1-58113-158-5},
	doi = {10.1145/632716.632766},
	url = {http://doi.acm.org/10.1145/632716.632766},
	author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben}
}
