{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:35:47Z","timestamp":1725870947692},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319491745"},{"type":"electronic","value":"9783319491752"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-49175-2_9","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:42Z","timestamp":1478692782000},"page":"177-189","source":"Crossref","is-referenced-by-count":1,"title":["Error-Correcting Codes Against Chosen-Codeword Attacks"],"prefix":"10.1007","author":[{"given":"Kenji","family":"Yasunaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"issue":"7","key":"9_CR1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR2","volume-title":"Concatenated Codes","author":"GD Forney","year":"1966","unstructured":"Forney, G.D.: Concatenated Codes. MIT Press, Cambridge (1966). MIT research monograph, no. 37"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions (extended abstract). In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Heidelberg (1985). doi: 10.1007\/3-540-39568-7_22"},{"issue":"4","key":"9_CR4","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Smith, A.: Codes for computationally simple channels: explicit constructions with optimal rate. In: FOCS, pp. 723\u2013732. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.74"},{"key":"9_CR6","unstructured":"Guruswami, V., Smith, A.: Optimal-rate code constructions for computationally simple channels. CoRR abs\/1004.4017 (2013). This is an extended version of [5]"},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: Proceedings 45th Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, 17\u201319 October 2004, pp. 325\u2013334. IEEE Computer Society (2004)","DOI":"10.1109\/FOCS.2004.51"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/3-540-57785-8_183","volume-title":"STACS 94","author":"RJ Lipton","year":"1994","unstructured":"Lipton, R.J.: A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 699\u2013708. Springer, Heidelberg (1994). doi: 10.1007\/3-540-57785-8_183"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30576-7_1","volume-title":"Theory of Cryptography","author":"S Micali","year":"2005","unstructured":"Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction against computationally bounded noise. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 1\u201316. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30576-7_1"},{"issue":"11","key":"9_CR11","doi-asserted-by":"crossref","first-page":"5673","DOI":"10.1109\/TIT.2010.2070370","volume":"56","author":"S Micali","year":"2010","unstructured":"Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction for computationally bounded noise. IEEE Trans. Inf. Theory 56(11), 5673\u20135680 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M Sudan","year":"1997","unstructured":"Sudan, M.: Decoding of reed solomon codes beyond the error-correction bound. J. Complex. 13(1), 180\u2013193 (1997)","journal-title":"J. Complex."}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49175-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:10:36Z","timestamp":1498360236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49175-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491745","9783319491752"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49175-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}