{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T04:57:27Z","timestamp":1768971447424,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374438","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"433-442","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":114,"title":["Cryptography with constant computational overhead"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[{"name":"Technion and UCLA, Haifa, Israel"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946338"},{"issue":"2","key":"e_1_3_2_1_2_1","article-title":"Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs","volume":"38","author":"Bruck J.","year":"1992","unstructured":". Alon, J. Bruck , J. Naor , M. Naor , and R. M. Roth . Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs . IEEE Transactions on Information Theory 38 ( 2 ) ( 1992 ).]] . Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2) (1992).]]","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446950"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0211-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_25"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777787"},{"key":"e_1_3_2_1_7_1","first-page":"137","volume-title":"Yehuda Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In Proc. TCC","author":"Aumann Y.","year":"2007","unstructured":"Y. Aumann and Yehuda Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In Proc. TCC 2007 , pages 137 -- 156 .]] Y. Aumann and Yehuda Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In Proc. TCC 2007, pages 137--156.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646760.706018"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335355"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Inter-reciprocity applied to electrical networks. Applied Scientific Research B: Electrophysics, Acoustics, Optics","volume":"6","author":"Bordewijk L.","year":"1956","unstructured":". L. Bordewijk . Inter-reciprocity applied to electrical networks. Applied Scientific Research B: Electrophysics, Acoustics, Optics , Mathematical Methods , 6 : 1 -- 74 , 1956 .]] . L. Bordewijk. Inter-reciprocity applied to electrical networks. Applied Scientific Research B: Electrophysics, Acoustics, Optics, Mathematical Methods, 6: 1--74, 1956.]]","journal-title":"Mathematical Methods"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756215"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510003"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645730.668189"},{"key":"e_1_3_2_1_20_1","first-page":"174","volume-title":"Proc. 2nd Internat. Symp. on Information Theory","author":"Dobrushin R. L.","year":"1973","unstructured":"R. L. Dobrushin , S. I. Gelfand , and M. S. Pinsker . On complexity of coding . In Proc. 2nd Internat. Symp. on Information Theory , pages 174 - 184 , 1973 .]] R. L. Dobrushin, S. I. Gelfand, and M. S. Pinsker. On complexity of coding. In Proc. 2nd Internat. Symp. on Information Theory, pages 174-184, 1973.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195408"},{"key":"e_1_3_2_1_24_1","first-page":"1","volume-title":"Efficient Private Matching and Set Intersection. In EUROCRYPT","author":"Freedman M. J.","year":"2004","unstructured":"M. J. Freedman , K. Nissim , and B. Pinkas . Efficient Private Matching and Set Intersection. In EUROCRYPT 2004 , pages 1 - 19 .]] M. J. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004, pages 1-19.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/975541"},{"key":"e_1_3_2_1_27_1","volume-title":"Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090)","author":"Goldreich O.","year":"2000","unstructured":"O. Goldreich . Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090) , 2000 .]] O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090), 2000.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.100"},{"key":"e_1_3_2_1_30_1","first-page":"171","volume-title":"CRYPTO","author":"Goldreich O.","year":"1986","unstructured":"O. Goldreich , S. Micali , and A. Wigderson . How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design . In CRYPTO 1986 , pages 171 - 185 .%]] O. Goldreich, S. Micali, and A. Wigderson.How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In CRYPTO 1986, pages 171-185.%]]"},{"key":"e_1_3_2_1_31_1","first-page":"73","volume-title":"CRYPTO \u201987, LNCS","author":"Goldreich O.","year":"1987","unstructured":"O. Goldreich and R. Vainish . How to solve any protocol problem - an efficiency improvement . In CRYPTO \u201987, LNCS , volume 293 , pages 73 -- 86 . Springer , 1987 .]] O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In CRYPTO \u201987, LNCS, volume 293, pages 73--86. Springer, 1987.]]"},{"key":"e_1_3_2_1_32_1","first-page":"658","volume-title":"Guruswami and P. Indyk. Expander-Based Constructions of Efficiently Decodable Codes. In Proc. FOCS","year":"2001","unstructured":". Guruswami and P. Indyk. Expander-Based Constructions of Efficiently Decodable Codes. In Proc. FOCS 2001 , pages 658 - 667 .]] . Guruswami and P. Indyk. Expander-Based Constructions of Efficiently Decodable Codes. In Proc. FOCS 2001, pages 658-667.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684418"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_32"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100246"},{"key":"e_1_3_2_1_39_1","first-page":"136","volume-title":"Proc. 44th FOCS","author":"Mossel E.","year":"2003","unstructured":"E. Mossel , A. Shpilka , and L. Trevisan . On \u03b5-biased generators in $\\mathrmNC^0$ . In Proc. 44th FOCS , pages 136 -- 145 , 2003 .]] E. Mossel, A. Shpilka, and L. Trevisan. On \u03b5-biased generators in $\\mathrmNC^0$. In Proc. 44th FOCS, pages 136--145, 2003.]]"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73011"},{"key":"e_1_3_2_1_43_1","volume-title":"TR-81","author":"Rabin M.O.","year":"1981","unstructured":"M.O. Rabin . How to exchange secrets by oblivious transfer . TR-81 , Harvard , 1981 .]] M.O. Rabin. How to exchange secrets by oblivious transfer. TR-81, Harvard, 1981.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365734"},{"key":"e_1_3_2_1_45_1","unstructured":"W. D. Smith. 1. AES seems weak. 2. Linear time secure cryptography. Cryplology ePrint report 2007\/248.]]  W. D. Smith. 1. AES seems weak. 2. Linear time secure cryptography. Cryplology ePrint report 2007\/248.]]"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225165"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374438","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:49Z","timestamp":1750255069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":48,"alternative-id":["10.1145\/1374376.1374438","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374438","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}