{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:02:32Z","timestamp":1769313752288,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"},{"value":"9783540741435","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74143-5_6","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T13:51:33Z","timestamp":1186667493000},"page":"92-110","source":"Crossref","is-referenced-by-count":27,"title":["Cryptography with Constant Input Locality"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. 44th FOCS, pp. 298\u2013307 (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computional Complexity\u00a015(2), 115\u2013162 (2006)","journal-title":"Computional Complexity"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput.\u00a036(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in NC0. In: Proc. 10th Random (2006)","DOI":"10.1007\/11830924_25"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"STOC 1971","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC 1971. Proceedings of the third annual ACM symposium on Theory of computing, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-44683-4_24","volume-title":"Mathematical Foundations of Computer Science 2001","author":"M. Cryan","year":"2001","unstructured":"Cryan, M., Miltersen, P.B.: On pseudorandom generators in NC0. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 272\u2013284. Springer, Heidelberg (2001)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Killian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Proc. of the 26th STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"6_CR9","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090) (2000)"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"6_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"6_CR12","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. of the ACM\u00a033, 792\u2013807 (1986)","journal-title":"J. of the ACM"},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM J. Comput.\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. 21st STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudorandom generation from one-way functions. In: Proc. 21st STOC, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: Proc. 41st FOCS, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y. Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H. Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: Mceliece public key cryptosystems using algebraic-geometric codes. Des. Codes Cryptography\u00a08(3), 293\u2013307 (1996)","journal-title":"Des. Codes Cryptography"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N. Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM\u00a040(3), 607\u2013620 (1993)","journal-title":"J. ACM"},{"key":"6_CR21","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical Report DSN PR 42-44, Jet Prop. Lab (1978)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On \u03b5-biased generators in NC0. In: Proc. 44th FOCS, pp. 136\u2013145 (2003)","DOI":"10.1109\/SFCS.2003.1238188"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. of Computer and Systems Sciences\u00a058(2), 336\u2013375 (1999)","journal-title":"J. of Computer and Systems Sciences"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. of Computer and Systems Sciences\u00a043, 425\u2013440 (1991)","journal-title":"J. of Computer and Systems Sciences"},{"key":"6_CR25","unstructured":"Sudan, M.: Algorithmic introduction to coding theory - lecture notes (2002), http:\/\/theory.csail.mit.edu\/~madhu\/FT01\/"},{"key":"6_CR26","first-page":"739","volume":"117","author":"R. Varshamov","year":"1957","unstructured":"Varshamov, R.: Estimate of the number of signals in error correcting codes. Doklady Akademii Nauk SSSR\u00a0117, 739\u2013741 (1957)","journal-title":"Doklady Akademii Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:40:57Z","timestamp":1737355257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540741428","9783540741435"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}