{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T01:10:10Z","timestamp":1746148210538,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544286"},{"type":"electronic","value":"9783642544293"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54429-3_11","type":"book-chapter","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T09:33:06Z","timestamp":1394184786000},"page":"164-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes"],"prefix":"10.1007","author":[{"given":"J\u00fcrg","family":"Wullschleger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and a lower bound for 1-way quantum automata. In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing (STOC \u201999). ACM (1999)","DOI":"10.1145\/301250.301347"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201908) (2008)","DOI":"10.1109\/FOCS.2008.45"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"De, A., Vidick, T.: Near-optimal extractors against quantum storage. In: Proceedings of the Fourty-Second Annual ACM Symposium on Theory of Computing (STOC \u201910). ACM (2010)","DOI":"10.1145\/1806689.1806713"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Impagliazzo, I., Jaiswal, R., Kabanets, V.: Approximately list-decoding direct product codes and uniform hardness amplification. In: Proceedings of the 42th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201906), pp. 187\u2013196 (2006)","DOI":"10.1109\/FOCS.2006.13"},{"key":"11_CR5","unstructured":"K\u00f6nig, R., Renner, R.: Sampling of min-entropy relative to quantum knowledge. arXiv:0712.4291 (2007)"},{"issue":"9","key":"11_CR6","doi-asserted-by":"publisher","first-page":"4337","DOI":"10.1109\/TIT.2009.2025545","volume":"55","author":"R K\u00f6nig","year":"2009","unstructured":"K\u00f6nig, R., Renner, R., Schaffner, C.: The operational meaning of min- and max-entropy. IEEE Trans. Inf. Theory 55(9), 4337\u20134347 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/TIT.2007.913245","volume":"54","author":"R K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, R., Terhal, B.M.: The bounded storage model in the presence of a quantum adversary. IEEE Trans. Inf. Theory 54(2), 749\u2013762 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR8","unstructured":"K\u00f6nig, R., Wehner, S., Wullschleger, J.: Unconditional security from noisy quantum storage. arXiv:0906.1030 (2009)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201999), pp. 369\u2013376 (1999)","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"11_CR10","unstructured":"Renner, R.: Security of quantum key distribution. Ph.D thesis, ETH Z\u00fcrich, Switzerland. arXiv:quant-ph\/0512258 (2005)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1007\/s00145-003-0237-x","volume":"17","author":"S Vadhan","year":"2004","unstructured":"Vadhan, S.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptol. 17, 2004 (2004)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54429-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:35:47Z","timestamp":1746146147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-54429-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544286","9783642544293"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54429-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}