{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:30:27Z","timestamp":1733290227899,"version":"3.30.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s1389-1286(01)00264-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:00:31Z","timestamp":1034276431000},"page":"247-255","source":"Crossref","is-referenced-by-count":7,"title":["Mental poker game based on a bit commitment scheme through network"],"prefix":"10.1016","volume":"38","author":[{"given":"Jue-Sam","family":"Chou","sequence":"first","affiliation":[]},{"given":"Yi-Shiung","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1995","series-title":"Cryptography\u2014Theory and Practice","author":"Stinson","key":"10.1016\/S1389-1286(01)00264-X_BIB1"},{"year":"1996","series-title":"Public-Key Cryptography","author":"Salomaa","key":"10.1016\/S1389-1286(01)00264-X_BIB2"},{"year":"1999","series-title":"Cryptography and Network Security, Principles and Practice","author":"Stallings","key":"10.1016\/S1389-1286(01)00264-X_BIB3"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB4","unstructured":"R. Lipton, How to cheat at mental poker, Proceedings of the AMS Short Course in Cryptography, 1981"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB5","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, ACM-SIGACT, May 1982, pp. 365\u2013377","DOI":"10.1145\/800070.802212"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/S0019-9958(83)80030-8","article-title":"Mental poker with three or more players","volume":"59","author":"Banary","year":"1983","journal-title":"Informat. Cont."},{"key":"10.1016\/S1389-1286(01)00264-X_BIB7","doi-asserted-by":"crossref","unstructured":"S. Fortune, M. Merrit, Poker protocols, in: G.R. Blakley, D. Chaum (Eds.), Advances in Cryptology: Proc. CRYPTO84, Lecture Notes in Computer Science, vol. 196, Springer, Berlin, 1985, pp. 454\u2013464","DOI":"10.1007\/3-540-39568-7_36"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB8","doi-asserted-by":"crossref","unstructured":"M. Yung, Cryptoprotocols: subscription to a public key, the secret blocking and the multi-player mental poker game, in: G.R. Blakley, D. Chaum (Eds.), Advances in Cryptology: Proc. CRYPTO84, Lecture Notes in Computer Science, vol. 196, Springer, Berlin, 1985, pp. 439\u2013453","DOI":"10.1007\/3-540-39568-7_35"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB9","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, A secure poker protocol that minimizes the effect of player coalitions, in: H.C. Williams (Ed.), Advances in Cryptology: Proc. CRYPTO85, Lecture Notes in Computer Science, vol. 218, Springer, Berlin, 1986, pp. 73\u201386","DOI":"10.1007\/3-540-39799-X_8"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB10","unstructured":"C. Cr\u00e9peau, A zero-knowledge poker protocol that achieves confidentiality of the players' strategy, or how to achieve an electronic poker face, in: A. Odlyzko (Ed.), Theses in Advances in Cryptology: Proc. CRYPTO86, Springer, Berlin, 1987"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB11","doi-asserted-by":"crossref","unstructured":"K. Kurosawa et al., General public key residue cryptosystems and mental poker protocols, Advances in Cryptology: Proc. EUROCRPT'90, Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, 21\u201324 May 1990, Proceedings, Lecture Notes in Computer Science, vol. 473, Springer, Berlin, 1991","DOI":"10.1007\/3-540-46877-3_34"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB12","unstructured":"A. Shamir, R. Rivest, L. Adleman, Mental poker, MIT Technical Report, 1978"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB13","unstructured":"K. Kurosawa, Y. Katayama, W. Ogata, Reshuffleable and laziness tolerant mental poker game, IEICE Trans. Fundamentals E80-A (1) (1997) 72\u201378"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB14","doi-asserted-by":"crossref","unstructured":"C. Hall, B. Schneier, Remote electronic gambling, Computer Security Applications Conference, Proceedings, 13th Annual, 1997, pp. 232\u2013238","DOI":"10.1109\/CSAC.1997.646195"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB15","unstructured":"W. Zhao, V. Vijay, Y. Mu, Fair on-line gambling, Computer Security Applications, ACSAC'00, 16th Annual Conference, 2000, pp. 394\u2013400"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB16","doi-asserted-by":"crossref","unstructured":"H. Tanaka, Simply implemented identity-based non-interactive key sharing, Information Theory, 1995. IEEE International Symposium on 17\u201322 September 1995, p. 357","DOI":"10.1109\/ISIT.1995.550344"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB17","doi-asserted-by":"crossref","unstructured":"H. Tanaka, Security certified identity-based non-interactive key sharing, Information Theory, 1994. Proceedings, 1994 IEEE International Symposium on 27 June\u20131 July 1994, p. 495","DOI":"10.1109\/ISIT.1994.395110"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB18","doi-asserted-by":"crossref","unstructured":"S. Park, Y. Kim, S. Lee, K. Kim, Attacks on Tanaka's non-interactive key sharing scheme, Information Theory, 1995. Proceedings, 1995 IEEE International Symposium on 17\u201322 September 1995, p. 356","DOI":"10.1109\/ISIT.1995.550343"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB19","doi-asserted-by":"crossref","unstructured":"S.H. Low, N.F. Maxemchuk, Collusion analysis of cryptographic protocols, IEEE Global Telecommunications Conference, vol. 1, 18\u201322 November 1996, pp. 1\u20135","DOI":"10.1109\/GLOCOM.1996.594324"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB20","doi-asserted-by":"crossref","unstructured":"S.H. Low, N.F. Maxemchuk, An algorithm to compute collusion paths, IEEE INFOCOM, vol. 2, 7\u201312 April 1997, pp. 745\u2013751","DOI":"10.1109\/INFCOM.1997.644529"},{"key":"10.1016\/S1389-1286(01)00264-X_BIB21","doi-asserted-by":"crossref","unstructured":"G. Ateniese, M. Steiner, G. Tsudik, New multiparty authentication services and key agreement protocols, IEEE J. Sel. Areas Commun. 18 (4) (2000) 628\u2013638","DOI":"10.1109\/49.839937"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860100264X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860100264X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:51:53Z","timestamp":1733273513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138912860100264X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S138912860100264X"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(01)00264-x","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}