{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:59:56Z","timestamp":1742932796986,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117985"},{"type":"electronic","value":"9783642117992"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-11799-2_3","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T08:55:48Z","timestamp":1265100948000},"page":"37-51","source":"Crossref","is-referenced-by-count":9,"title":["Almost Optimal Bounds for Direct Product Threshold Theorem"],"prefix":"10.1007","author":[{"given":"Charanjit S.","family":"Jutla","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley and Sons, Chichester (1992)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness Amplification of Weakly-Verifiable Puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Parallel Repetition: Simplifications and the No-Signalling Case. In: Proc. ACM STOC (2007)","DOI":"10.1145\/1250790.1250852"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-008-9029-7","volume":"22","author":"R. Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-Type Direct Product Theorem. J. Cryptology\u00a022, 75\u201393 (2009)","journal-title":"J. Cryptology"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Uniform direct-product theorems: Simplified, optimized, and de-randomized. In: Proc. ACM STOC (2008)","DOI":"10.1145\/1374376.1374460"},{"key":"3_CR6","volume-title":"Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: Art of Computer Programming, vol.\u00a01. Addison Wesley, Reading (1973)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Raz, R.: A Parallel Repetition Theorem. SIAM J. of Computing\u00a027(3), 763\u2013803","DOI":"10.1137\/S0097539795280895"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-39200-9_18","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"L. Ahn von","year":"2003","unstructured":"von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: Using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 294\u2013311. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11799-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:16:39Z","timestamp":1552356999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11799-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117985","9783642117992"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11799-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}