{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T18:36:09Z","timestamp":1768674969487,"version":"3.49.0"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T00:00:00Z","timestamp":1435881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61202475"],"award-info":[{"award-number":["61202475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangzhou Zhujiang Science and Technology Future Fellow Fund","award":["2012J2200094"],"award-info":[{"award-number":["2012J2200094"]}]},{"name":"Outstanding Young Scientists Foundation Grant of Shandong Province","award":["BS2014DX016"],"award-info":[{"award-number":["BS2014DX016"]}]},{"name":"Nature Science Foundation of Shandong Province","award":["ZR2012FQ029"],"award-info":[{"award-number":["ZR2012FQ029"]}]},{"name":"Ph.D. Programs Foundation of Ludong University","award":["LY2015033"],"award-info":[{"award-number":["LY2015033"]}]},{"DOI":"10.13039\/501100012561","name":"Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund","doi-asserted-by":"crossref","award":["15004"],"award-info":[{"award-number":["15004"]}],"id":[{"id":"10.13039\/501100012561","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s12652-015-0299-2","type":"journal-article","created":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T03:49:17Z","timestamp":1435808957000},"page":"807-824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A brief survey on secure multi-party computing in the presence of rational parties"],"prefix":"10.1007","volume":"6","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hairong","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,3]]},"reference":[{"key":"299_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, Dolev D, Gonen R, Halpern J (2006) Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th annual ACM symposium on principles of distributed computing, pp 53\u201362. ACM","DOI":"10.1145\/1146381.1146393"},{"key":"299_CR2","doi-asserted-by":"crossref","unstructured":"Achim OM, Oracle TSBU, Bucharest R, Pop F, Cristea V (2011) Reputation based selection for services in cloud environments. In: NBiS 2011, pp 268\u2013273. IEEE","DOI":"10.1109\/NBiS.2011.46"},{"key":"299_CR3","doi-asserted-by":"crossref","unstructured":"Aiyer AS, Alvisi L, Clement A, Dahlin M, Martin JP, Porth C (2005) Bar fault tolerance for cooperative services. In: ACM SIGOPS operating systems review, vol 39, pp 45\u201358. ACM","DOI":"10.1145\/1095809.1095816"},{"issue":"1","key":"299_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12652-010-0027-x","volume":"2","author":"V Alfredo","year":"2011","unstructured":"Alfredo V, Ahmed ZF (2011) Cooperative fuzzy controllers for autonomous voltage regulation in smart grids. J Ambient Intell Hum Comput 2(1):1\u201310","journal-title":"J Ambient Intell Hum Comput"},{"key":"299_CR5","doi-asserted-by":"crossref","unstructured":"Alwen J, Shelat A, Visconti I (2008) Collusion-free protocols in the mediated model. In: Advances in cryptology-CRYPTO 2008, pp 497\u2013514. Springer","DOI":"10.1007\/978-3-540-85174-5_28"},{"key":"299_CR6","doi-asserted-by":"crossref","unstructured":"Alwen J, Katz J, Lindell Y, Persiano G, Shelat A, Visconti I (2009) Collusion-free multiparty computation in the mediated model. In: Advances in cryptology-CRYPTO 2009, pp 524\u2013540. Springer","DOI":"10.1007\/978-3-642-03356-8_31"},{"key":"299_CR7","doi-asserted-by":"crossref","unstructured":"Alwen J, Katz J, Maurer U, Zikas V (2012) Collusion-preserving computation. In: Advances in cryptology-CRYPTO 2012, pp 124\u2013143. Springer","DOI":"10.1007\/978-3-642-32009-5_9"},{"issue":"5","key":"299_CR8","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s12652-013-0190-y","volume":"5","author":"A Amato","year":"2014","unstructured":"Amato A, Beniamino DM, Venticinque S (2014) Agents based multi-criteria decision-aid. J Ambient Intell Hum Comput 5(5):747\u2013758","journal-title":"J Ambient Intell Hum Comput"},{"issue":"2","key":"299_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s12652-011-0068-9","volume":"4","author":"J Andreu","year":"2013","unstructured":"Andreu J, Angelov P (2013) An evolving machine learning method for human activity recognition systems. J Ambient Intell Hum Comput 4(2):195\u2013206","journal-title":"J Ambient Intell Hum Comput"},{"issue":"1","key":"299_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00145-010-9064-z","volume":"24","author":"G Asharov","year":"2011","unstructured":"Asharov G, Lindell Y (2011) Utility dependence in correct and fair rational secret sharing. J Cryptol 24(1):157\u2013202","journal-title":"J Cryptol"},{"key":"299_CR11","doi-asserted-by":"crossref","unstructured":"Asharov G, Canetti R, Hazay C (2011) Towards a game theoretic view of secure computation. In: Advances in cryptology-EUROCRYPT 2011, pp 426\u2013445. Springer","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"299_CR12","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y (2007) Security against covert adversaries: efficient protocols for realistic adversaries. In: Theory of cryptography, pp 137\u2013156. Springer","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"299_CR13","unstructured":"Bei X, Chen W, Zhang J (2012) Distributed consensus resilient to both crash failures and strategic manipulations. arXiv preprint arXiv:1203.4324"},{"key":"299_CR14","doi-asserted-by":"crossref","unstructured":"Beimel A, Lindell Y, Omri E, Orlov I (2011) 1\/p-secure multiparty computation without honest majority and the best of both worlds. In: Advances in cryptology-CRYPTO 2011, pp 277\u2013296. Springer","DOI":"10.1007\/978-3-642-22792-9_16"},{"issue":"1","key":"299_CR15","first-page":"149","volume":"21","author":"Y Cai","year":"2012","unstructured":"Cai Y, Peng X (2012) Rational secret sharing protocol with fairness. Chin J Electron 21(1):149\u2013152","journal-title":"Chin J Electron"},{"issue":"1","key":"299_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti R (2000) Security and composition of multiparty cryptographic protocols. J Cryptol 13(1):143\u2013202","journal-title":"J Cryptol"},{"key":"299_CR17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.future.2014.07.001","volume":"43","author":"A Castiglione","year":"2015","unstructured":"Castiglione A, Pizzolante R, De Santis A, Carpentieri B, Castiglione A, Palmieri F (2015) Cloud-based adaptive compression and secure management services for 3d healthcare data. Future Gener Comput Syst 43:120\u2013134","journal-title":"Future Gener Comput Syst"},{"issue":"8","key":"299_CR18","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1016\/j.ins.2010.12.012","volume":"181","author":"X Chen","year":"2011","unstructured":"Chen X, Wu Q, Zhang F, Tian H, Wei B, Lee B, Lee H, Kim K (2011) New receipt-free voting scheme using double-trapdoor commitment. Inform Sci 181(8):1493\u20131502","journal-title":"Inform Sci"},{"key":"299_CR19","doi-asserted-by":"crossref","unstructured":"Chen X, Li J, Ma J, Tang Q, Lou W (2012a) New algorithms for secure outsourcing of modular exponentiations. In: Computer security-ESORICS 2012, pp 541\u2013556. Springer","DOI":"10.1007\/978-3-642-33167-1_31"},{"issue":"6","key":"299_CR20","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/TIFS.2012.2210880","volume":"7","author":"X Chen","year":"2012","unstructured":"Chen X, Li J, Susilo W (2012b) Efficient fair conditional payments for outsourcing computations. IEEE Trans Inform Forensics Secur 7(6):1687\u20131694","journal-title":"IEEE Trans Inform Forensics Secur"},{"key":"299_CR21","doi-asserted-by":"crossref","unstructured":"Clement A, Li H, Napper J, Martin JP, Alvisi L, Dahlin M (2008) Bar primer. In: Dependable systems and networks with FTCS and DCC, 2008. DSN 2008. IEEE International Conference on, pp 287\u2013296. IEEE","DOI":"10.1109\/DSN.2008.4630097"},{"key":"299_CR22","doi-asserted-by":"crossref","unstructured":"Cleve R (1986) Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the eighteenth annual ACM symposium on theory of computing, pp 364\u2013369. ACM","DOI":"10.1145\/12130.12168"},{"key":"299_CR23","doi-asserted-by":"crossref","unstructured":"Dodis Y, Halevi S, Rabin T (2000) A cryptographic solution to a game theoretic problem. In: Advances in cryptology $$^\\circ TM$$ \u2218 T M Crypto 2000, pp 112\u2013130. Springer","DOI":"10.1007\/3-540-44598-6_7"},{"key":"299_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.2015.2389952","volume":"99","author":"C Esposito","year":"2015","unstructured":"Esposito C, Ficco M, Palmieri F, Castiglione A (2015) Smart cloud storage service selection based on fuzzy logic, theory of evidence and game theory. IEEE Trans Comput 99:1\u201314","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"299_CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s12652-012-0135-x","volume":"5","author":"D Faiyaz","year":"2014","unstructured":"Faiyaz D, Rahat I, Raouf NG (2014) A fuzzy ambient intelligent agents approach for monitoring disease progression of dementia patients. J Ambient Intell Hum Comput 5(1):147\u2013158","journal-title":"J Ambient Intell Hum Comput"},{"key":"299_CR26","doi-asserted-by":"crossref","unstructured":"Ficco M, Tasquier L, Aversa R (2014) Agent-based intrusion detection for federated clouds. In: INCoS 2014, pp 586\u2013591. IEEE","DOI":"10.1109\/INCoS.2014.93"},{"key":"299_CR27","doi-asserted-by":"crossref","unstructured":"Fuchsbauer G, Katz J, Naccache D (2010) Efficient rational secret sharing in standard communication networks. In: Theory of cryptography, pp 419\u2013436. Springer","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"299_CR28","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), pp 648\u2013657. IEEE","DOI":"10.1109\/FOCS.2013.75"},{"issue":"3","key":"299_CR29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s12652-011-0050-6","volume":"3","author":"\u00d3 Garc\u00eda","year":"2012","unstructured":"Garc\u00eda \u00d3, Tapia DI, Alonso RS, Rodr\u00edguez S, Corchado JM (2012) Ambient intelligence and collaborative e-learning: a new definition model. J Ambient Intell Hum Comput 3(3):239\u2013247","journal-title":"J Ambient Intell Hum Comput"},{"issue":"1","key":"299_CR30","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I Gilboa","year":"1989","unstructured":"Gilboa I, Zemel E (1989) Nash and correlated equilibria: some complexity considerations. Games Econ Behav 1(1):80\u201393","journal-title":"Games Econ Behav"},{"key":"299_CR31","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game-a completeness therem for protocols with honest majority. In Proc. 19th ACM symposium on the theory of computing, pp 218\u2013229"},{"key":"299_CR32","doi-asserted-by":"crossref","unstructured":"Gordon SD, Katz J (2006) Rational secret sharing, revisited. In: Security and cryptography for networks, pp 229\u2013241. Springer","DOI":"10.1007\/11832072_16"},{"issue":"1","key":"299_CR33","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"SD Gordon","year":"2012","unstructured":"Gordon SD, Katz J (2012) Partial fairness in secure two-party computation. J cryptol 25(1):14\u201340","journal-title":"J cryptol"},{"issue":"6","key":"299_CR34","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2049697.2049698","volume":"58","author":"SD Gordon","year":"2011","unstructured":"Gordon SD, Hazay C, Katz J, Lindell Y (2011) Complete fairness in secure two-party computation. J ACM (JACM) 58(6):24","journal-title":"J ACM (JACM)"},{"issue":"1","key":"299_CR35","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2399187.2399189","volume":"1","author":"R Gradwohl","year":"2013","unstructured":"Gradwohl R, Livne N, Rosen A (2013) Sequential rationality in cryptographic protocols. ACM Trans Econ Comput 1(1):2","journal-title":"ACM Trans Econ Comput"},{"key":"299_CR36","doi-asserted-by":"crossref","unstructured":"Groce A, Katz J (2012) Fair computation with rational players. In: Advances in cryptology-EUROCRYPT 2012, pp 81\u201398. Springer","DOI":"10.1007\/978-3-642-29011-4_7"},{"key":"299_CR37","doi-asserted-by":"crossref","unstructured":"Groce A, Katz J, Thiruvengadam A, Zikas V (2012) Byzantine agreement with a rational adversary. In: Automata, languages, and programming, pp 561\u2013572. Springer","DOI":"10.1007\/978-3-642-31585-5_50"},{"key":"299_CR38","unstructured":"Halpern J, Pass R (2008) Game theory with costly computation. arXiv preprint arXiv:0809.0024"},{"key":"299_CR39","doi-asserted-by":"crossref","unstructured":"Halpern J, Teague V (2004) Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004: proceedings of the 36th annum ACM symposium on theory of computing, New York, USA: ACM, pp 623\u2013632","DOI":"10.1145\/1007352.1007447"},{"issue":"12","key":"299_CR40","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s00500-005-0041-7","volume":"10","author":"L Huang","year":"2006","unstructured":"Huang L, Su C (2006) Facial expression synthesis using manifold learning and belief propagation. Soft Comput 10(12):1193\u20131200","journal-title":"Soft Comput"},{"issue":"1","key":"299_CR41","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1587\/transfun.E93.A.42","volume":"93","author":"T Isshiki","year":"2010","unstructured":"Isshiki T, Koichiro W, Tanaka K (2010) A rational secret-sharing scheme based on rsa-oaep. IIEICE Trans Fundam Electron Commun Comput Sci 93(1):42\u201349","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"299_CR42","doi-asserted-by":"crossref","unstructured":"Izmalkov S, Micali S, Lepinski M (2005) Rational secure computation and ideal mechanism design. In: Foundations of computer science, 2005. FOCS 2005. 46th Annual IEEE symposium on, pp 585\u2013594. IEEE","DOI":"10.1109\/SFCS.2005.64"},{"key":"299_CR43","doi-asserted-by":"crossref","unstructured":"Izmalkov S, Lepinski M, Micali S (2008) Verifiably secure devices. In: Theory of cryptography, pp 273\u2013301. Springer","DOI":"10.1007\/978-3-540-78524-8_16"},{"key":"299_CR44","doi-asserted-by":"crossref","unstructured":"Katz J (2008) Bridging game theory and cryptography: recent results and future directions. In: Theory of cryptography, pp 251\u2013272. Springer","DOI":"10.1007\/978-3-540-78524-8_15"},{"key":"299_CR45","doi-asserted-by":"crossref","unstructured":"Katz J, Maurer U, Tackmann B, Zikas V (2013) Universally composable synchronous computation. In: Theory of cryptography, pp 477\u2013498. Springer","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"299_CR46","doi-asserted-by":"crossref","unstructured":"Kol G, Naor M (2008a) Cryptography and game theory: designing protocols for exchanging information. In: Theory of cryptography, pp 320\u2013339. Springer","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"299_CR47","doi-asserted-by":"crossref","unstructured":"Kol G, Naor M (2008b) Games for exchanging information. In: Proceedings of the fortieth annual ACM symposium on theory of computing, pp 423\u2013432. ACM","DOI":"10.1145\/1374376.1374437"},{"issue":"3","key":"299_CR48","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Program Lang Syst (TOPLAS) 4(3):382\u2013401","journal-title":"ACM Trans Program Lang Syst (TOPLAS)"},{"key":"299_CR50","doi-asserted-by":"crossref","unstructured":"Lepinski M, Micali S, Peikert C, Shelat A (2004) Completely fair sfe and coalition-safe cheap talk. In: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing, pp 1\u201310. ACM","DOI":"10.1145\/1011767.1011769"},{"key":"299_CR49","doi-asserted-by":"crossref","unstructured":"Lepinksi M, Micali S, Shelat A (2005) Collusion-free protocols. In: Proceedings of the thirty-seventh annual ACM symposium on theory of computing, pp 543\u2013552. ACM","DOI":"10.1145\/1060590.1060671"},{"key":"299_CR51","unstructured":"Li HC, Clement A, Wong EL, Napper J, Roy I, Alvisi L, Dahlin M (2006) Bar gossip. In: Proceedings of the 7th symposium on operating systems design and implementation, pp 191\u2013204. USENIX Association"},{"issue":"8","key":"299_CR52","doi-asserted-by":"crossref","first-page":"2201","DOI":"10.1109\/TPDS.2013.271","volume":"25","author":"J Li","year":"2014","unstructured":"Li J, Huang X, Li J, Chen X, Xiang Y (2014) Securely outsourcing attribute-based encryption with checkability. IEEE Trans Parallel Distrib Syst 25(8):2201\u20132210","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"299_CR53","first-page":"738","volume":"7","author":"Z Luo","year":"2012","unstructured":"Luo Z, Cai Y, Yang Y (2012) Rational multi-secret sharing scheme based on bit commitment protocol. J Netw 7(4):738\u2013745","journal-title":"J Netw"},{"key":"299_CR54","doi-asserted-by":"crossref","unstructured":"Lysyanskaya A, Triandopoulos N (2006) Rationality and adversarial behavior in multi-party computation. In: Advances in cryptology-CRYPTO 2006, pp 180\u2013197. Springer","DOI":"10.1007\/11818175_11"},{"key":"299_CR55","doi-asserted-by":"crossref","unstructured":"Maleka S, Shareef A, Rangan CP (2008a) The deterministic protocol for rational secret sharing. In: Parallel and distributed processing, 2008. IPDPS 2008. IEEE international symposium on, pp 1\u20137. IEEE","DOI":"10.1109\/IPDPS.2008.4536558"},{"key":"299_CR56","doi-asserted-by":"crossref","unstructured":"Maleka S, Shareef A, Rangan CP (2008b) Rational secret sharing with repeated games. In: Information security practice and experience, pp 334\u2013346. Springer","DOI":"10.1007\/978-3-540-79104-1_24"},{"key":"299_CR57","doi-asserted-by":"crossref","unstructured":"Micali S (2009) Purely rational secret sharing. In: Theory of cryptography, pp 54\u201371. Springer","DOI":"10.1007\/978-3-642-00457-5_4"},{"issue":"1","key":"299_CR58","doi-asserted-by":"crossref","first-page":"18","DOI":"10.2307\/2555625","volume":"17","author":"P Milgrom","year":"1986","unstructured":"Milgrom P, Roberts J (1986) Relying on the information of interested parties. RAND J Econ 17(1):18\u201332","journal-title":"RAND J Econ"},{"key":"299_CR59","doi-asserted-by":"crossref","unstructured":"Moses JR, William K, Rangan CP (2011) Rational secret sharing with honest players over an asynchronous channel. In: Advances in network security and applications, pp 414\u2013426. Springer","DOI":"10.1007\/978-3-642-22540-6_40"},{"key":"299_CR60","doi-asserted-by":"crossref","unstructured":"Myerson RB (2013) Game theory. Harvard University Press, Cambridge","DOI":"10.2307\/j.ctvjsf522"},{"key":"299_CR61","doi-asserted-by":"crossref","unstructured":"Nojoumian M, Stinson DR (2010) Brief announcement: secret sharing based on the social behaviors of players. In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on principles of distributed computing, pp 239\u2013240. ACM","DOI":"10.1145\/1835698.1835754"},{"key":"299_CR62","doi-asserted-by":"crossref","unstructured":"Nojoumian M, Stinson DR (2012) Socio-rational secret sharing as a new direction in rational cryptography. In: Decision and game theory for security, pp 18\u201337. Springer","DOI":"10.1007\/978-3-642-34266-0_2"},{"issue":"4","key":"299_CR63","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1049\/iet-ifs.2009.0098","volume":"4","author":"M Nojoumian","year":"2010","unstructured":"Nojoumian M, Stinson DR, Grainger M (2010) Unconditionally secure social secret sharing scheme. IET Inform Secur 4(4):202\u2013211","journal-title":"IET Inform Secur"},{"issue":"2","key":"299_CR64","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.camwa.2010.02.028","volume":"60","author":"MR Ogiela","year":"2010","unstructured":"Ogiela MR, Ogiela U (2010) The use of mathematical linguistic methods in creating secret sharing threshold algorithms. Comput Math Appl 60(2):267\u2013271","journal-title":"Comput Math Appl"},{"issue":"2","key":"299_CR65","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.camwa.2011.10.038","volume":"63","author":"MR Ogiela","year":"2012","unstructured":"Ogiela MR, Ogiela U (2012) Linguistic protocols for secure information management and sharing. Comput Math Appl 63(2):564\u2013572","journal-title":"Comput Math Appl"},{"key":"299_CR66","doi-asserted-by":"crossref","unstructured":"Ong SJ, Parkes DC, Rosen A, Vadhan S (2009) Fairness with an honest minority and a rational majority. In: Theory of cryptography, pp 36\u201353. Springer","DOI":"10.1007\/978-3-642-00457-5_3"},{"key":"299_CR68","unstructured":"Osborne MJ, Rubinstein A (1994) A course in game theory. MIT press, Cambridge"},{"key":"299_CR67","volume-title":"A course in game theory","author":"M Osborne","year":"2004","unstructured":"Osborne M, Rubinstein A (2004) A course in game theory. MIT Press, Cambridge"},{"key":"299_CR69","doi-asserted-by":"crossref","unstructured":"Pass R, Halpern J (2010) Game theory with costly computation: formulation and application to protocol security. In: Proceedings of the behavioral and quantitative game theory: conference on future directions, p 89. ACM","DOI":"10.1145\/1807406.1807495"},{"key":"299_CR70","unstructured":"Russell S, Norvig P, A. Intelligence (1995) A modern approach. Artificial Intelligence. Prentice-Hall, Egnlewood Cliffs, p 25"},{"key":"299_CR71","doi-asserted-by":"crossref","unstructured":"Serbanescu VN, Pop F, Cristea V, Achim OM (2012) Web services allocation guided by reputation in distributed soa-based environments. In: ISPDC 2012, pp 127\u2013134. IEEE","DOI":"10.1109\/ISPDC.2012.25"},{"issue":"11","key":"299_CR72","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"issue":"1","key":"299_CR73","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2005.05.009","volume":"343","author":"Y Shoham","year":"2005","unstructured":"Shoham Y, Tennenholtz M (2005) Non-cooperative computation: Boolean functions with correctness and exclusivity. Theor Comput Sci 343(1):97\u2013113","journal-title":"Theor Comput Sci"},{"issue":"5","key":"299_CR74","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/s11859-011-0775-2","volume":"16","author":"Y Tian","year":"2011","unstructured":"Tian Y, Ma J, Peng C, Chen X, Ji W (2011a) One-time rational secret sharing scheme based on bayesian game. Wuhan Univ\\ J Nat Sci 16(5):430\u2013434","journal-title":"Wuhan Univ\\ J Nat Sci"},{"key":"299_CR75","unstructured":"Tian Y, Ma J, Peng C, Ji W (2011b) Game-theoretic analysis for the secret sharing scheme. Dianzi Xuebao (Acta Electronica Sinica) 39(12):2790\u20132795"},{"issue":"2","key":"299_CR76","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s00199-003-0378-z","volume":"23","author":"A Urbano","year":"2004","unstructured":"Urbano A, Vila JE (2004) Computationally restricted unmediated talk under incomplete information. Econ Theory 23(2):283\u2013320","journal-title":"Econ Theory"},{"key":"299_CR77","doi-asserted-by":"crossref","unstructured":"Visan A, Pop F, Cristea V (2011) Decentralized trust management in peer-to-peer systems. In: ISPDC 2011, pp 232\u2013239. IEEE","DOI":"10.1109\/ISPDC.2011.41"},{"key":"299_CR78","doi-asserted-by":"crossref","unstructured":"Wallrabenstein JR, Clifton C (2013) Equilibrium concepts for rational multiparty computation. In: Decision and game theory for security, pp 226\u2013245. Springer","DOI":"10.1007\/978-3-319-02786-9_14"},{"issue":"5","key":"299_CR79","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1002\/cpe.3057","volume":"26","author":"Y Wang","year":"2014","unstructured":"Wang Y, Liu Z, Wang H, Xu Q (2014) Social rational secure multi-party computation. Concur Comput Pract Exp 26(5):1067\u20131083","journal-title":"Concur Comput Pract Exp"},{"issue":"2","key":"299_CR80","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1002\/sec.979","volume":"8","author":"Y Wang","year":"2015","unstructured":"Wang Y, Wong DS, Zhao C, Xu Q (2015) Fair two-party computation with rational parties holding private types. Secur Commun Netw 8(2):284\u2013297","journal-title":"Secur Commun Netw"},{"key":"299_CR81","unstructured":"William K, Moses JR, Rangan CP (2011) Rational secret sharing over an asynchronous broadcast channel with information theoretic security. arXiv preprint arXiv:1112.4033"},{"key":"299_CR82","doi-asserted-by":"crossref","unstructured":"Xu B, Peng Z, Xiao F, Gates AM, Yu JP (2014) Dynamic deployment of virtual machines in cloud computing using multi-objective optimization. Soft Comput 1\u20139. doi: 10.1007\/s00500-014-1406-6","DOI":"10.1007\/s00500-014-1406-6"},{"key":"299_CR83","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: 2013 IEEE 54th annual symposium on foundations of computer science, pp 160\u2013164. IEEE","DOI":"10.1109\/SFCS.1982.38"},{"issue":"4","key":"299_CR84","first-page":"18","volume":"7","author":"E Zhang","year":"2010","unstructured":"Zhang E, Cai Y (2010) A new rational secret sharing. China Commun 7(4):18\u201322","journal-title":"China Commun"},{"issue":"5","key":"299_CR85","first-page":"1050","volume":"40","author":"E Zhang","year":"2012","unstructured":"Zhang E, Cai Y (2012) A verifiable rational secret sharing scheme based on bilinear pairing [j]. Acta Electronica Sinica 40(5):1050\u20131054","journal-title":"Acta Electronica Sinica"},{"key":"299_CR86","doi-asserted-by":"crossref","unstructured":"Zhang Z, Liu M (2011) Unconditionally secure rational secret sharing in standard communication networks. In: Information security and cryptology-ICISC 2010, pp 355\u2013369. Springer","DOI":"10.1007\/978-3-642-24209-0_24"},{"issue":"3","key":"299_CR87","first-page":"1","volume":"56","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Liu M (2013) Rational secret sharing as extensive games. Sci China Inform Sci 56(3):1\u201313","journal-title":"Sci China Inform Sci"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-015-0299-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-015-0299-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-015-0299-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T11:58:44Z","timestamp":1589543924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-015-0299-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,3]]},"references-count":87,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["299"],"URL":"https:\/\/doi.org\/10.1007\/s12652-015-0299-2","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,3]]}}}