{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:25Z","timestamp":1725490225316},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_27","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"366-379","source":"Crossref","is-referenced-by-count":3,"title":["High Entropy Random Selection Protocols"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Christandl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolai","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The probabilistic method, 2nd edn. John Wiley & sons, Chichester (2000)","edition":"2"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Buhrman, H., Dodis, Y., R\u00f6hrig, H.: Multiparty Quantum Coin Flipping. In: IEEE Conference on Computational Complexity 2004, pp. 250\u2013259 (2004)","DOI":"10.1109\/CCC.2004.1313848"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/S0097539793246689","volume":"27","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM Journ. on Computing\u00a027(2), 506\u2013544 (1998)","journal-title":"SIAM Journ. on Computing"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11818175_25","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Gradwohl","year":"2006","unstructured":"Gradwohl, R., Vadhan, S., Zuckerman, D.: Random selection with an Adversarial Majority. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1215\/S0012-7094-04-12112-8","volume":"121","author":"G. Mockenhaupt","year":"2004","unstructured":"Mockenhaupt, G., Tao, T.: Restriction and Kakeya phenomena for finite fields. Duke Math. J.\u00a0121, 35\u201374 (2004)","journal-title":"Duke Math. J."},{"key":"27_CR6","unstructured":"Wolff, T.: Recent work connected with the Kakeya problem, in Prospects. In: Rossi, H. (ed.) Mathematics. AMS (1999)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11753728_29","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Muchnik","year":"2006","unstructured":"Muchnik, A., Vereshchagin, N.: Shannon Entropy vs. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 281\u2013291. Springer, Heidelberg (2006)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Sanghvi, S., Vadhan, S.: The Round Complexity of Two-Party Random Selection. In: Proceedings of Thirty-seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, pp. 338\u2013347","DOI":"10.1145\/1060590.1060641"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74208-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T16:58:19Z","timestamp":1548349099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}