{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:53:33Z","timestamp":1725425613176},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/incos.2013.55","type":"proceedings-article","created":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T22:01:08Z","timestamp":1387317668000},"page":"309-314","source":"Crossref","is-referenced-by-count":0,"title":["Fair Computation with Tit-for-Tat Strategy"],"prefix":"10.1109","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63520"},{"key":"17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","article-title":"Timed commitments","author":"boneh","year":"2000","journal-title":"Proc CRYPTO 2000"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.25"},{"journal-title":"Game Theory","year":"1991","author":"fudenberg","key":"33"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.50372"},{"key":"16","first-page":"175","article-title":"How to exchange (secret) keys","author":"blum","year":"1984","journal-title":"ACM Transactions on Computer Systems"},{"key":"13","first-page":"573","article-title":"Controlled gradual disclosure schemes for random bits and their applications","author":"cleve","year":"1989","journal-title":"Advances in Cryptology-Crypto'89"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"11","first-page":"543","article-title":"Collusion-free protocols","author":"lepinski","year":"2005","journal-title":"37th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374436"},{"key":"21","first-page":"404","article-title":"Resource fairness and composability of cryptographic protocols","author":"garay","year":"1987","journal-title":"3rd Theory of Cryptography Conference-TCC 2006"},{"key":"20","first-page":"135","article-title":"Cryptographic computation: Secure faut-tolerant protocols and the public-key model","author":"galil","year":"1987","journal-title":"Advances in Cryptology-Crypto '87"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","article-title":"Fair secure two-party computation","author":"pinkas","year":"2003","journal-title":"Proc Eurocrypt 2003"},{"key":"24","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/11818175_11","article-title":"Rationality and adversarial behavior in multi-party computation","author":"lysyanskaya","year":"2006","journal-title":"Dwork C (Ed ) CRYPTO 2006"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_7"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_8"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250793"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011769"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374437"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2012.045697"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007447"},{"journal-title":"The Evolution of Cooperation","year":"1990","author":"axelrod","key":"31"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.009"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.64"},{"key":"8","first-page":"229","article-title":"Rational secret sharing, revisited","author":"gordon","year":"2006","journal-title":"SCN 2006"}],"event":{"name":"2013 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","start":{"date-parts":[[2013,9,9]]},"location":"Xi'an city, Shaanxi province, China","end":{"date-parts":[[2013,9,11]]}},"container-title":["2013 5th International Conference on Intelligent Networking and Collaborative Systems"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/6630246\/6630249\/06630428.pdf?arnumber=6630428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T04:26:02Z","timestamp":1498105562000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/6630428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":33,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/incos.2013.55","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}