{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T13:36:52Z","timestamp":1762090612403,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031385568"},{"type":"electronic","value":"9783031385575"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38557-5_7","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"203-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Additive Randomized Encodings and\u00a0Their Applications"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-17656-3_14","volume-title":"Advances in Cryptology","author":"N Agarwal","year":"2019","unstructured":"Agarwal, N., Anand, S., Prabhakaran, M.: Uncovering algebraic structures in the MPC landscape. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 381\u2013406. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_14"},{"key":"7_CR2","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-57048-8_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B.: Garbled circuits as randomized encodings of functions: a primer. In: Tutorials on the Foundations of Cryptography. ISC, pp. 1\u201344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_1"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Brakerski, Z., Garg, S., Ishai, Y., Srinivasan, A.: Separating two-round secure computation from oblivious transfer. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020(January), pp. 12\u201314 (2020). Seattle, Washington, USA. LIPIcs, vol. 151, pp. 71:1\u201371:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.71, https:\/\/eprint.iacr.org\/2020\/116.pdf","DOI":"10.4230\/LIPIcs.ITCS.2020.71"},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, 9\u201311 January 2017, Berkeley, CA, USA. LIPIcs, vol. 67, pp. 7:1\u20137:31. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.7, https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.7","DOI":"10.4230\/LIPIcs.ITCS.2017.7"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Karni, O., Patra, A.: Quadratic multiparty randomized encodings beyond honest majority and their applications. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022\u201342nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, 15\u201318 August 2022, Proceedings, Part IV. LNCS, vol. 13510, pp. 453\u2013482. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_16","DOI":"10.1007\/978-3-031-15985-5_16"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$${}^{\\text{0}}$$. SIAM J. Comput. 36(4), 845\u2013888 (2006). https:\/\/doi.org\/10.1137\/S0097539705446950","DOI":"10.1137\/S0097539705446950"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. SIAM J. Comput. 43(2), 905\u2013929 (2014). https:\/\/doi.org\/10.1137\/120875193","DOI":"10.1137\/120875193"},{"key":"7_CR9","unstructured":"Badrinarayanan, S., Ishai, Y., Khurana, D., Sahai, A., Wichs, D.: Refuting the dream XOR lemma via ideal obfuscation and resettable MPC. In: ITC 2022, LIPIcs, vol. 230, pp. 10:1\u201310:21 (2022)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: Private summation in the multi-message shuffle model. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) CCS 2020: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, 9\u201313 November 2020, pp. 657\u2013676. ACM (2020). https:\/\/doi.org\/10.1145\/3372297.3417242","DOI":"10.1145\/3372297.3417242"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-54242-8_2","volume-title":"Theory of Cryptography","author":"B Barak","year":"2014","unstructured":"Barak, B., Bitansky, N., Canetti, R., Kalai, Y.T., Paneth, O., Sahai, A.: Obfuscation for evasive functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 26\u201351. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_2"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (IM)possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012). https:\/\/doi.org\/10.1145\/2160158.2160159","DOI":"10.1145\/2160158.2160159"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-44381-1_22","volume-title":"Advances in Cryptology","author":"A Beimel","year":"2014","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.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_22"},{"key":"7_CR14","doi-asserted-by":"crossref","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\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Bonawitz, K.A., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Thuraisingham, B., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017. pp. 1175\u20131191. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3133982","DOI":"10.1145\/3133956.3133982"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003). https:\/\/doi.org\/10.1137\/S0097539701398521","journal-title":"SIAM J. Comput."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: ACM STOC (1988)","DOI":"10.1007\/3-540-48184-2_43"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 375\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"7_CR19","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: Akella, A., Howell, J. (eds.) 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, 27\u201329 March 2017, pp. 259\u2013282. USENIX Association (2017). https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/corrigan-gibbs"},{"key":"7_CR20","unstructured":"Erlingsson, \u00da., et al.: Encode, shuffle, analyze privacy revisited: Formalizations and empirical evaluation. CoRR abs\/2001.03618 (2020). https:\/\/arxiv.org\/abs\/2001.03618"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 554\u2013563. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195408","DOI":"10.1145\/195058.195408"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/978-3-030-45724-2_27","volume-title":"Advances in Cryptology","author":"B Ghazi","year":"2020","unstructured":"Ghazi, B., Manurangsi, P., Pagh, R., Velingker, A.: Private aggregation from fewer anonymous messages. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 798\u2013827. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_27"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307\u2013328. ACM (2019)","DOI":"10.1145\/3335741.3335759"},{"key":"7_CR24","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. pp. 678\u2013687. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.74","DOI":"10.1109\/FOCS.2011.74"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-01001-9_3","volume-title":"Advances in Cryptology","author":"V Goyal","year":"2009","unstructured":"Goyal, V., Sahai, A.: Resettably secure computation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 54\u201371. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_3"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-70700-6_7","volume-title":"Advances in Cryptology","author":"S Halevi","year":"2017","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.) ASIACRYPT 2017, Part III. LNCS, vol. 10626, pp. 181\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_7"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-03810-6_10","volume-title":"Theory of Cryptography","author":"S Halevi","year":"2018","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Best possible information-theoretic MPC. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 255\u2013281. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_10"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Additive randomized encodings and their applications. IACR Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-031-38557-5_7"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Ishai, Y.: Randomization techniques for secure computation. In: Prabhakaran, M., Sahai, A. (eds.) Secure Multi-Party Computation, Cryptology and Information Security Series, vol. 10, pp. 222\u2013248. IOS Press (2013). https:\/\/doi.org\/10.3233\/978-1-61499-169-4-222","DOI":"10.3233\/978-1-61499-169-4-222"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12\u201314 November 2000, Redondo Beach, California, USA, pp. 294\u2013304. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892118","DOI":"10.1109\/SFCS.2000.892118"},{"key":"7_CR31","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., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244\u2013256. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_22"},{"key":"7_CR32","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), pp. 239\u2013248. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.25","DOI":"10.1109\/FOCS.2006.25"},{"key":"7_CR33","unstructured":"Jain, A., Lin, H., Luo, J., Wichs, D.: The pseudorandom oracle model and ideal obfuscation. IACR Cryptol. ePrint Arch, p. 1204 (2022). https:\/\/eprint.iacr.org\/2022\/1204"},{"key":"7_CR34","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014). https:\/\/arxiv.org\/abs\/2105.10386"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38557-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:25Z","timestamp":1753567345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38557-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385568","9783031385575"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38557-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}