Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Wang, Yileia; b; * | Li, Taoa | Liu, Qianqiana | Sun, Jinga | Liu, Zhec
Affiliations: [a] School of Information and Electrical Engineering, Ludong University, Yantai, China | [b] Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, China. E-mail: [email protected] | [c] Laboratory of Algorithmics, Cryptology and Security, University of Luxembourg, Luxembourg. E-mail: [email protected]
Correspondence: [*] Corresponding author: Yilei Wang, School of Information and Electrical Engineering, Ludong University, Middle of Hongqi Road 186, Yantai 264025, Shandong, China. E-mail: [email protected].
Abstract: Rational computation means secure multi-party computation in the presence of rational parties, who care about maximizing their utility. Here the notion of utility denotes payoffs when parties take certain actions in the computation. Therefore rational parties may carefully choose their actions before they interact with others. Traditionally, the main tasks of rational computation is to encourage parties to exchange information with their opponents, even if they do not trust each other. Exchanging information is similar to the action of cooperation towards the view of game theory. Therefore, measures should be taken to encourage parties to cooperate with others in rational computation. In this paper, we assume that rational parties who participate in the computation protocol form a social cloud. Parties in the social cloud may interact within several rounds and in each round, some desirable properties such as reputation may be generated. Parties who have good reputation means they are likely to cooperate with others. The structure of social cloud is not static. Instead, it evolutes when parties complete one round of computation. We mainly discuss the impact of social cloud structure on rational computation. Simulation results show that when the community structure reach to a proper value, parties are more likely to cooperate in the computation protocol. In addition, rational parties can gain optimal utilities.
Keywords: Social cloud, reputation, community structure, Nash equilibrium, rational computation
DOI: 10.3233/JHS-150519
Journal: Journal of High Speed Networks, vol. 21, no. 3, pp. 181-194, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]