{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:27Z","timestamp":1778022747334,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"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_20","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:51Z","timestamp":1778020851000},"page":"573-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Succinct Non-interactive Secure Computation with\u00a0Malicious Security"],"prefix":"10.1007","author":[{"given":"Maya Farber","family":"Brodsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0452-3426","authenticated-orcid":false,"given":"Arka Rai","family":"Choudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8561-1123","authenticated-orcid":false,"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Ananth, P., Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: From FE combiners to secure MPC and back. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019: 17th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 11891, pp. 199\u2013228. Springer, Cham, Switzerland, Nuremberg, Germany (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_9","DOI":"10.1007\/978-3-030-36030-6_9"},{"key":"20_CR2","unstructured":"Apple Inc: Password monitoring - apple support (2021). https:\/\/support.apple.com\/guide\/security\/password-monitoring-sec78e79fc3b\/web"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Garg, S., Jain, A., Policharla, G.V.: Laconic PSI on authenticated inputs and applications. In: ASIACRYPT. Lecture Notes in Computer Science, Springer (2025)","DOI":"10.1007\/978-981-95-5116-3_9"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Ben-David, S., Kalai, Y.T., Paneth, O.: Verifiable private information retrieval. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022: 20th Theory of Cryptography Conference, Part\u00a0III. Lecture Notes in Computer Science, vol. 13749, pp. 3\u201332. Springer, Cham, Switzerland, Chicago, IL, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-22368-6_1","DOI":"10.1007\/978-3-031-22368-6_1"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptol. 30(4), 989\u20131066 (2017)","journal-title":"J. Cryptol."},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing, pp. 111\u2013120. ACM Press, Palo Alto, CA, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 505\u2013514. ACM Press, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2591796.2591859","DOI":"10.1145\/2591796.2591859"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th Annual ACM Symposium on Theory of Computing, pp. 435\u2013443. ACM Press, Vancouver, BC, Canada (2024). https:\/\/doi.org\/10.1145\/3618260.3649775","DOI":"10.1145\/3618260.3649775"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Bradley, E., Waters, B., Wu, D.J.: Batch arguments to NIZKs from one-way functions. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024: 22nd Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 15365, pp. 431\u2013463. Springer, Cham, Switzerland, Milan, Italy (2024). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_15","DOI":"10.1007\/978-3-031-78017-2_15"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th Annual ACM Symposium on Theory of Computing, pp. 474\u2013482. ACM Press, Montreal, QC, Canada (2017). https:\/\/doi.org\/10.1145\/3055399.3055497","DOI":"10.1145\/3055399.3055497"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky, R. (ed.) 52nd Annual Symposium on Foundations of Computer Science, pp. 97\u2013106. IEEE Computer Society Press, Palm Springs, CA, USA (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02017, Part\u00a0II. Lecture Notes in Computer Science, vol. 10402, pp. 33\u201365. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2","DOI":"10.1007\/978-3-319-63715-0_2"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. Lecture Notes in Computer Science, vol. 14084, pp. 635\u2013668. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd Annual Symposium on Foundations of Computer Science, pp. 68\u201379. IEEE Computer Society Press, Denver, CO, USA (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Misra, A.K., Ostrovsky, R., Shah, A.: Black-box constant-round secure 2PC with succinct communication. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02025, Part\u00a0V. Lecture Notes in Computer Science, vol. 15605, pp. 360\u2013389. Springer, Cham, Switzerland, Madrid, Spain (2025). https:\/\/doi.org\/10.1007\/978-3-031-91092-0_13","DOI":"10.1007\/978-3-031-91092-0_13"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S., Goyal, V., Malavolta, G.: Laconic conditional disclosure of secrets and applications. In: Zuckerman, D. (ed.) 60th Annual Symposium on Foundations of Computer Science, pp. 661\u2013685. IEEE Computer Society Press, Baltimore, MD, USA (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00046","DOI":"10.1109\/FOCS.2019.00046"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Garg, S., Hajiabadi, M., Jain, A., Jin, Z., Pandey, O., Shiehian, S.: Credibility in private set membership. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. Lecture Notes in Computer Science, vol. 13941, pp. 159\u2013189. Springer, Cham, Switzerland, Atlanta, GA, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_6","DOI":"10.1007\/978-3-031-31371-4_6"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press, Bethesda, MD, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656","DOI":"10.1017\/CBO9780511721656"},{"key":"20_CR20","unstructured":"Google Inc: Protect your accounts from data breaches with password checkup (2019). https:\/\/security.googleblog.com\/2019\/02\/protect-your-accounts-from-data.html"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) ITCS 2015: 6th Conference on Innovations in Theoretical Computer Science, pp. 163\u2013172. Association for Computing Machinery, Rehovot, Israel (2015). https:\/\/doi.org\/10.1145\/2688073.2688105","DOI":"10.1145\/2688073.2688105"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Hulett, J., Jawale, R., Khurana, D., Srinivasan, A.: SNARGs for P from sub-exponential DDH and QR. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13276, pp. 520\u2013549. Springer, Cham, Switzerland, Trondheim, Norway (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_18","DOI":"10.1007\/978-3-031-07085-3_18"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02011. Lecture Notes in Computer Science, vol.\u00a06632, pp. 406\u2013425. Springer Berlin Heidelberg, Germany, Tallinn, Estonia (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Jain, A., Kalai, Y.T., Khurana, D., Rothblum, R.: Distinguisher-dependent simulation in two rounds and its applications. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02017, Part\u00a0II. Lecture Notes in Computer Science, vol. 10402, pp. 158\u2013189. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_6","DOI":"10.1007\/978-3-319-63715-0_6"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and RAM delegation. In: Saha, B., Servedio, R.A. (eds.) 55th Annual ACM Symposium on Theory of Computing, pp. 1545\u20131552. ACM Press, Orlando, FL, USA (2023). https:\/\/doi.org\/10.1145\/3564246.3585200","DOI":"10.1145\/3564246.3585200"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st Annual ACM Symposium on Theory of Computing, pp. 1115\u20131124. ACM Press, Phoenix, AZ, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"key":"20_CR27","unstructured":"Kannepalli, S., Laine, K., Moreno, R.C.: Password monitor: Safeguarding passwords in Microsoft edge (2021). https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/"},{"key":"20_CR28","unstructured":"Marlinspike, M.: The difficulty of private contact discovery (2014). https:\/\/whispersystems.org\/blog\/contact-discovery\/"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453. IEEE Computer Society Press, Santa Fe, NM, USA (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Morgan, A., Pass, R., Polychroniadou, A.: Succinct non-interactive secure computation. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0II. Lecture Notes in Computer Science, vol. 12106, pp. 216\u2013245. Springer, Cham, Switzerland, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_8","DOI":"10.1007\/978-3-030-45724-2_8"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th Annual Symposium on Foundations of Computer Science, pp. 859\u2013870. IEEE Computer Society Press, Paris, France (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00086","DOI":"10.1109\/FOCS.2018.00086"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13508, pp. 433\u2013463. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:55Z","timestamp":1778020855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_20","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"}}]}}