{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:13:53Z","timestamp":1740158033932,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,16]],"date-time":"2021-02-16T00:00:00Z","timestamp":1613433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,16]],"date-time":"2021-02-16T00:00:00Z","timestamp":1613433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61962009"],"award-info":[{"award-number":["No. 61962009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12652-020-02633-4","type":"journal-article","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:14:20Z","timestamp":1613690060000},"page":"1363-1372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new entropic criterion model in rational secure two-party computation"],"prefix":"10.1007","volume":"13","author":[{"given":"Xinyu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yujun","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3698-2478","authenticated-orcid":false,"given":"Yuling","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"key":"2633_CR1","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-20465-4_24","volume-title":"Advances in cryptology eurocrypt 2011","author":"G Asharov","year":"2011","unstructured":"Asharov G, Canetti R, Hazay C (2011) Towards a game theoretic view of secure computation. Advances in cryptology eurocrypt 2011. Springer, New York, pp 426\u2013445"},{"issue":"9","key":"2633_CR2","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2012","unstructured":"Chen X, Li J, Ma J et al (2012) New algorithms for secure outsourcing of modular exponentiations. IEEE Trans Parallel Distrib Syst 25(9):2386\u20132396","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2633_CR3","doi-asserted-by":"crossref","unstructured":"Garay J, Katz J, Maurer U, Tackmann B, Zikas V (2013) Rational protocol design: cryptography against incentive-driven adversaries. In: 2013 IEEE 54th annual symposium on foundations of computer science (FOCS). IEEE, pp 648\u2013657","DOI":"10.1109\/FOCS.2013.75"},{"issue":"1","key":"2633_CR4","first-page":"170","volume":"3","author":"LA Glicksberg","year":"1952","unstructured":"Glicksberg LA (1952) Further generalization of the Kakutani fixed point theorem, with application to nash equilibrium points. Proc Am Math Soc 3(1):170\u2013174","journal-title":"Proc Am Math Soc"},{"key":"2633_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and cryptography for networks","author":"SD Gordon","year":"2006","unstructured":"Gordon SD, Katz J (2006) Rational secret sharing, revisited. Security and cryptography for networks. Springer, New York, pp 229\u2013241"},{"key":"2633_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the 19th Symposium on the Theory of Computing (STOC), pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"2633_CR7","first-page":"623","volume-title":"Of the thirty\u2014sixth annual ACM symposium on theory of computing","author":"J Halpern","year":"2004","unstructured":"Halpern J, Teague V (2004) Rational secret sharing and multiparty computation. Of the thirty\u2014sixth annual ACM symposium on theory of computing. ACM, New York, pp 623\u2013632"},{"issue":"1","key":"2633_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01737554","volume":"2","author":"JC Harsanyi","year":"1973","unstructured":"Harsanyi JC (1973) Games with randomly disturbed payoffs: a new rationale for mixed-strategy equilibrium points. Int J Game Theory 2(1):1\u201323","journal-title":"Int J Game Theory"},{"key":"2633_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient secure two-party protocols: techniques and constructions","author":"C Hazay","year":"2010","unstructured":"Hazay C, Lindell Y (2010) Efficient secure two-party protocols: techniques and constructions. Springer, New York"},{"key":"2633_CR10","first-page":"1","volume":"2008","author":"S Maleka","year":"2008","unstructured":"Maleka S, Shareef A, Rangan CP (2008a) The deterministic protocol for rational secret sharing. IEEE international symposium on parallel and distributed processing, IPDPS 2008, pp 1\u20137","journal-title":"IEEE international symposium on parallel and distributed processing, IPDPS"},{"key":"2633_CR11","first-page":"334","volume-title":"Rational secret sharing with repeated games","author":"S Maleka","year":"2008","unstructured":"Maleka S, Shareef A, Rangan CP (2008b) Rational secret sharing with repeated games. Information security practice and experience. Springer, New York, pp 334\u2013346"},{"key":"2633_CR12","volume-title":"Game theory: analysis of conflict","author":"RB Myerson","year":"1997","unstructured":"Myerson RB (1997) Game theory: analysis of conflict. Harvard University Press, Cambridge"},{"key":"2633_CR13","doi-asserted-by":"crossref","unstructured":"Nojoumian M, Stinson DR (2012) Socio-Rational secret sharing as a new direction in rational cryptography. In: Grossklags J, Walrand J (eds) Decision and Game Theory for Security. GameSec 2012. Lecture Notes in Computer Science, vol 7638. Springer, Berlin, Heidelberg, pp 18\u201337","DOI":"10.1007\/978-3-642-34266-0_2"},{"issue":"4","key":"2633_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(4):379\u2013423","journal-title":"Bell Syst Tech J"},{"issue":"5","key":"2633_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.3390\/e20050312","volume":"20","author":"R Stefan","year":"2018","unstructured":"Stefan R, Sandra K (2018) Password security as a game of entropies. Entropy 20(5):312","journal-title":"Entropy"},{"issue":"10","key":"2633_CR16","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1007\/s00500-015-1974-0","volume":"20","author":"Y Wang","year":"2015","unstructured":"Wang Y, Chen L et al (2015) Fairness in secure computing protocols based on incentives. Soft Comput 20(10):3947\u20133955","journal-title":"Soft Comput"},{"key":"2633_CR17","doi-asserted-by":"publisher","unstructured":"Wang Y, Zhang S, Tang Y et al (2018) Rational adversary with flexible utility in secure two-party computation. J Ambient Intell Human Comput:1\u201315. https:\/\/doi.org\/10.1007\/s12652-017-0669-z","DOI":"10.1007\/s12652-017-0669-z"},{"key":"2633_CR18","doi-asserted-by":"crossref","unstructured":"Wang Y et al (2019) Secure computation protocols under asymmetric scenarios in enterprise information system. Enterprise Information Systems:1\u201321","DOI":"10.1080\/17517575.2019.1597387"},{"key":"2633_CR20","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computation. In: Foundations of Computer Science. SFCS'08. 23rd Annual Symposium on IEEE, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"issue":"2","key":"2633_CR21","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/JIOT.2016.2597150","volume":"4","author":"Y Yang","year":"2017","unstructured":"Yang Y, Peng H et al (2017) General theory of security and a studycase in internet of things. IEEE Internet Things J 4(2):592\u2013600","journal-title":"IEEE Internet Things J"},{"issue":"1","key":"2633_CR25","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s12083-016-0517-5","volume":"2","author":"Y Yang","year":"2018","unstructured":"Yang Y, Niu X et al (2018) General theory of security and a study of hacker\u2019s behavior in big data era. Peer to Peer Netw Appl 2(1):210\u2013219","journal-title":"Peer to Peer Netw Appl"},{"issue":"11","key":"2633_CR26","doi-asserted-by":"publisher","first-page":"858","DOI":"10.3390\/e20110858","volume":"20","author":"H Yimin","year":"2018","unstructured":"Yimin H, Xingli C et al (2018) The complexity and entropy analysis for service game model based on different expectations and optimal pricing. Entropy 20(11):858","journal-title":"Entropy"},{"key":"2633_CR28","volume-title":"Game theory and information economics","author":"W Zhang","year":"1996","unstructured":"Zhang W (1996) Game theory and information economics. People\u2019s Publishers, Shanghai"},{"key":"2633_CR27","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2019.05.061","volume":"498","author":"L Zhang","year":"2019","unstructured":"Zhang L, Wang Y, Li F et al (2019) A game-theoretic method based on Q-learning to invalidate criminal smart contracts. Inf Sci 498:144\u2013153","journal-title":"Inf Sci"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02633-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-020-02633-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02633-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T10:35:35Z","timestamp":1646130935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-020-02633-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,16]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["2633"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-02633-4","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2021,2,16]]},"assertion":[{"value":"18 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}