{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:54:09Z","timestamp":1781078049647,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68397-8_4","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"109-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust Additive Randomized Encodings from\u00a0IO and\u00a0Pseudo-Non-linear Codes"],"prefix":"10.1007","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sapir","family":"Freizeit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 601\u2013610. STOC \u201901, Association for Computing Machinery, New York, NY, USA (2001). https:\/\/doi.org\/10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. SIAM J. Comput. 50(1), 68\u201397 (2021). https:\/\/doi.org\/10.1137\/19M1272044","DOI":"10.1137\/19M1272044"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05677, pp. 595\u2013618. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$\\text{nc}^{0}$$. SIAM J. Comput. 36(4), 845\u2013888 (2006). https:\/\/doi.org\/10.1137\/S0097539705446950","DOI":"10.1137\/S0097539705446950"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology - EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology - EUROCRYPT 2012, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Barak, B.: On the (IM)possibility of obfuscating programs. In: CRYPTO, pp. 1\u201318 (2001)","DOI":"10.1007\/3-540-44647-8_1"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II. Lecture Notes in Computer Science, vol.\u00a08617, pp. 387\u2013404. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_22","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1-10. STOC \u201988, Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"4_CR9","unstructured":"Bitansky, N., Freizeit, S.: Robust additive randomized encodings from IO and pseudo-non-linear codes. Cryptology ePrint Archive, Paper 2024\/249 (2024). https:\/\/eprint.iacr.org\/2024\/249"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Paneth, O.: Zaps and non-interactive witness indistinguishability from indistinguishability obfuscation. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol.\u00a09015, pp. 401\u2013427. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_16","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision diffie-hellman. In: Wagner, D.A. (ed.) Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings. Lecture Notes in Computer Science, vol.\u00a05157, pp. 108\u2013125. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_7","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 575\u2013584. STOC \u201913, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 11\u201319. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. STOC \u201987, Association for Computing Machinery, New York, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Goyal, V., Maji, H.K.: Stateless cryptographic protocols. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pp. 678\u2013687. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.74","DOI":"10.1109\/FOCS.2011.74"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Goyal, V., Sahai, A.: Resettably secure computation. In: Joux, A. (ed.) Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05479, pp. 54\u201371. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_3","DOI":"10.1007\/978-3-642-01001-9_3"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A., Yogev, E.: Non-interactive multiparty computation without correlated randomness. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part III. Lecture Notes in Computer Science, vol. 10626, pp. 181\u2013211. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_7","DOI":"10.1007\/978-3-319-70700-6_7"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Additive randomized encodings and their applications. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14081, pp. 203\u2013235. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_7","DOI":"10.1007\/978-3-031-38557-5_7"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 239\u2013248. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.25","DOI":"10.1109\/FOCS.2006.25"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pp. 60\u201373. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Long, D.L., Wigderson, A.: The discrete logarithm hides o(log n) bits. SIAM J. Comput. 17(2), 363\u2013372 (1988). https:\/\/doi.org\/10.1137\/0217021","DOI":"10.1137\/0217021"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 351\u2013358. STOC \u201910, Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1806689.1806739","DOI":"10.1145\/1806689.1806739"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Ortiz, H. (ed.) Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pp. 427\u2013437. ACM (1990). https:\/\/doi.org\/10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 333\u2013342. STOC \u201909, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536461","DOI":"10.1145\/1536414.1536461"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, 17-18 October, 1999, New York, NY, USA, pp. 543\u2013553. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"4_CR28","unstructured":"Schnorr, C.: Security of allmost ALL discrete log bits. Electron. Colloquium Comput. Complex. TR98-033 (1998). https:\/\/eccc.weizmann.ac.il\/eccc-reports\/1998\/TR98-033\/index.html"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:52Z","timestamp":1723759312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}