{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:18:12Z","timestamp":1761401892005},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,6,12]],"date-time":"2017-06-12T00:00:00Z","timestamp":1497225600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11432-015-9066-9","type":"journal-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T10:08:17Z","timestamp":1497521297000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reconstruction methodology for rational secret sharing based on mechanism design"],"prefix":"10.1007","volume":"60","author":[{"given":"Hai","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinghua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengfan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,12]]},"reference":[{"key":"9066_CR1","first-page":"623","volume-title":"Rational secret sharing and multiparty computation: extended abstract","author":"J Halpern","year":"2004","unstructured":"Halpern J, Teague V. Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, 2004. 623\u2013632"},{"key":"9066_CR2","volume-title":"A Course in Game Theory","author":"M J Osborn","year":"1994","unstructured":"Osborn M J, Rubinstein A. A Course in Game Theory. Cambridge: MIT Press, 1994"},{"key":"9066_CR3","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM, 1979, 22: 612\u2013613","journal-title":"Commun ACM"},{"key":"9066_CR4","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. Utility dependence in correct and fair rational secret sharing. J Cryptol, 2011, 24: 157\u2013202","journal-title":"J Cryptol"},{"key":"9066_CR5","first-page":"36","volume-title":"Fairness with an honest minority and a rational majority","author":"S J Ong","year":"2009","unstructured":"Ong S J, Parkes D C, Rosen A, et al. Fairness with an honest minority and a rational majority. In: Proceedings of the 6th Theory of Cryptography Conference, San Francisco, 2009. 36\u201353"},{"key":"9066_CR6","first-page":"139","volume-title":"Achieving correctness in fair rational secret sharing","author":"J D Sourya","year":"2013","unstructured":"Sourya J D, Asim K P. Achieving correctness in fair rational secret sharing. In: Proceedings of the 12th International Conference on Cryptology and Network Security, Paraty, 2013. 139\u2013161"},{"key":"9066_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan N, Ronen A. Algorithmic mechanism design. Games Econ Behavior, 2001, 35: 166\u2013196","journal-title":"Games Econ Behavior"},{"key":"9066_CR8","first-page":"419","volume-title":"Efficient secret sharing in the standard communication model","author":"G Fuchsbauer","year":"2010","unstructured":"Fuchsbauer G, Katz J, Naccache D. Efficient secret sharing in the standard communication model. In: Proceedings of the 7th Theory of Cryptography Conference, Zurich, 2010. 419\u2013436"},{"key":"9066_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth C, Bloom J. A modular approach to key safeguarding. IEEE Trans Inf Theory, 1983, 29: 208\u2013210","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-9066-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-9066-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-9066-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T10:08:19Z","timestamp":1497521299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-9066-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,12]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9066"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-9066-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,12]]},"article-number":"088101"}}