{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:05:15Z","timestamp":1743059115604,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:24Z","timestamp":1330275564000},"page":"38-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Communication complexity of key agreement on small ranges"],"prefix":"10.1007","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Longpr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth W.","family":"Regan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Sivakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","volume":"39","author":"R. Ahlswede","year":"1993","unstructured":"R. Ahlswede and I. Csisz\u00e0r. Common randomness in information theory and cryptography-part I: Secret sharing. IEEE Trans. Info. Thy., 39:1121\u20131132, 1993.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR2","unstructured":"N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992. With an appendix by P. Erd\u00f6s."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. 25th STOC, pages 91\u2013100, 1993.","DOI":"10.1145\/167088.167119"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"S. Chari, P. Rohatgi, and A. Srinivasan. Randomness-optimal unique element isolation, with applications to perfect matching and related problems. In Proc. 25th STOC, pages 458\u2013467, 1993.","DOI":"10.1145\/167088.167213"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, M. Herlihy, N. Lynch, and M. Tuttle. A tight lower bound for k-set agreement. In Proc. 34th FOCS, pages 206\u2013215, 1993.","DOI":"10.1109\/SFCS.1993.366866"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"A. Goldberg and M. Sipser. Compression and ranking. SIAM J. Comput., 20, 1991.","DOI":"10.1137\/0220034"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, R. Ostrovsky, and E. Petrank. Computational complexity and knowledge complexity. In Proc. 26th STOC, pages 534\u2013543, 1994.","DOI":"10.1145\/195058.195406"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18:186\u2013208, 1989.","journal-title":"SIAM J. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM J. Comput., 17:309\u2013335, 1988.","journal-title":"SIAM J. Comput."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proc. 25th STOC, pages 111\u2013120, 1993.","DOI":"10.1145\/167088.167125"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proc. 26th STOC, pages 243\u2013252, 1994.","DOI":"10.1145\/195058.195144"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18:1149\u20131178, 1989.","journal-title":"SIAM J. Comput."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. Jerrum","year":"1986","unstructured":"M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comp. Sci., 43:169\u2013188, 1986.","journal-title":"Theor. Comp. Sci."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"R. Karp and M. Luby. Monte-Carlo algorithms for enumeration and reliability problems. In Proc. 24th FOCS, pages 56\u201364, 1983.","DOI":"10.1109\/SFCS.1983.35"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proc. 25th STOC, pages 392\u2013401, 1993.","DOI":"10.1145\/167088.167200"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie. On the learnability of discrete distributions. In Proc. 26th STOC, pages 273\u2013282, 1994.","DOI":"10.1145\/195058.195155"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"U. Maurer. Perfect cryptographic security from partially independent channels. In Proc. 23rd STOC, pages 561\u2013572, 1991.","DOI":"10.1145\/103418.103476"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. Maurer","year":"1993","unstructured":"U. Maurer. Secret key agreement by public discussion from common information. IEEE Trans. Info. Thy., 39:733\u2013742, 1993.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105\u2013113, 1987.","journal-title":"Combinatorica"},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1109\/18.259644","volume":"39","author":"M. Naor","year":"1993","unstructured":"M. Naor, A. Orlitsky, and P. Shor. Three results on interactive communication. IEEE Trans. Info. Thy., 39:1608\u20131615, 1993.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/18.57210","volume":"36","author":"A. Orlitsky","year":"1990","unstructured":"A. Orlitsky. Worst-case interactive communication I: Two messages are almost optimal. IEEE Trans. Info. Thy., 36:1111\u20131126, 1990.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/18.86993","volume":"37","author":"A. Orlitsky","year":"1991","unstructured":"A. Orlitsky. Worst-case interactive communication II: Two messages are not optimal. IEEE Trans. Info. Thy., 37:995\u20131005, 1991.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1109\/18.149503","volume":"38","author":"A. Orlitsky","year":"1992","unstructured":"A. Orlitsky. Average-case interactive communication. IEEE Trans. Info. Thy., 38:1534\u20131547, 1992.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/18.50368","volume":"36","author":"A. Orlitsky","year":"1990","unstructured":"A. Orlitsky and A. El Gamal. Average and randomized communication complexity. IEEE Trans. Info. Thy., 36:3\u201316, 1990.","journal-title":"IEEE Trans. Info. Thy."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proc. 25th STOC, pages 101\u2013110, 1993.","DOI":"10.1145\/167088.167122"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0219019","volume":"19","author":"L. Sanchis","year":"1990","unstructured":"L. Sanchis and M. Fulk. On the efficient generation of language instances. SIAM J. Comput., 19:281\u2013296, 1990.","journal-title":"SIAM J. Comput."},{"key":"4_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","volume":"48","author":"A. Selman","year":"1994","unstructured":"A. Selman. A taxonomy of complexity classes of functions. J. Comp. Sys. Sci., 48:357\u2013381, 1994.","journal-title":"J. Comp. Sys. Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:42:00Z","timestamp":1742596920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_60"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}