{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:17Z","timestamp":1725564977019},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_12","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:28Z","timestamp":1283713288000},"page":"92-101","source":"Crossref","is-referenced-by-count":2,"title":["Necessary and Sufficient Numbers of Cards for the Transformation Protocol"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Koizumi","sequence":"first","affiliation":[]},{"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"173","volume-title":"Secret bit transmission using a random deal of cards","author":"M.J. Fischer","year":"1991","unstructured":"Fischer, M.J., Paterson, M.S., Rackoff, C.: Secret bit transmission using a random deal of cards. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a02, pp. 173\u2013181. AMS, Providence (1991)"},{"key":"12_CR2","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"99","volume-title":"An application of game-theoretic techniques to cryptography","year":"1993","unstructured":"Fischer, M.J., Wright, R.N. (eds.): An application of game-theoretic techniques to cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a013, pp. 99\u2013118. AMS, Providence (1993)"},{"key":"12_CR3","unstructured":"Fischer, M.J., Wright, R.N.: An efficient protocol for unconditionally secure secret key exchange. In: Proc. the 4th Annual Symposium on Discrete Algorithms, pp. 475\u2013483 (1993)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"M.J. Fischer","year":"1996","unstructured":"Fischer, M.J., Wright, R.N.: Bounds on secret key exchange using a random deal of cards. J. Cryptology\u00a09, 71\u201399 (1996)","journal-title":"J. Cryptology"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-46766-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"M.J. Fischer","year":"1992","unstructured":"Fischer, M.J., Wright, R.N.: Multiparty secret key exchange using a random deal of cards. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 141\u2013155. Springer, Heidelberg (1992)"},{"issue":"2","key":"12_CR6","first-page":"333","volume":"E85-D","author":"T. Mizuki","year":"2002","unstructured":"Mizuki, T., Nishizeki, T.: Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups. IEICE Trans. Inf. & Syst.\u00a0E85-D(2), 333\u2013345 (2002)","journal-title":"IEICE Trans. Inf. & Syst."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s102070100011","volume":"1","author":"T. Mizuki","year":"2002","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: A complete characterization of a family of key exchange protocols. International Journal of Information Security\u00a01(2), 131\u2013142 (2002)","journal-title":"International Journal of Information Security"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0166-218X(02)00426-2","volume":"131","author":"T. Mizuki","year":"2003","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: Characterization of optimal key set protocols. Discrete Applied Mathematics\u00a0131, 213\u2013236 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-48910-X_27","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"T. Mizuki","year":"1999","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 389\u2013401. Springer, Heidelberg (1999)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-68535-9_39","volume-title":"Computing and Combinatorics","author":"T. Mizuki","year":"1998","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: Eulerian secret key exchange. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol.\u00a01449, pp. 349\u2013360. Springer, Heidelberg (1998)"},{"issue":"4","key":"12_CR11","first-page":"662","volume":"E83-A","author":"T. Mizuki","year":"2000","unstructured":"Mizuki, T., Sui, Z., Shizuya, H., Nishizeki, T.: On the average length of secret key exchange Eulerian circuits. IEICE Trans. Fundamentals\u00a0E83-A(4), 662\u2013670 (2000)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"5","key":"12_CR12","first-page":"1110","volume":"E84-A","author":"R. Yoshikawa","year":"2001","unstructured":"Yoshikawa, R., Guo, S., Motegi, K., Igarashi, Y.: Construction of secret key exchange spanning trees by random deals of cards on hierarchical structures. IEICE Trans. Fundamentals\u00a0E84-A(5), 1110\u20131119 (2001)","journal-title":"IEICE Trans. Fundamentals"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1080\/0161-118391858053","volume":"7","author":"P. Winkler","year":"1983","unstructured":"Winkler, P.: The advent of cryptology in the game of bridge. CRYPTOLOGIA\u00a07, 327\u2013332 (1983)","journal-title":"CRYPTOLOGIA"},{"key":"12_CR14","unstructured":"Wright, R.N.: Achieving Perfect Secrecy Using Correlated Random Variables. PhD Thesis, Yale University (1994)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:28Z","timestamp":1619997988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}