Alamati N Branco P Döttling N Garg S Hajiabadi M Pu S Nissim K Waters B Laconic private set intersection and applications Theory of Cryptography 2021 Cham Springer 94 125 10.1007/978-3-030-90456-2_4 13044
Applebaum B Damgård I Ishai Y Nielsen M Zichron L Katz J Shacham H Secure arithmetic computation with constant computational overhead Advances in Cryptology – CRYPTO 2017 2017 Cham Springer 223 254 10.1007/978-3-319-63688-7_8 10401
Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 111–124. ACM Press (2022)
Badrinarayanan, S., et al.: A plug-n-play framework for scaling private set intersection to billion-sized sets. In: Deng, J., Kolesnikov, V., Schwarzmann, A.A. (eds.) CANS 2023. LNCS, vol. 14342, pp. 443–467. Springer, Cham (2023). https://doi.org/10.1007/978-981-99-7563-1_20
Beaver D Feigenbaum J Efficient multiparty protocols using circuit randomization Advances in Cryptology — CRYPTO ’91 1992 Heidelberg Springer 420 432 10.1007/3-540-46766-1_34 576
Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996. pp. 479–488. ACM (1996)
Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: how to remove intractability assumptions. In: 20th ACM STOC, pp. 113–131. ACM Press (1988)
Bendlin R Damgård I Orlandi C Zakarias S Paterson KG Semi-homomorphic encryption and multiparty computation Advances in Cryptology – EUROCRYPT 2011 2011 Heidelberg Springer 169 188 10.1007/978-3-642-20465-4_11 6632
Bhadauria, R., Döttling, N., Hazay, C., Lin, C.: Laconic cryptography with preprocessing. Cryptology ePrint Archive, Paper 2025/605 (2025). https://eprint.iacr.org/2025/605
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 896–912. ACM Press (Oct 2018)
Boyle E et al. Hazay C Stam M et al. Oblivious transfer with constant computational overhead EUROCRYPT 2023, Part I 2023 Cham Springer 271 302 14004
Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 291–308. ACM Press (2019)
Boyle E Couteau G Gilboa N Ishai Y Kohl L Scholl P Boldyreva A Micciancio D Efficient pseudorandom correlation generators: silent OT extension and more Advances in Cryptology – CRYPTO 2019 2019 Cham Springer 489 518 10.1007/978-3-030-26954-8_16 11694
Boyle E Couteau G Gilboa N Ishai Y Kohl L Scholl P Micciancio D Ristenpart T Efficient pseudorandom correlation generators from ring-LPN CRYPTO 2020, Part II 2020 Cham (Aug Springer 387 416 10.1007/978-3-030-56880-1_14 12171
Boyle E Gilboa N Ishai Y Hofheinz D Rosen A Secure computation with preprocessing via function secret sharing Theory of Cryptography 2019 Cham Springer 341 371 10.1007/978-3-030-36030-6_14 11891
Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97–106. IEEE Computer Society (2011)
Brakerski Z Vaikuntanathan V Rogaway P Fully homomorphic encryption from ring-LWE and security for key dependent messages Advances in Cryptology – CRYPTO 2011 2011 Heidelberg Springer 505 524 10.1007/978-3-642-22792-9_29 6841
Branco P Döttling N Mateus P Hanaoka G Shikata J Watanabe Y Two-round oblivious linear evaluation from learning with errors PKC 2022, Part I 2022 Cham Springer 379 408 10.1007/978-3-030-97121-2_14 13177
Burra SS et al. High-performance multi-party computation for binary circuits based on oblivious transfer J. Cryptol. 2021 34 3 34 4280517 10.1007/s00145-021-09403-1
Chang Y-C Lu C-J Boyd C Oblivious polynomial evaluation and oblivious neural learning Advances in Cryptology — ASIACRYPT 2001 2001 Heidelberg Springer 369 384 10.1007/3-540-45682-1_22 2248
Chase M Miao P Micciancio D Ristenpart T Private set intersection in the internet setting from lightweight oblivious PRF Advances in Cryptology – CRYPTO 2020 2020 Cham Springer 34 63 10.1007/978-3-030-56877-1_2 12172
Cho C Döttling N Garg S Gupta D Miao P Polychroniadou A Katz J Shacham H Laconic oblivious transfer and its applications Advances in Cryptology – CRYPTO 2017 2017 Cham Springer 33 65 10.1007/978-3-319-63715-0_2 10402
Chongchitmate, W., Ishai, Y., Lu, S., Ostrovsky, R.: PSI from ring-ole. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pp. 531–545. ACM (2022)
Corrigan-Gibbs H Kogan D Canteaut A Ishai Y Private information retrieval with sublinear online time Advances in Cryptology – EUROCRYPT 2020 2020 Cham Springer 44 75 10.1007/978-3-030-45721-1_3 12105
Couteau G Ishai Y Rijmen V A note on the communication complexity of multiparty computation in the correlated randomness model Advances in Cryptology – EUROCRYPT 2019 2019 Cham Springer 473 503 10.1007/978-3-030-17656-3_17 11477
De Cristofaro E Kim J Tsudik G Abe M Linear-complexity private set intersection protocols secure in malicious model Advances in Cryptology - ASIACRYPT 2010 2010 Heidelberg Springer 213 231 10.1007/978-3-642-17373-8_13 6477
Damgård I Pastro V Smart N Zakarias S Safavi-Naini R Canetti R Multiparty computation from somewhat homomorphic encryption Advances in Cryptology – CRYPTO 2012 2012 Heidelberg Springer 643 662 10.1007/978-3-642-32009-5_38 7417
Damgård I Zakarias S Sahai A Constant-overhead secure computation of Boolean circuits using preprocessing Theory of Cryptography 2013 Heidelberg Springer 621 641 10.1007/978-3-642-36594-2_35 7785
Dong F Hao Z Mook E Wee H Wichs D Reyzin L Stebila D Laconic function evaluation and ABE for RAMs from (ring-)LWE CRYPTO 2024, Part III 2024 Cham (Aug Springer 107 142 10.1007/978-3-031-68382-4_4 14922
Dong F Hao Z Mook E Wichs D Joye M Leander G Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation EUROCRYPT 2024, Part II 2024 Cham (May Springer 190 218 14652
Döttling N Kolonelos D Lai RWF Lin C Malavolta G Rahimi A Hazay C Stam M Efficient laconic cryptography from learning with errors EUROCRYPT 2023, Part III 2023 Cham Springer 417 446 10.1007/978-3-031-30620-4_14 14006
Dujmovic J Hajiabadi M Joye M Leander G Lower-bounds on public-key operations in PIR EUROCRYPT 2024, Part VI 2024 Cham Springer 65 87 10.1007/978-3-031-58751-1_3 14656
Fleischhacker, N., Hall-Andersen, M., Simkin, M.: Extractable witness encryption for KZG commitments and efficient laconic OT. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15485, pp. 423–453. Springer, Singapore (2024). https://doi.org/10.1007/978-981-96-0888-1_14
Freedman MJ Nissim K Pinkas B Cachin C Camenisch JL Efficient private matching and set intersection Advances in Cryptology - EUROCRYPT 2004 2004 Heidelberg Springer 1 19 10.1007/978-3-540-24676-3_1 3027
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169–178 (2009)
Gentry C Sahai A Waters B Canetti R Garay JA Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based Advances in Cryptology – CRYPTO 2013 2013 Heidelberg Springer 75 92 10.1007/978-3-642-40041-4_5 8042
Ghosh S Nielsen JB Nilges T Takagi T Peyrin T Maliciously secure oblivious linear function evaluation with constant overhead Advances in Cryptology – ASIACRYPT 2017 2017 Cham Springer 629 659 10.1007/978-3-319-70694-8_22 10624
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464–479. IEEE Computer Society Press (1984)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218–229. ACM Press (May 1987)
Green, M., Jain, A., Laer, G.V.: Efficient set membership encryption and applications. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 1080–1092. ACM Press (2023)
Green, M., Jain, A., Laer, G.V.: Efficient set membership encryption and applications. In: CCS, pp. 1080–1092. ACM (2023)
Hanaoka G Imai H Mueller-Quade J Nascimento ACA Otsuka A Winter A Wang H Pieprzyk J Varadharajan V Information theoretically secure oblivious polynomial evaluation: model, bounds, and constructions Information Security and Privacy 2004 Heidelberg Springer 62 73 10.1007/978-3-540-27800-9_6 3108
Hazay C Lindell Y Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries J. Cryptol. 2010 23 3 422 456 2643685 10.1007/s00145-008-9034-x
Hazay C Nissim K Efficient set operations in the presence of malicious adversaries J. Cryptol. 2012 25 3 383 433 2900406 10.1007/s00145-011-9098-x
Hazay C Orsini E Scholl P Soria-Vazquez E Peyrin T Galbraith S Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT) Advances in Cryptology – ASIACRYPT 2018 2018 Cham Springer 86 117 10.1007/978-3-030-03332-3_4 11274
Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: 21st ACM STOC, pp. 12–24. ACM Press (1989)
Impagliazzo R Rudich S Goldwasser S Limits on the provable consequences of one-way permutations Advances in Cryptology — CRYPTO’ 88 1990 New York Springer 8 26 10.1007/0-387-34799-2_2 403
Ishai Y Kilian J Nissim K Petrank E Boneh D Extending oblivious transfers efficiently Advances in Cryptology - CRYPTO 2003 2003 Heidelberg Springer 145 161 10.1007/978-3-540-45146-4_9 2729
Ishai Y Prabhakaran M Sahai A Reingold O Secure arithmetic computation with no honest majority Theory of Cryptography 2009 Heidelberg Springer 294 314 10.1007/978-3-642-00457-5_18 5444
Jarecki S Liu X Reingold O Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection Theory of Cryptography 2009 Heidelberg Springer 577 594 10.1007/978-3-642-00457-5_34 5444
Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM STOC, pp. 20–31. ACM Press (1988)
Kissner L Song D Shoup V Privacy-preserving set operations Advances in Cryptology – CRYPTO 2005 2005 Heidelberg Springer 241 257 10.1007/11535218_15 3621
Naor M Pinkas B Oblivious polynomial evaluation SIAM J. Comput. 2006 35 5 1254 1281 2217145 10.1137/S0097539704383633
Nevo, O., Trieu, N., Yanai, A.: Simple, fast malicious multiparty private set intersection. In: CCS ’21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021. pp. 1151–1165. ACM (2021)
Nielsen JB Nordholt PS Orlandi C Burra SS Safavi-Naini R Canetti R A new approach to practical active-secure two-party computation Advances in Cryptology – CRYPTO 2012 2012 Heidelberg Springer 681 700 10.1007/978-3-642-32009-5_40 7417
Pinkas B Rosulek M Trieu N Yanai A Boldyreva A Micciancio D SpOT-light: lightweight private set intersection from sparse OT extension Advances in Cryptology – CRYPTO 2019 2019 Cham Springer 401 431 10.1007/978-3-030-26954-8_13 11694
Pinkas B Rosulek M Trieu N Yanai A Canteaut A Ishai Y PSI from PaXoS: fast, malicious private set intersection Advances in Cryptology – EUROCRYPT 2020 2020 Cham Springer 739 767 10.1007/978-3-030-45724-2_25 12106
Pinkas B Schneider T Tkachenko O Yanai A Ishai Y Rijmen V Efficient circuit-based PSI with linear communication Advances in Cryptology – EUROCRYPT 2019 2019 Cham Springer 122 153 10.1007/978-3-030-17659-4_5 11478
Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20–22, 2014, pp. 797–812. USENIX Association (2014)
Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th FOCS, pp. 859–870. IEEE Computer Society Press (2018)
Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Aiken Computation Lab, Harvard University (1981)
Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7–11, 2022, pp. 2505–2517. ACM (2022)
Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84–93. ACM Press (2005)
Ren, L., Mughees, M.H., Sun, I.: Simple and practical amortized sublinear private information retrieval using dummy subsets. In: CCS, pp. 1420–1433. ACM (2024). https://doi.org/10.1145/3658644.3690266
Shi E Aqeel W Chandrasekaran B Maggs B Malkin T Peikert C Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time Advances in Cryptology – CRYPTO 2021 2021 Cham Springer 641 669 10.1007/978-3-030-84259-8_22 12828
Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1607–1626. ACM Press (Nov 2020)
Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160–164. IEEE Computer Society Press (1982)
Zhou, M., Park, A., Zheng, W., Shi, E.: Piano: Extremely simple, single-server PIR with sublinear server computation. In: SP, pp. 4296–4314. IEEE (2024)
