{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090961},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T00:00:00Z","timestamp":1191369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00224-007-9052-3","type":"journal-article","created":{"date-parts":[[2007,10,2]],"date-time":"2007-10-02T15:53:41Z","timestamp":1191340421000},"page":"187-221","source":"Crossref","is-referenced-by-count":2,"title":["A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange"],"prefix":"10.1007","volume":"42","author":[{"given":"Koichi","family":"Koizumi","sequence":"first","affiliation":[]},{"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,3]]},"reference":[{"key":"9052_CR1","first-page":"173","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"M.J. Fischer","year":"1991","unstructured":"Fischer, M.J., Paterson, M.S., Rackoff, C.: Secret bit transmission using a random deal of cards. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a02, pp.\u00a0173\u2013181. AMS, Providence (1991)"},{"key":"9052_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-46766-1_10","volume-title":"Proceedings of 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: Proceedings of CRYPTO\u201991. Lecture Notes in Computer Science, vol.\u00a0576, pp.\u00a0141\u2013155. Springer, Berlin (1992)"},{"key":"9052_CR3","first-page":"99","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"M.J. Fischer","year":"1993","unstructured":"Fischer, M.J., Wright, R.N.: An application of game-theoretic techniques to cryptography. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a013, pp.\u00a099\u2013118. AMS, Providence (1993)"},{"key":"9052_CR4","unstructured":"Fischer, M.J., Wright, R.N.: An efficient protocol for unconditionally secure secret key exchange. In: Proceedings of the 4th Annual Symposium on Discrete Algorithms, pp.\u00a0475\u2013483 (1993)"},{"key":"9052_CR5","doi-asserted-by":"crossref","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. Cryptol. 9, 71\u201399 (1996)","journal-title":"J. Cryptol."},{"issue":"2","key":"9052_CR6","first-page":"333","volume":"85-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.\u00a0E 85-D(2), 333\u2013345 (2002)","journal-title":"IEICE Trans. Inf. Syst.\u00a0E"},{"key":"9052_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-68535-9_39","volume-title":"Proceedings of COCOON\u201998","author":"T. Mizuki","year":"1998","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: Eulerian secret key exchange. In: Proceedings of COCOON\u201998. Lecture Notes in Computer Science, vol.\u00a01449, pp.\u00a0349\u2013360. Springer, Berlin (1998)"},{"key":"9052_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-48910-X_27","volume-title":"Proceedings of 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: Proceedings of EUROCRYPT\u201999. Lecture Notes in Computer Science, vol.\u00a01592, pp.\u00a0389\u2013401. Springer, Berlin (1999)"},{"issue":"2","key":"9052_CR9","doi-asserted-by":"crossref","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. Int. J.\u00a0Inf. Secur. 1(2), 131\u2013142 (2002)","journal-title":"Int. J.\u00a0Inf. Secur."},{"key":"9052_CR10","doi-asserted-by":"crossref","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 Appl. Math. 131, 213\u2013236 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9052_CR11","first-page":"662","volume":"83-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. Fundam.\u00a0E 83-A(4), 662\u2013670 (2000)","journal-title":"IEICE Trans. Fundam.\u00a0E"},{"key":"9052_CR12","doi-asserted-by":"crossref","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 7, 327\u2013332 (1983)","journal-title":"Cryptologia"},{"key":"9052_CR13","unstructured":"Wright, R.N.: Achieving perfect secrecy using correlated random variables. Ph.D.\u00a0thesis, Yale University, New Haven, CT (1994)"},{"issue":"5","key":"9052_CR14","first-page":"1110","volume":"84-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. Fundam.\u00a0E 84-A(5), 1110\u20131119 (2001)","journal-title":"IEICE Trans. Fundam.\u00a0E"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9052-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9052-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9052-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9052-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9052"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9052-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,3]]}}}