Rational computing protocol based on fuzzy theory

被引:7
|
作者
Wang, Yilei [1 ,2 ]
Li, Tao [1 ]
Chen, Lufeng [1 ]
Li, Ping [3 ]
Leung, Ho-fung [4 ]
Liu, Zhe [5 ]
Xu, Qiuliang [6 ]
机构
[1] Ludong Univ, Sch Informat Sci & Elect Engn, Yantai 264025, Peoples R China
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou, Peoples R China
[3] Sun Yat Sen Univ, Sch Math & Computat Sci, Guangzhou 510275, Guangdong, Peoples R China
[4] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
[5] Univ Luxembourg, Lab Algorithm Cryptol & Secur, Luxembourg, Luxembourg
[6] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China
基金
中国国家自然科学基金;
关键词
Game theory; Private type; Cloud computing; Fuzzy set; Cooperation; MANAGEMENT;
D O I
10.1007/s00500-015-1773-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Secure multi-party computing (SMPC) is often used to solve security problems in cloud computing. Rational SMPC is a kind of SMPC in the presence of rational parties, who wish to maximize their utilities. Previous works about rational SMPC only studied the security properties under complete information scenario, where parties' types are common knowledge. However, parties in practical applications have private types, which is unknown to others. This scenario is called incomplete information. In this paper, rational parties are allowed to have private types, which affect their utilities. Previously, rational parties obtain expected utilities due to unknown private types under incomplete information scenario. However, rational parties prefer to obtain pure utilities in actual life. To solve this contradiction, we use fuzzy theory to confirm the private type of his opponent; then they execute the protocol as if they know the private types just like the execution under complete information scenario. Consequently, they obtain pure utilities other than expected utility. In addition, our protocol can reduce round complexity than previous ones. Consequently, it will improve the security level and efficiency of cloud computing.
引用
收藏
页码:429 / 438
页数:10
相关论文
共 50 条
  • [31] Granular Computing Based on Fuzzy and Tolerance Relations
    Zhang, Bo
    Zhang, Ling
    2008 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2008, : 24 - 24
  • [32] Fuzzy Clustering Research based on Intelligent Computing
    Liu, Jun
    Wu, Xiaoli
    Luo, Xiaoyuan
    2015 INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION, BIG DATA AND SMART CITY (ICITBS), 2016, : 429 - 432
  • [33] Granular computing based on fuzzy similarity relations
    Chen Degang
    Yang Yongping
    Wang Hui
    Soft Computing, 2011, 15 : 1161 - 1172
  • [34] Computing rational bisectors
    Elber, G
    Kim, MS
    IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1999, 19 (06) : 76 - 81
  • [35] A study on fuzzy logic based cloud computing
    Hayat, Bashir
    Kim, Kyong Hoon
    Kim, Ki-Il
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2018, 21 (01): : 589 - 603
  • [36] A study on fuzzy logic based cloud computing
    Bashir Hayat
    Kyong Hoon Kim
    Ki-Il Kim
    Cluster Computing, 2018, 21 : 589 - 603
  • [37] Computing rational bisectors
    Elber, Gershon
    Kim, Myung-Soo
    IEEE Computer Graphics and Applications, 19 (06): : 76 - 81
  • [38] A MODEL FOR COMPUTING RATIONAL ALGEBRAIC K-THEORY OF SIMPLY CONNECTED SPACES
    HSIANG, W
    STAFFELDT, RE
    INVENTIONES MATHEMATICAE, 1982, 68 (02) : 227 - 239
  • [39] Moment-based algorithms for computing orthogonal rational functions
    Van Deun, J
    Bultheel, A
    ICNAAM 2004: INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2004, 2004, : 432 - 435
  • [40] Sumcheck-based delegation of quantum computing to rational server
    Takeuchi, Yuki
    Morimae, Tomoyuki
    Tani, Seiichiro
    Theoretical Computer Science, 2022, 924 : 46 - 67