{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T08:03:04Z","timestamp":1784361784866,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819230174","type":"print"},{"value":"9789819230181","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-92-3018-1_6","type":"book-chapter","created":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T07:27:09Z","timestamp":1784359629000},"page":"142-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Additive Randomized Encodings for String Oblivious Transfer: A Core Primitive for\u00a0General Functions"],"prefix":"10.1007","author":[{"given":"Masaya","family":"Yoshimura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyoichi","family":"Asano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yugo","family":"Kasashima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitsugu","family":"Iwamoto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yohei","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: Private summation in the multi-message shuffle model. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, pp. 657\u2013676. Association for Computing Machinery, New York, NY, USA (2020)","DOI":"10.1145\/3372297.3417242"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman problem. In: ICICS 2003, vol.\u00a02836, pp. 301\u2013312 (2003)","DOI":"10.1007\/978-3-540-39927-8_28"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Ong, S.J., Vadhan, S.P.: Derandomization in cryptography. In: CRYPTO 2003, vol.\u00a02729, pp. 299\u2013315 (2003)","DOI":"10.1007\/978-3-540-45146-4_18"},{"key":"6_CR4","doi-asserted-by":"crossref","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. Lecture Notes in Computer Science, vol.\u00a08617, pp. 387\u2013404. Springer (2014)","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: The ACM Conference on Computer and Communications Security, pp. 784\u2013796. ACM (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Erabelli, S., Garg, R.: Additive randomized encodings from public key encryption. In: CRYPTO 2025 (2025)","DOI":"10.1007\/978-3-032-01884-7_8"},{"key":"6_CR7","unstructured":"Bitansky, N., Erabelli, S., Garg, R., Ishai, Y.: Shuffling is universal: statistical additive randomized encodings for all functions. IACR Cryptol. ePrint Arch. 1442 (2025). https:\/\/eprint.iacr.org\/2025\/1442, to appear in STOC 2026"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: A note on perfect correctness by derandomization. In: EUROCRYPT 2017, vol. 10211, pp. 592\u2013606 (2017)","DOI":"10.1007\/978-3-319-56614-6_20"},{"key":"6_CR9","first-page":"1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Automata, Languages and Programming, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: EUROCRYPT 2004, vol.\u00a03027, pp. 342\u2013360 (2004)","DOI":"10.1007\/978-3-540-24676-3_21"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Gasc\u00f3n, A., Ishai, Y., Kelkar, M., Li, B., Ma, Y., Raykova, M.: Computationally secure aggregation and private information retrieval in the shuffle model. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 4122\u20134136. Association for Computing Machinery, New York, NY, USA (2024)","DOI":"10.1145\/3658644.3670391"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/978-3-030-45724-2_27","volume-title":"Advances in Cryptology - EUROCRYPT 2020","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.) Advances in Cryptology - EUROCRYPT 2020, pp. 798\u2013827. Springer, Cham (2020)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Jain, A., Kushilevitz, E., Rabin, T.: Secure multiparty computation with general interaction patterns. In: Sudan, M. (ed.) Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, 14\u201316 January 2016, pp. 157\u2013168. ACM (2016)","DOI":"10.1145\/2840728.2840760"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Additive randomized encodings and their applications. In: CRYPTO 2023 (2023)","DOI":"10.1007\/978-3-031-38557-5_7"},{"key":"6_CR15","unstructured":"Ishai, Y., Kelkar, M., Lee, D., Ma, Y.: Information-theoretic single-server PIR in the shuffle model. In: Aggarwal, D. (ed.) 5th Conference on Information-Theoretic Cryptography (ITC 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0304, pp. 6:1\u20136:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.25"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"UM Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput. 28(5), 1689\u20131721 (1999)","journal-title":"SIAM J. Comput."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? beating the half-gates lower bound for garbled circuits. In: Advances in Cryptology - CRYPTO 2021, pp. 94\u2013124 (2021)","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Proceedings of the 17th ACM Conference on Computer and Communications Security (2010)","DOI":"10.1145\/1866307.1866359"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole - reducing data transfer in garbled circuits using half gates. In: Advances in Cryptology - EUROCRYPT 2015, pp. 220\u2013250 (2015)","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3018-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T07:27:12Z","timestamp":1784359632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3018-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819230174","9789819230181"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3018-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acisp-conference.github.io\/acisp2026\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}