{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:40:21Z","timestamp":1740336021557,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210009"},{"type":"electronic","value":"9783540246381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24638-1_6","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:15:28Z","timestamp":1280762128000},"page":"101-120","source":"Crossref","is-referenced-by-count":1,"title":["List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y. Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.: Everlasting Security in the Bounded Storage Model. IEEE Transactions on Information Theory\u00a048(6), 1668\u20131680 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-45146-4_18","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"B. Barak","year":"2003","unstructured":"Barak, B., Ong, S.J., Vadhan, S.: Derandomization in Cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 299\u2013315. Springer, Heidelberg (2003)"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. J. Comput. Sys. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Sys. Sci."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. Computing"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: Proc. 41st IEEE Symp. on Foundations of Computer Science, pp. 283\u2013293 (2000)","DOI":"10.1109\/SFCS.2000.892117"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Dwork, C., Stockmeyer, L.: 2-Round Zero Knowledge and Proof Auditors. In: Proc. 34th ACM Symp. on Theory of Computing (2002)","DOI":"10.1145\/509907.509958"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate to any one-way function. In: Proc. 21st ACM Symp. on Theory of Computing (1989)","DOI":"10.1145\/73007.73010"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"6_CR10","unstructured":"Guruswami, V., Sudan, M.: Extensions to the Johnson bound (2001) (manuscript)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1963.1057841","volume":"9","author":"S. Johnson","year":"1963","unstructured":"Johnson, S.: A new upper bound for error-correcting codes. IEEE Transactions on Information Theory\u00a09, 198\u2013205 (1963)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. In: Proc. 44th IEEE Symp. on Foundations of Computer Science (2003)","DOI":"10.1109\/SFCS.2003.1238184"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In: Proc. 31st ACM Symp. on Theory of Computing (1999)","DOI":"10.1145\/301250.301428"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"C. Lu","year":"2002","unstructured":"Lu, C.: Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 257\u2013271. Springer, Heidelberg (2002)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. In: Proc. 22nd ACM Symp. on Theory of Computing (1990)","DOI":"10.1145\/100216.100246"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. J. Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"J. Cryptology"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0024-3795(93)00158-V","volume":"218","author":"R. Meshulam","year":"1995","unstructured":"Meshulam, R.: Spaces of Hankel matrices over finite fields. Linear Algebra Appl.\u00a0218, 73\u201376 (1995)","journal-title":"Linear Algebra Appl."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 71\u201380 (1999)","DOI":"10.1109\/SFFCS.1999.814579"},{"key":"6_CR19","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: de Millo, R., et al. (eds.) Foundations of Secure Computation (1978)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959941"},{"key":"6_CR21","unstructured":"Shpilka, A.: A note on matrix rigidity, manuscript (2002)"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0214060","volume":"14","author":"L. Stockmeyer","year":"1985","unstructured":"Stockmeyer, L.: On approximation algorithms for #P. SIAM J. Computing\u00a014(4), 849\u2013861 (1985)","journal-title":"SIAM J. Computing"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: Proc. 31st ACM Symp. on Theory of Computing (1999)","DOI":"10.1109\/CCC.1999.766253"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L. Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM\u00a048(4), 860\u2013879 (2001)","journal-title":"Journal of the ACM"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Proc. 41st IEEE Symp. on Foundations of Computer Science, pp. 32\u201342 (2001)","DOI":"10.1109\/SFCS.2000.892063"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-45146-4_4","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S. Vadhan","year":"2003","unstructured":"Vadhan, S.: On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 61\u201377. 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-540-24638-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:04:00Z","timestamp":1740333840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24638-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210009","9783540246381"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24638-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}