{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:11Z","timestamp":1778022731417,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253231","type":"print"},{"value":"9783032253248","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-3-032-25324-8_4","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:35:45Z","timestamp":1778020545000},"page":"94-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneous-Message and\u00a0Succinct Secure Computation: Reusable and\u00a0Multiparty Protocols"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D., Malavolta, G., Roy, L.: Succinct oblivious tensor evaluation and applications: adaptively-secure laconic function evaluation and trapdoor hashing for all circuits. In: STOC (2025)","DOI":"10.1145\/3717823.3718164"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Abram, D., Roy, L., Scholl, P.: Succinct homomorphic secret sharing. In: EUROCRYPT (2024)","DOI":"10.1007\/978-3-031-58751-1_11"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Jin, Z., Malavolta, G.: Multi-key fully-homomorphic encryption in the plain model. In: TCC (2020)","DOI":"10.1007\/978-3-030-64375-1_2"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Jin, Z., Malavolta, G.: Unbounded multi-party computation from learning with errors. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_26"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: CRYPTO (2001)","DOI":"10.1007\/3-540-44647-8_1"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Garg, S., Masny, D., Mukherjee, P.: Reusable two-round MPC from DDH. In: TCC (2020)","DOI":"10.1007\/978-3-030-64378-2_12"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Garg, S., Srinivasan, A., Zhang, Y.: Reusable two-round MPC from LPN. In: PKC (2022)","DOI":"10.1007\/978-3-030-97121-2_7"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Jain, A., Komargodski, I., Lin, H.: Multiparty reusable non-interactive secure computation from LWE. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_25"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Lin, H.: Mr NISC: multiparty reusable non-interactive secure computation. In: TCC (2020)","DOI":"10.1007\/978-3-030-64378-2_13"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: ACM CCS (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Jain, A., Servan-Schreiber, S., Srinivasan, A.: Simultaneous-message and succinct secure computation. In: EUROCRYPT (2025)","DOI":"10.1007\/978-3-031-91092-0_8"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: EUROCRYPT (2019)","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles. In: TCC (2019)","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Koppula, V., Mour, T.: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56877-1_26"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and more) from LWE. In: TCC (2017)","DOI":"10.1007\/978-3-319-70500-2_10"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Branco, P., Choudhuri, A.R., D\u00f6ttling, N., Jain, A., Malavolta, G., Srinivasan, A.: Black-box non-interactive zero knowledge from vector trapdoor hash. In: EUROCRYPT (2025)","DOI":"10.1007\/978-3-031-91134-7_3"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4) (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63715-0_2"},{"key":"4_CR22","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS (1995)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Couteau, G., Hegde, A., Pu, S.: Enhanced trapdoor hashing from DDH and DCR. In: EUROCRYPT (2025)","DOI":"10.1007\/978-3-031-91095-1_5"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: CRYPTO (2001)","DOI":"10.1007\/3-540-44647-8_33"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: CRYPTO (2016)","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC (1994)","DOI":"10.1145\/195058.195408"},{"key":"4_CR28","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_CR29","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"4_CR31","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: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: CRYPTO (2011)","DOI":"10.1007\/978-3-642-22792-9_8"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Hsieh, Y., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: FOCS (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct homomorphic MACs from groups and applications. In: FOCS (2025)","DOI":"10.1109\/FOCS63196.2025.00131"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. In: CRYPTO (2025)","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z.: Non-interactive zero knowledge from sub-exponential DDH. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77870-5_1"},{"key":"4_CR37","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS (1997)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC (1990)","DOI":"10.1145\/100216.100273"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: FOCS (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"4_CR41","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25324-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:36:18Z","timestamp":1778020578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_4","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":"6 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}