Loading…

Efficient private multi-party computations of trust in the presence of curious and malicious users

Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U 1 ,…, U n , we...

Full description

Saved in:
Bibliographic Details
Published in:Journal of trust management 2014-06, Vol.1 (1), p.8
Main Authors: Dolev, Shlomi, Gilboa, Niv, Kopeetsky, Marina
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93
cites cdi_FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93
container_end_page
container_issue 1
container_start_page 8
container_title Journal of trust management
container_volume 1
creator Dolev, Shlomi
Gilboa, Niv
Kopeetsky, Marina
description Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U 1 ,…, U n , we present computationally secure schemes for trust computation. The first scheme, Accumulated Protocol AP computes the average trust attributed to a specific user, U t following a trust evaluation request initiated by a user U n . The exact trust values of each queried user are not disclosed to U n . The next scheme, Weighted Accumulated Protocol WAP generates the average weighted trust in a specific user U t taking into consideration the unrevealed trust that U n has in each user participating in the trust evaluation process. The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed. The obtained vector of trust values assists in removing outliers. Given the set of trust values, the outliers that provide extremely low or high trust values can be removed from the trust evaluation process. We extend our schemes to the case when the initiator, U n , can be compromised by the adversary, and we introduce the Multiple Private Keys and the Weighted protocols ( MPKP and MPWP ) for computing average unweighted and weighted trust, respectively. Moreover, the Csed Protocol ( CEBP ) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O ( n ) (possibly large) messages.
doi_str_mv 10.1186/2196-064X-1-8
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1703733711</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3776774171</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93</originalsourceid><addsrcrecordid>eNptkE1LAzEQhoMoWGqP3gOeUzPJbjY5SqlaKHhR8BayaVa3dD_Mh9B_b5aK9OBpZphn3pl5EboFugSQ4p6BEoSK4p0AkRdo9ldfnuXXaBHCnlIKrCyFghmq103T2tb1EY--_TbR4S4dYktG4-MR26EbUzSxHfqAhwZHn0LEbY_jp8sDLrjeuqlhk2-HFLDpd7gzhyw5VSk4H27QVWMOwS1-4xy9Pa5fV89k-_K0WT1siQUpJVE7zpgtrCpUU7FSgCqLfKnjtAZloawoY7VxUuzy-apiBbeiqLmghnMljeJzdHfSHf3wlVyIej8k3-eVGirKK84rgEyRE2X9EIJ3jc5_d8YfNVA9Oaknt_TklgYtM7888SFz_YfzZ6r_DvwAevV0HA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1703733711</pqid></control><display><type>article</type><title>Efficient private multi-party computations of trust in the presence of curious and malicious users</title><source>ABI/INFORM Global</source><creator>Dolev, Shlomi ; Gilboa, Niv ; Kopeetsky, Marina</creator><creatorcontrib>Dolev, Shlomi ; Gilboa, Niv ; Kopeetsky, Marina</creatorcontrib><description>Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U 1 ,…, U n , we present computationally secure schemes for trust computation. The first scheme, Accumulated Protocol AP computes the average trust attributed to a specific user, U t following a trust evaluation request initiated by a user U n . The exact trust values of each queried user are not disclosed to U n . The next scheme, Weighted Accumulated Protocol WAP generates the average weighted trust in a specific user U t taking into consideration the unrevealed trust that U n has in each user participating in the trust evaluation process. The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed. The obtained vector of trust values assists in removing outliers. Given the set of trust values, the outliers that provide extremely low or high trust values can be removed from the trust evaluation process. We extend our schemes to the case when the initiator, U n , can be compromised by the adversary, and we introduce the Multiple Private Keys and the Weighted protocols ( MPKP and MPWP ) for computing average unweighted and weighted trust, respectively. Moreover, the Csed Protocol ( CEBP ) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O ( n ) (possibly large) messages.</description><identifier>ISSN: 2196-064X</identifier><identifier>EISSN: 2196-064X</identifier><identifier>DOI: 10.1186/2196-064X-1-8</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Coding and Information Theory ; Communication ; Community ; Computer Science ; Data Structures and Information Theory ; Licenses ; Privacy ; Protocol ; Public Key Infrastructure ; Reputations ; Software Engineering/Programming and Operating Systems ; Systems and Data Security ; Trust</subject><ispartof>Journal of trust management, 2014-06, Vol.1 (1), p.8</ispartof><rights>Dolev et al.; licensee Springer. 2014. This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</rights><rights>The Author(s) 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93</citedby><cites>FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1703733711?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363</link.rule.ids></links><search><creatorcontrib>Dolev, Shlomi</creatorcontrib><creatorcontrib>Gilboa, Niv</creatorcontrib><creatorcontrib>Kopeetsky, Marina</creatorcontrib><title>Efficient private multi-party computations of trust in the presence of curious and malicious users</title><title>Journal of trust management</title><addtitle>J Trust Manag</addtitle><description>Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U 1 ,…, U n , we present computationally secure schemes for trust computation. The first scheme, Accumulated Protocol AP computes the average trust attributed to a specific user, U t following a trust evaluation request initiated by a user U n . The exact trust values of each queried user are not disclosed to U n . The next scheme, Weighted Accumulated Protocol WAP generates the average weighted trust in a specific user U t taking into consideration the unrevealed trust that U n has in each user participating in the trust evaluation process. The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed. The obtained vector of trust values assists in removing outliers. Given the set of trust values, the outliers that provide extremely low or high trust values can be removed from the trust evaluation process. We extend our schemes to the case when the initiator, U n , can be compromised by the adversary, and we introduce the Multiple Private Keys and the Weighted protocols ( MPKP and MPWP ) for computing average unweighted and weighted trust, respectively. Moreover, the Csed Protocol ( CEBP ) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O ( n ) (possibly large) messages.</description><subject>Algorithms</subject><subject>Coding and Information Theory</subject><subject>Communication</subject><subject>Community</subject><subject>Computer Science</subject><subject>Data Structures and Information Theory</subject><subject>Licenses</subject><subject>Privacy</subject><subject>Protocol</subject><subject>Public Key Infrastructure</subject><subject>Reputations</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Systems and Data Security</subject><subject>Trust</subject><issn>2196-064X</issn><issn>2196-064X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNptkE1LAzEQhoMoWGqP3gOeUzPJbjY5SqlaKHhR8BayaVa3dD_Mh9B_b5aK9OBpZphn3pl5EboFugSQ4p6BEoSK4p0AkRdo9ldfnuXXaBHCnlIKrCyFghmq103T2tb1EY--_TbR4S4dYktG4-MR26EbUzSxHfqAhwZHn0LEbY_jp8sDLrjeuqlhk2-HFLDpd7gzhyw5VSk4H27QVWMOwS1-4xy9Pa5fV89k-_K0WT1siQUpJVE7zpgtrCpUU7FSgCqLfKnjtAZloawoY7VxUuzy-apiBbeiqLmghnMljeJzdHfSHf3wlVyIej8k3-eVGirKK84rgEyRE2X9EIJ3jc5_d8YfNVA9Oaknt_TklgYtM7888SFz_YfzZ6r_DvwAevV0HA</recordid><startdate>20140609</startdate><enddate>20140609</enddate><creator>Dolev, Shlomi</creator><creator>Gilboa, Niv</creator><creator>Kopeetsky, Marina</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>M0C</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20140609</creationdate><title>Efficient private multi-party computations of trust in the presence of curious and malicious users</title><author>Dolev, Shlomi ; Gilboa, Niv ; Kopeetsky, Marina</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Coding and Information Theory</topic><topic>Communication</topic><topic>Community</topic><topic>Computer Science</topic><topic>Data Structures and Information Theory</topic><topic>Licenses</topic><topic>Privacy</topic><topic>Protocol</topic><topic>Public Key Infrastructure</topic><topic>Reputations</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Systems and Data Security</topic><topic>Trust</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dolev, Shlomi</creatorcontrib><creatorcontrib>Gilboa, Niv</creatorcontrib><creatorcontrib>Kopeetsky, Marina</creatorcontrib><collection>SpringerOpen</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Business Premium Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of trust management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dolev, Shlomi</au><au>Gilboa, Niv</au><au>Kopeetsky, Marina</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient private multi-party computations of trust in the presence of curious and malicious users</atitle><jtitle>Journal of trust management</jtitle><stitle>J Trust Manag</stitle><date>2014-06-09</date><risdate>2014</risdate><volume>1</volume><issue>1</issue><spage>8</spage><pages>8-</pages><issn>2196-064X</issn><eissn>2196-064X</eissn><abstract>Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U 1 ,…, U n , we present computationally secure schemes for trust computation. The first scheme, Accumulated Protocol AP computes the average trust attributed to a specific user, U t following a trust evaluation request initiated by a user U n . The exact trust values of each queried user are not disclosed to U n . The next scheme, Weighted Accumulated Protocol WAP generates the average weighted trust in a specific user U t taking into consideration the unrevealed trust that U n has in each user participating in the trust evaluation process. The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed. The obtained vector of trust values assists in removing outliers. Given the set of trust values, the outliers that provide extremely low or high trust values can be removed from the trust evaluation process. We extend our schemes to the case when the initiator, U n , can be compromised by the adversary, and we introduce the Multiple Private Keys and the Weighted protocols ( MPKP and MPWP ) for computing average unweighted and weighted trust, respectively. Moreover, the Csed Protocol ( CEBP ) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O ( n ) (possibly large) messages.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1186/2196-064X-1-8</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2196-064X
ispartof Journal of trust management, 2014-06, Vol.1 (1), p.8
issn 2196-064X
2196-064X
language eng
recordid cdi_proquest_journals_1703733711
source ABI/INFORM Global
subjects Algorithms
Coding and Information Theory
Communication
Community
Computer Science
Data Structures and Information Theory
Licenses
Privacy
Protocol
Public Key Infrastructure
Reputations
Software Engineering/Programming and Operating Systems
Systems and Data Security
Trust
title Efficient private multi-party computations of trust in the presence of curious and malicious users
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T05%3A48%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20private%20multi-party%20computations%20of%20trust%20in%20the%20presence%20of%20curious%20and%20malicious%20users&rft.jtitle=Journal%20of%20trust%20management&rft.au=Dolev,%20Shlomi&rft.date=2014-06-09&rft.volume=1&rft.issue=1&rft.spage=8&rft.pages=8-&rft.issn=2196-064X&rft.eissn=2196-064X&rft_id=info:doi/10.1186/2196-064X-1-8&rft_dat=%3Cproquest_cross%3E3776774171%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1888-9d322c4c949f72561954000e30b19c157022bae86d00197243c64b360a3398a93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1703733711&rft_id=info:pmid/&rfr_iscdi=true