{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:08Z","timestamp":1725483728886},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_21","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"273-285","source":"Crossref","is-referenced-by-count":0,"title":["Characterization of Optimal Key Set Protocols"],"prefix":"10.1007","author":[{"given":"Takaaki","family":"Mizuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1006\/jcss.1995.1086","volume":"51","author":"T. Asano","year":"1995","unstructured":"T. Asano, \u201cAn O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees\u201d, J. Comput. and Syst. Sci., vol. 51, pp. 503\u2013510, 1995.","journal-title":"J. Comput. and Syst. Sci."},{"key":"21_CR2","first-page":"173","volume":"2","author":"M. J. Fischer","year":"1991","unstructured":"M. J. Fischer, M. S. Paterson, and C. Rackofi, \u201cSecret bit transmission using a random deal of cards,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, vol. 2, pp. 173\u2013181, 1991.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/013\/06","volume":"13","author":"M. J. Fischer","year":"1993","unstructured":"M. J. Fischer and R. N. Wright, \u201cAn application of game-theoretic techniques to cryptography,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, vol. 13, pp. 99\u2013118, 1993.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS"},{"key":"21_CR4","unstructured":"M. J. Fischer and R. N. Wright, \u201cAn eficient protocol for unconditionally secure secret key exchange,\u201d Proc. of the 4th Annual Symposium on Discrete Algorithms, pp. 475\u2013483, 1993."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"M. J. Fischer","year":"1996","unstructured":"M. J. Fischer and R. N. Wright, \u201cBounds on secret key exchange using a random deal of cards,\u201d J. Cryptology, vol. 9, pp. 71\u201399, 1996.","journal-title":"J. Cryptology"},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-46766-1_10","volume-title":"Crypto\u2019 91","author":"M. J. Fischer","year":"1992","unstructured":"M. J. Fischer and R. N. Wright, \u201cMultiparty secret key exchange using a random deal of cards,\u201d Proc. Crypto\u2019 91, Lecture Notes in Computer Science, Springer-Verlag, vol. 576, pp. 141\u2013155, 1992."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S. L. Hakimi","year":"1962","unstructured":"S. L. Hakimi, \u201cOn realizability of a set of integers as degrees of the vertices of a linear graph. I,\u201d J. SIAM Appl. Math., vol. 10, no. 3, pp. 496\u2013506, 1962.","journal-title":"J. SIAM Appl. Math"},{"key":"21_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, \u201cGraph Theory,\u201d Addison-Wesley, Reading, Mass., 1969."},{"key":"21_CR9","volume-title":"Ph.D. Thesis","author":"T. Mizuki","year":"2000","unstructured":"T. Mizuki, \u201cSharing unconditionally secure secret keys,\u201d Ph.D. Thesis, Tohoku University, Sendai, 2000."},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-48910-X_27","volume-title":"Proc. Eurocrypt\u2019 99","author":"T. Mizuki","year":"1999","unstructured":"T. Mizuki, H. Shizuya, and T. Nishizeki, \u201cDealing necessary and sufficient numbers of cards for sharing a one-bit secret key,\u201d Proc. Eurocrypt\u2019 99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 389\u2013401, 1999."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0132048","volume":"32","author":"E. F. Schmeichel","year":"1977","unstructured":"E. F. Schmeichel and S. L. Hakimi, \u201cOn planar graphical degree sequences,\u201d SIAM J. Appl. Math., vol. 32, no. 3, pp. 598\u2013609, 1977.","journal-title":"SIAM J. Appl. Math"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T09:56:14Z","timestamp":1550310974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}