DE‐RSTC: A rational secure two‐party computation protocol based on direction entropy

International Journal of Intelligent SystemsVolume 37, Issue 11 p. 8947-8967 RESEARCH ARTICLE DE-RSTC: A rational secure two-party computation protocol based on direction entropy Yuling Chen, Yuling Chen orcid.org/0000-0002-8674-8356 State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, China Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin, ChinaSearch for more papers by this authorJuan Ma, Juan Ma State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, ChinaSearch for more papers by this authorXianmin Wang, Corresponding Author Xianmin Wang [email protected] orcid.org/0000-0003-3480-8780 Institute of Artificial Intelligence and Blockchain, Guangzhou University, Guangzhou, China Correspondence Xianmin Wang, Institute of Artificial Intelligence and Blockchain, Guangzhou University, 510002 Guangzhou, China. Email: [email protected]Search for more papers by this authorXinyu Zhang, Xinyu Zhang State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, ChinaSearch for more papers by this authorHuiyu Zhou, Huiyu Zhou School of Informatics, University of Leicester, England, United KingdomSearch for more papers by this author Yuling Chen, Yuling Chen orcid.org/0000-0002-8674-8356 State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, China Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin, ChinaSearch for more papers by this authorJuan Ma, Juan Ma State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, ChinaSearch for more papers by this authorXianmin Wang, Corresponding Author Xianmin Wang [email protected] orcid.org/0000-0003-3480-8780 Institute of Artificial Intelligence and Blockchain, Guangzhou University, Guangzhou, China Correspondence Xianmin Wang, Institute of Artificial Intelligence and Blockchain, Guangzhou University, 510002 Guangzhou, China. Email: [email protected]Search for more papers by this authorXinyu Zhang, Xinyu Zhang State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, ChinaSearch for more papers by this authorHuiyu Zhou, Huiyu Zhou School of Informatics, University of Leicester, England, United KingdomSearch for more papers by this author First published: 16 August 2022 https://doi.org/10.1002/int.22975Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat Abstract Rational secure multi-party computation means two or more rational parties complete a function on private inputs. Unfortunately, players sending false information can prevent the protocol from executing correctly, which will destroy the fairness of the protocol. To ensure the fairness of the protocol, the existing works on achieving fairness by specific utility functions. In this paper, we leverage game theory to propose the direction entropy-based solution. To this end, we utilize the direction entropy to examine the player's strategy uncertainty and quantify its strategy from different dimensions. Then, we provide mutual information to construct a new utility for the players. What's more, we measure the mutual information of players to appraise their strategies. By analyzing and proofing of protocol, we show that the protocol reaches a Nash equilibrium when players choose a cooperative strategy. Furthermore, we solve the fairness of the protocol. Compared to the previous approaches, our protocol is not required deposits and design-specific utility functions. CONFLICT OF INTEREST The authors declare no conflict of interest. Open Research DATA AVAILABILITY STATEMENT Data sharing is not applicable to this article as no new data were created or analyzed in this study. REFERENCES 1Chen Y, Dong S, Li T, Wang Y, Zhou H. Dynamic multi-key FHE in asymmetric key setting from LWE. IEEE Trans Inform Forensics Security. 2021; 16: 5239-5249. 2Zhao C, Zhao S, Zhao M, et al. Secure multi-party computation: theory, practice and applications. Inform Sci. 2019; 476: 357-372. 3Vu DH, Luong TD, Ho TB. An efficient approach for secure multi-party computation without authenticated channel. Inform Sci. 2020; 527: 356-368. 4Li T, Wang Z, Yang G, Cui Y, Chen Y, Yu X. Semi-selfish mining based on hidden Markov decision process. Int J Intell Syst. 2021; 36(7): 3596-3612. 5Chen Y, Sun J, Yang Y, Li T, Niu X, Zhou H. PSSPR: a source location privacy protection scheme based on sector phantom routing in WSNs. Int J Intell Syst. 2022; 37(2): 1204-1221. 6Halpern J, Teague V. Rational secret sharing and multiparty computation. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing; 2004: 623-632. 7Goldreich O. Secure multi-party computation. Manuscript Preliminary version. 1998; 78: 110. 8Yao AC. Protocols for secure computations. 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), IEEE; 1982:160-164. 9Yao ACC. How to generate and exchange secrets. 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), IEEE; 1986:162-167. 10Goldreich O, Micali S, Wigderson A. How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali; 2019: 307-328. 11Wang X, Ranellucci S, Katz J. Authenticated garbling and efficient maliciously secure two-party computation. Proceedings of the 2017 ACM SIGSAC conference on computer and communications security; 2017: 21-37. 12Gordon SD, Katz J. Partial fairness in secure two-party computation. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer; 2010: 157-176. 13Gordon SD, Hazay C, Katz J, Lindell Y. Complete fairness in secure two-party computation. J ACM. 2011; 58(6): 1-37. 14Groce A, Katz J. Fair computation with rational players. Annual 525 International Conference on the Theory and Applications of Cryptographic Techniques, Springer; 2012: 81-98. 15Chen Z, Tian Y, Xiong J, Peng C, Ma J. Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme. Inform Sci. 2021; 568: 286-316. 16Wang Y, Zheng Z, Wang H, Xu Q. Rational fair computation with computational sequential equilibrium. J Comput Res Devel. 2014; 51(7): 1527-1537. 17Wang Y, Li T, Qin H, et al. A brief survey on secure multi-party computing in the presence of rational parties. J Ambient Intell Human Comput. 2015; 6(6): 807-824. 18Dou Z, Xu G, Chen XB, Niu XX, Yang YX. Rational protocol of quantum secure multi-party computation. Quantum Inform Process. 2018; 17(8): 1-22. 19Wang Y, Liu Z, Wang H, Xu Q. Social rational secure multi-party computation. Concurrency Computat Practice Expe. 2014; 26(5): 1067-1083. 20Garay J, Katz J, Maurer U, Tackmann B, Zikas V. Rational protocol design: Cryptography against incentive-driven adversaries. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, IEEE; 2013:648-657. 21Wang Y, Yang G, Li T, Li F, Tian Y, Yu X. Belief and fairness: a secure two-party protocol toward the view of entropy for IoT devices. J Netw Comput Appl. 2020; 161(1):102641. 22Tang W, Liu YJ, Chen YL, Yang YX, Niu XX. SLBRS: network virus propagation model based on safety entropy. Appl Soft Comput. 2020; 97:106784. 23Zhang X, Liu Y, Chen Y. A new entropic criterion model in rational secure two-party computation. J Amb Intell Human Comput. 2022; 13(3): 1363-1372. 24Ah-Fat P, Huth M. Optimal accuracy-privacy trade-off for secure computations. IEEE Trans Inform Theory. 2018; 65(5): 3165-3182. 25Yang Y, Niu X. The general theory of information security. Publishig house of electronics industry; 2018. 26Tian Y, Guo J, Wu Y, Lin H. Towards attack and defense views of rational delegation of computation. IEEE Access. 2019; 7: 44037-44049. 27Li Q, Tian Y. Rational delegation computing using information theory and game theory approach. International Conference on Multimedia Modeling, Springer; 2020:669-680. 28Liu C, Tian Y, Xiong J, Lu Y, Li Q, Peng C. Towards attack and defense views to k-anonymous using information theory approach. IEEE Access. 2019; 7: 156025-156032. 29Yuan F, Chen S, Liang K, Xu L. Research on the Coordination Mechanism of Traditional Chinese Medicine Medical Record Data Standardization and Characteristic Protection Under Big Data Environment. Shandong People's Publishing House; 2021. Volume37, Issue11November 2022Pages 8947-8967 ReferencesRelatedInformation