{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:27Z","timestamp":1740107847905,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T00:00:00Z","timestamp":1450051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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"}]},{"name":"Outstanding Young Scientists Foundation Grant of Shandong Province","award":["BS2014DX016"],"award-info":[{"award-number":["BS2014DX016"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572294"],"award-info":[{"award-number":["61572294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502218"],"award-info":[{"award-number":["61502218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00500-015-1974-0","type":"journal-article","created":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T11:55:19Z","timestamp":1450094119000},"page":"3947-3955","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fairness in secure computing protocols based on incentives"],"prefix":"10.1007","volume":"20","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leisi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-fung","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beijing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,14]]},"reference":[{"key":"1974_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Dolev D, Gonen R, Halpern J (2006) Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty com- putation. In: 25th ACM symposium annual on principles of distributed computing. ACM, New York, NY, USA, pp 53\u201362","DOI":"10.1145\/1146381.1146393"},{"key":"1974_CR2","doi-asserted-by":"crossref","unstructured":"Asharov G, Canetti R, Hazay C (2011) Towards a game theoretic view of secure computation. In: Advances in cryptology\u2014EUROCRYPT 2011. Springer, Berlin, pp 426\u2013445","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"1974_CR3","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y (2007) Security against covert adversaries: efficient protocols for realistic adversaries. In: Theory of cryptography. Springer, Berlin, pp 137\u2013156","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"1974_CR4","volume-title":"The evolution of cooperation","author":"R Axelrod","year":"1990","unstructured":"Axelrod R (1990) The evolution of cooperation. Penguin Press, London"},{"issue":"1","key":"1974_CR5","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"},{"issue":"8","key":"1974_CR6","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. Inf Sci 181(8):1493\u20131502","journal-title":"Inf Sci"},{"issue":"6","key":"1974_CR7","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 (2012) Efficient fair conditional payments for outsourcing computations. IEEE Trans Inf Forensics Secur 7(6):1687\u20131694","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"9","key":"1974_CR8","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2014","unstructured":"Chen X, Li J, Ma J, Tang Q, Lou Wenjing (2014) 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":"1974_CR9","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 snnual symposium on foundations of computer science (FOCS). IEEE, pp 648\u2013657","DOI":"10.1109\/FOCS.2013.75"},{"key":"1974_CR10","doi-asserted-by":"crossref","unstructured":"Groce A, Katz J (2012) Fair computation with rational players. In: EUROCRYPT 2012. Springer, Berlin, pp 81\u201398","DOI":"10.1007\/978-3-642-29011-4_7"},{"issue":"11","key":"1974_CR11","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1108\/01443570710830593","volume":"27","author":"A Gunasekaran","year":"2007","unstructured":"Gunasekaran A, Howard M, Squire B (2007) Modularization and the impact on supply relationships. Int J Oper Prod Manag 27(11):1192\u20131212","journal-title":"Int J Oper Prod Manag"},{"key":"1974_CR12","unstructured":"Halpern J, Pass R (2010) Game theory with costly computation: formulation and application to protocol security. In: ICS 2010. Tsinghua University Press, Beijing, pp 120\u2013142"},{"key":"1974_CR13","doi-asserted-by":"crossref","unstructured":"Halpern J, Teague V (2004) Rational secret sharing and multiparty computation: extended abstract. In: STOC \u201904: proceedings of the thirty-sixth annual ACM symposium on theory of computing. ACM, New York, NY, USA, pp 623\u2013632","DOI":"10.1145\/1007352.1007447"},{"issue":"8","key":"1974_CR14","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"},{"key":"1974_CR15","doi-asserted-by":"crossref","unstructured":"Lysyanskaya A, Triandopoulos N (2006) Rationality and adversarial behavior in multi-party computation. In: Dwork C (ed) CRYPTO 2006. Springer, Heidelberg, pp 180\u2013197","DOI":"10.1007\/11818175_11"},{"issue":"3","key":"1974_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TSE.2006.31","volume":"32","author":"BS Mitchell","year":"2006","unstructured":"Mitchell BS, Mancoridis S (2006) On the automatic modularization of software systems using the bunch tool. IEEE Trans Softw Eng 32(3):193\u2013208","journal-title":"IEEE Trans Softw Eng"},{"key":"1974_CR17","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"},{"issue":"11","key":"1974_CR18","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"},{"key":"1974_CR19","doi-asserted-by":"publisher","unstructured":"Wang M, Ma J (2015) A novel recommendation approach based on users\u2019 weighted trust relations and the rating similarities. Soft Comput 1\u201310. doi: 10.1007\/s00500-015-1734-1","DOI":"10.1007\/s00500-015-1734-1"},{"key":"1974_CR20","doi-asserted-by":"publisher","unstructured":"Wang J, Miao M, Gao Y, Chen X (2015a) Enabling efficient approximate nearest neighbor search for outsourced database in cloud computing. Soft Comput 1\u20139. doi: 10.1007\/s00500-015-1758-6","DOI":"10.1007\/s00500-015-1758-6"},{"issue":"2","key":"1974_CR21","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 (2015b) Fair two-party computation with rational parties holding private types. Secur Commun Netw 8(2):284\u2013297","journal-title":"Secur Commun Netw"},{"key":"1974_CR22","doi-asserted-by":"crossref","unstructured":"Yao A (1982) Protocols for secure computation. In: 23rd annual symposium on foundations of computer science (FOCS), pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"1974_CR23","doi-asserted-by":"crossref","unstructured":"Yao A (1986) How to generate and exchange secrets. In: 27th annual symposium on foundations of computer science (FOCS). IEEE, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1974-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1974-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1974-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1974-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T06:08:39Z","timestamp":1589609319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1974-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,14]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1974"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1974-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,12,14]]}}}