{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:41:20Z","timestamp":1766428880058},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_1","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"1-16","source":"Crossref","is-referenced-by-count":31,"title":["Optimal Error Correction Against Computationally Bounded Noise"],"prefix":"10.1007","author":[{"given":"Silvio","family":"Micali","sequence":"first","affiliation":[]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","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\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"1_CR3","unstructured":"Gopalan, P., Lipton, R.J., Ding, Y.Z.: Error correction against computationally bounded adversaries. Manuscript (October 2004)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Guruswami, V.: List decoding with side information. In: 18th IEEE Annual Conference on Computational Complexity, pp. 300\u2013312 (2003)","DOI":"10.1109\/CCC.2003.1214429"},{"key":"1_CR5","unstructured":"Guruswami, V., H\u00e5stad, J., Sudan, M., Zuckerman, D.: Combinatorial bounds for list decoding. In: Proceedings of the 38th Annual Allerton Conference on Communication, Control and Computing (2000)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometric codes. In: IEEE Symposium on Foundations of Computer Science, pp. 28\u201339 (1998)","DOI":"10.1109\/SFCS.1998.743426"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/335305.335327","volume-title":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"V. Guruswami","year":"2000","unstructured":"Guruswami, V., Sudan, M.: List decoding algorithms for certain concatenated codes. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 181\u2013190. ACM Press, New York (2000)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: Proceedings of the forty-fifth annual IEEE Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.51"},{"key":"1_CR9","first-page":"699","volume-title":"Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science","author":"R.J. Lipton","year":"1994","unstructured":"Lipton, R.J.: A new approach to information theory. In: Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pp. 699\u2013708. Springer, Heidelberg (1994)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/100216.100269","volume-title":"Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387\u2013394. ACM Press, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:55Z","timestamp":1620012655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}