TY - GEN

T1 - Computing multi-party trust privately

T2 - 25th Annual ACM Symposium on Applied Computing, SAC 2010

AU - Dolev, Shlomi

AU - Gilboa, Niv

AU - Kopeetsky, Marina

PY - 2010/7/23

Y1 - 2010/7/23

N2 - Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more efficient than previous schemes by the number of messages exchanged which is proportional to the number of participants rather than to a quadratic number of the participants. We note that in our schemes the length of each message may be larger than the message length of previous schemes. The calculation of a trust, in a specific user by a group of community members, starts upon a request of an initiating user. The trust computation is provided in a completely distributed manner, while each user calculates its trust value privately. Given a community C and its members (users) U1, ..., Un, we present computationally secure schemes for trust computation. The first Accumulated Protocol AP computes the average trust in a specific user Ut upon the trust evaluation request initiated by a user Un. The exact trust values of each queried user are not disclosed to Un. The next Weighted Accumulated protocol WAP generates the average weighted trust in a specific user Ut taking into consideration the unrevealed trust that Un has in each user participating in the trust process evaluation. We extend our schemes to the case when the initiating user Un can be compromised by the adversary, and we introduce the Multiple Private Keys M P K P and the Multiple Private Keys Weighted M P W P protocols for computing average unweighted and weighted trust, respectively. The computation of all our algorithms requires the transmission of O(n) (possibly large) messages.

AB - Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more efficient than previous schemes by the number of messages exchanged which is proportional to the number of participants rather than to a quadratic number of the participants. We note that in our schemes the length of each message may be larger than the message length of previous schemes. The calculation of a trust, in a specific user by a group of community members, starts upon a request of an initiating user. The trust computation is provided in a completely distributed manner, while each user calculates its trust value privately. Given a community C and its members (users) U1, ..., Un, we present computationally secure schemes for trust computation. The first Accumulated Protocol AP computes the average trust in a specific user Ut upon the trust evaluation request initiated by a user Un. The exact trust values of each queried user are not disclosed to Un. The next Weighted Accumulated protocol WAP generates the average weighted trust in a specific user Ut taking into consideration the unrevealed trust that Un has in each user participating in the trust process evaluation. We extend our schemes to the case when the initiating user Un can be compromised by the adversary, and we introduce the Multiple Private Keys M P K P and the Multiple Private Keys Weighted M P W P protocols for computing average unweighted and weighted trust, respectively. The computation of all our algorithms requires the transmission of O(n) (possibly large) messages.

UR - http://www.scopus.com/inward/record.url?scp=77954720043&partnerID=8YFLogxK

U2 - 10.1145/1774088.1774401

DO - 10.1145/1774088.1774401

M3 - Conference contribution

AN - SCOPUS:77954720043

SN - 9781605586380

T3 - Proceedings of the ACM Symposium on Applied Computing

SP - 1460

EP - 1465

BT - APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing

Y2 - 22 March 2010 through 26 March 2010

ER -