2014
DOI: 10.1186/2196-064x-1-8
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 in terms of the number of messages exchanged, which is proportional to the number of participants rather than to its square. We note that in our schemes the length of each message may be larger than the message length typically found in previously published schemes. The calculation of a trust, in a specific user by a group of community members starts … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 28 publications
(59 reference statements)
0
5
0
Order By: Relevance
“…Dimitriou and Michalas [57,58] describe a decentralized privacy respecting scheme that is formally shown to be resistant to collusion against up to n − 1 malicious participants. Dolev et al [59,60] propose SMPC-based reputation schemes that are more efficient than the previous ones in terms of the number of messages exchanged. Their schemes privately compute reputation scores with a communication overhead of O(n) messages, where n is the number of participants in the protocol.…”
Section: Smpc-based Systemsmentioning
confidence: 99%
“…Dimitriou and Michalas [57,58] describe a decentralized privacy respecting scheme that is formally shown to be resistant to collusion against up to n − 1 malicious participants. Dolev et al [59,60] propose SMPC-based reputation schemes that are more efficient than the previous ones in terms of the number of messages exchanged. Their schemes privately compute reputation scores with a communication overhead of O(n) messages, where n is the number of participants in the protocol.…”
Section: Smpc-based Systemsmentioning
confidence: 99%
“…In [23] Dolev et al presented a distributed approach for calculating a user's trustworthiness in specific time window by aggregating scores upon the request of an initiator. The scheme operates in a distributed manner, where each user calculates its trust value privately and independently.…”
Section: Related Workmentioning
confidence: 99%
“…Finally, we studied the use of zero-knowledge proofs and multiparty secure computation. Some publications (e.g., [ 19 ]) are useful for us to design our proposed scheme and to identify various aspects which could improved in the future.…”
Section: Related Workmentioning
confidence: 99%