161,975 research outputs found
Anonymous reputation based reservations in e-commerce (AMNESIC)
Online reservation systems have grown over the last recent
years to facilitate the purchase of goods and services. Generally,
reservation systems require that customers provide
some personal data to make a reservation effective. With
this data, service providers can check the consumer history
and decide if the user is trustable enough to get the reserve.
Although the reputation of a user is a good metric to implement
the access control of the system, providing personal
and sensitive data to the system presents high privacy risks,
since the interests of a user are totally known and tracked
by an external entity. In this paper we design an anonymous
reservation protocol that uses reputations to profile
the users and control their access to the offered services, but
at the same time it preserves their privacy not only from the
seller but the service provider
Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments
Decentralized systems are a subset of distributed systems where multiple
authorities control different components and no authority is fully trusted by
all. This implies that any component in a decentralized system is potentially
adversarial. We revise fifteen years of research on decentralization and
privacy, and provide an overview of key systems, as well as key insights for
designers of future systems. We show that decentralized designs can enhance
privacy, integrity, and availability but also require careful trade-offs in
terms of system complexity, properties provided, and degree of
decentralization. These trade-offs need to be understood and navigated by
designers. We argue that a combination of insights from cryptography,
distributed systems, and mechanism design, aligned with the development of
adequate incentives, are necessary to build scalable and successful
privacy-preserving decentralized systems
The resurrection of group selection as a theory of human cooperation
Two books edited by members of the MacArthur Norms and Preferences Network (an interdisciplinary group, mainly anthropologists and economists) are reviewed here. These books in large part reflect a renewed interest in group selection
that has occurred among these researchers: they promote the theory that human cooperative behavior evolved via selective processes which favored biological and/or cultural group-level adaptations as opposed to individual-level adaptations. In support of this theory, an impressive collection of cross-cultural data are presented which suggest that participants in experimental economic games often do not behave as self-interested income maximizers; this lack of self-interest is regarded as evidence of group selection. In this review, problems with these data and with the theory are discussed. On the data side, it is argued that even if a behavior seems individually-maladaptive in a game context, there is no reason to believe that it would have been that way in ancestral contexts, since the environments of experimental games do not at all resemble those in which ancestral humans would have interacted cooperatively. And on the theory side, it is argued that it is premature to invoke group selection in order to explain human cooperation, because more parsimonious individual-level theories have not yet been exhausted. In summary, these books represent ambitious interdisciplinary contributions on an important topic, and they include unique and useful data; however, they do not make a convincing case that the evolution of human cooperation required group selection
Vandalism on Collaborative Web Communities: An Exploration of Editorial Behaviour in Wikipedia
Modern online discussion communities allow people to contribute, sometimes anonymously. Such flexibility sometimes threatens the reputation and reliability of community-owned resources. Such flexibility is understandable, however, they engender threats to the reputation and reliability in collective goods. Since not a lot of previous work addressed these issues it is important to study the aforementioned issues to build an innate understanding of recent ongoing vandalism of Wikipedia pages and ways to preventing those.
In this study, we consider the type of activity that the anonymous users carry out on Wikipedia and also contemplate how others react to their activities. In particular, we want to study vandalism of Wikipedia pages and ways of preventing this kind of activity. Our preliminary analysis reveals (~ 90%) of the vandalism or foul edits are done by unregistered users in Wikipedia due to nature of openness. The community reaction seemed to be immediate: most vandalisms were reverted within five minutes on an average. Further analysis shed light on the tolerance of Wikipedia community, reliability of anonymous users revisions and feasibility of early prediction of vandalism
Market Transparency, Adverse Selection, and Moral Hazard
We study the effects of improvements in market transparency on eBay on seller exit and continuing sellersâ behavior. An improvement in market transparency by reducing strategic bias in buyer ratings led to a significant increase in buyer valuation especially of sellers rated poorly prior to the change, but not to an increase in seller exit. When sellers had the choice between exitingâa reduction in adverse selectionâand improved behaviorâa reduction in moral hazardâ, they preferred the latter because of lower cost. Increasing market transparency improves on market outcomes
Asymptotically idempotent aggregation operators for trust management in multi-agent systems
The study of trust management in
multi-agent system, especially distributed,
has grown over the last
years. Trust is a complex subject
that has no general consensus in literature,
but has emerged the importance
of reasoning about it computationally.
Reputation systems takes
into consideration the history of an
entityâs actions/behavior in order to
compute trust, collecting and aggregating
ratings from members in a
community. In this scenario the aggregation
problem becomes fundamental,
in particular depending on
the environment. In this paper we
describe a technique based on a class
of asymptotically idempotent aggregation
operators, suitable particulary
for distributed anonymous environments
- âŠ