Computing Reputation for Collaborative Private Networks

Nin, Jordi; Carminati, Barbara; Ferrari, Elena; Torra, Vicenç

doi:10.1109/compsac.2009.40

Cited by 15 publications

(8 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the design of these audit-based tools is complicated by several issues, like the implications an audit system might have on users privacy and/or the limitations on what it is possible to audit in current OSNs. A preliminary work in this direction has been done in the context of trust values used for OSN access control purposes [52]. However, we would like to remark that the system proposed in this paper represents just the core set of functionalities needed to provide a sophisticated tool for OSN message filtering.…”

Section: Discussionmentioning

confidence: 99%

A System to Filter Unwanted Messages from OSN User Walls

Vanetti

Binaghi

Ferrari

et al. 2013

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

A System to Filter Unwanted Messages from OSN User Walls

Vanetti

Binaghi

Ferrari

et al. 2013

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…The complexity of the scheme is quite high since it requires O(n 3 ) messages where n is the number of contributing nodes. Another relevant paper was presented recently by Nin et al [21]. [21] also uses Homomorphic encryption similar to two of our schemes, but their reputation model is quite different and is not a Trust-set based model like ours.…”

Section: Background and Related Workmentioning

confidence: 99%

Schemes for Privately Computing Trust and Reputation

Gal-Oz¹,

Gilboa²,

Gudes³

2010

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. Trust and Reputation systems in distributed environments attain widespread interest as online communities are becoming an inherent part of the daily routine of Internet users. Several models for Trust and Reputation have been suggested recently, among them the Knots model [8]. The Knots model provides a member of a community with a method to compute the reputation of other community members. Reputation in this model is subjective and tailored to the taste and choices of the computing member and those members that have similar views, i.e. the computing member's Trust-Set. A discussion on privately computing trust in the Knots model appears in [16]. The present paper extends and improves [16] by presenting three efficient and private protocols to compute trust in trust based reputation systems that use any trust-sets based model. The protocols in the paper are rigorously proved to be private against a semi-honest adversary given standard assumptions on the existence of an homomorphic, semantically secure, public key encryption system. The protocols are analyzed and compared in terms of their privacy characteristics and communication complexity.

show abstract

“…Up to now, we are aware of very few works addressing this issue (see, e.g., Nin et al [2009]). As we have seen in Section 6.3, trust is one of the key parameters on which access control decisions should be based in an open environment like the Web.…”

Section: Further Research Directions In Access Controlmentioning

confidence: 99%

Access Control in Data Management Systems

Ferrari¹

2010

Synthesis Lectures on Data Management

Self Cite

View full text Add to dashboard Cite

Synthesis Lectures on Data Management is edited by Tamer Özsu of the University of Waterloo.The series will publish 50-to 125 page publications on topics pertaining to data management. The scope will largely follow the purview of premier information and computer science conferences, such as ACM SIGMOD, VLDB, ICDE, PODS, ICDT, and ACM KDD. Potential topics include, but not are limited to: query languages, database system architectures, transaction management, ABSTRACT Access control is one of the fundamental services that any Data Management System should provide. Its main goal is to protect data from unauthorized read and write operations. This is particularly crucial in today's open and interconnected world, where each kind of information can be easily made available to a huge user population, and where a damage or misuse of data may have unpredictable consequences that go beyond the boundaries where data reside or have been generated.This book provides an overview of the various developments in access control for data management systems. Discretionary, mandatory, and role-based access control will be discussed, by surveying the most relevant proposals and analyzing the benefits and drawbacks of each paradigm in view of the requirements of different application domains. Access control mechanisms provided by commercial Data Management Systems are presented and discussed. Finally, the last part of the book is devoted to discussion of some of the most challenging and innovative research trends in the area of access control, such as those related to the Web 2.0 revolution or to the Database as a Service paradigm.This book is a valuable reference for an heterogeneous audience. It can be used as either an extended survey for people who are interested in access control or as a reference book for senior undergraduate or graduate courses in data security with a special focus on access control. It is also useful for technologists, researchers, managers, and developers who want to know more about access control and related emerging trends.

show abstract

Computing Reputation for Collaborative Private Networks

Abstract: The use of collaborative network services is increasing, therefore

Cited by 15 publications

References 20 publications

A System to Filter Unwanted Messages from OSN User Walls

A System to Filter Unwanted Messages from OSN User Walls

Schemes for Privately Computing Trust and Reputation

Access Control in Data Management Systems

Contact Info

Product

Resources

About