{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:47:34Z","timestamp":1773272854586,"version":"3.50.1"},"reference-count":142,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T00:00:00Z","timestamp":1758931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"State Assignment","award":["FSER-2025-0003"],"award-info":[{"award-number":["FSER-2025-0003"]}]}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Cryptography"],"abstract":"<jats:p>Modern distributed computing systems and applications with strict privacy requirements demand robust data confidentiality. A primary challenge involves enabling parties to exchange data or perform joint computations. These interactions must avoid revealing private information about the data. Protocols with the obliviousness property, known as oblivious protocols, address this issue. They ensure that no party learns more than necessary. This survey analyzes the security and performance of post-quantum oblivious protocols, with a focus on oblivious transfer and oblivious pseudorandom functions. The evaluation assesses resilience against malicious adversaries in the Universal Composability framework. Efficiency is quantified through communication and computational overhead. It identifies optimal scenarios for these protocols. This paper also surveys related primitives, such as oblivious signatures and data structures, along with their applications. Key findings highlight the inherent trade-offs between computational cost and communication complexity in post-quantum oblivious constructions. Open challenges and future research directions are outlined. Emphasis is placed on quantum-resistant designs and formal security proofs in stronger adversarial models.<\/jats:p>","DOI":"10.3390\/cryptography9040062","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T14:01:39Z","timestamp":1759154499000},"page":"62","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Survey of Post-Quantum Oblivious Protocols"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5494-7142","authenticated-orcid":false,"given":"Altana","family":"Khutsaeva","sequence":"first","affiliation":[{"name":"Department of Information Security, State University of Aerospace Instrumentation, Saint Petersubrg 190000, Russia"},{"name":"Faculty of Secure Information Technologies, ITMO University, Saint Petersburg 197101, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1823-7877","authenticated-orcid":false,"given":"Anton","family":"Leevik","sequence":"additional","affiliation":[{"name":"Faculty of Secure Information Technologies, ITMO University, Saint Petersburg 197101, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0924-6221","authenticated-orcid":false,"given":"Sergey","family":"Bezzateev","sequence":"additional","affiliation":[{"name":"Department of Information Security, State University of Aerospace Instrumentation, Saint Petersubrg 190000, Russia"},{"name":"Faculty of Secure Information Technologies, ITMO University, Saint Petersburg 197101, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2025,9,27]]},"reference":[{"key":"ref_1","unstructured":"Rabin, M.O. (2025, February 08). How To Exchange Secrets with Oblivious Transfer. Available online: https:\/\/eprint.iacr.org\/2005\/187."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","article-title":"A randomized protocol for signing contracts","volume":"28","author":"Even","year":"1985","journal-title":"Commun. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1008908.1008920","article-title":"Conjugate coding","volume":"15","author":"Wiesner","year":"1983","journal-title":"ACM Sigact News"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., and Trieu, N. (2016, January 24\u201328). Efficient batched oblivious PRF with applications to private set intersection. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978381"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","article-title":"Scalable private set intersection based on OT extension","volume":"21","author":"Pinkas","year":"2018","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2019, January 18\u201322). SpOT-light: Lightweight private set intersection from sparse OT extension. Proceedings of the Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part III 39.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s00145-021-09403-1","article-title":"High-performance multi-party computation for binary circuits based on oblivious transfer","volume":"34","author":"Burra","year":"2021","journal-title":"J. Cryptol."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MSP.2012.2230218","article-title":"Privacy-preserving biometric identification using secure multiparty computation: An overview and recent trends","volume":"30","author":"Bringer","year":"2013","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_10","first-page":"1364","article-title":"Privacy-preserving federated deep learning with irregular users","volume":"19","author":"Xu","year":"2020","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Naor, M., and Pinkas, B. (1999, January 1\u20134). Oblivious transfer and polynomial evaluation. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, USA.","DOI":"10.1145\/301250.301312"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, L. (1994, January 7\u20139). Oblivious signatures. Proceedings of the Computer Security-ESORICS 94: Third European Symposium on Research in Computer Security, Brighton, UK. Proceedings 3.","DOI":"10.1007\/3-540-58618-0_62"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/233551.233553","article-title":"Software protection and simulation on oblivious RAMs","volume":"43","author":"Goldreich","year":"1996","journal-title":"J. ACM"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2021, January 16\u201320). Oblivious key-value stores and amplification for private set intersection. Proceedings of the Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual. Proceedings, Part II 41.","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., and Reingold, O. (2005, January 10\u201312). Keyword search and oblivious pseudorandom functions. Proceedings of the Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA. Proceedings 2.","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Branco, P., D\u00f6ttling, N., and Mateus, P. (2022, January 8\u201311). Two-round oblivious linear evaluation from learning with errors. Proceedings of the IACR International Conference on Public-Key Cryptography, Virtual.","DOI":"10.1007\/978-3-030-97121-2_14"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., and Ishai, Y. (2018, January 15\u201319). Compressing vector OLE. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada.","DOI":"10.1145\/3243734.3243868"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Malkin, T., and Ostrovsky, R. (2000, January 14\u201318). Single database private information retrieval implies oblivious transfer. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques\u2014EUROCRYPT 2000, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_10"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Mayberry, T., Blass, E.O., and Chan, A.H. (2025, February 10). Efficient Private File Retrieval by Combining ORAM and PIR. Available online: https:\/\/eprint.iacr.org\/2013\/086.","DOI":"10.14722\/ndss.2014.23033"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Chase, M., and Miao, P. (2020, January 17\u201321). Private set intersection in the internet setting from lightweight oblivious PRF. Proceedings of the Advances in Cryptology\u2013CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA. Proceedings, Part III 40.","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Nevo, O., Trieu, N., and Yanai, A. (2021, January 15\u201319). Simple, fast malicious multiparty private set intersection. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual.","DOI":"10.1145\/3460120.3484772"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Golle, P., Staddon, J., and Waters, B. (2004, January 8\u201311). Secure conjunctive keyword search over encrypted data. Proceedings of the International Conference on Applied Cryptography and Network Security: Second International Conference, ACNS 2004, Yellow Mountain, China.","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., and Resch, J. (2019, January 11\u201315). Updatable oblivious key management for storage systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3363196"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1515\/popets-2018-0026","article-title":"Privacy pass: Bypassing internet challenges anonymously","volume":"2018","author":"Davidson","year":"2018","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., and Xu, J. (May, January 29). OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel. Proceedings, Part III 37.","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Davies, G.T., Faller, S., Gellert, K., Handirk, T., Hesse, J., Horv\u00e1th, M., and Jager, T. (2023, January 20\u201324). Security analysis of the whatsapp end-to-end encrypted backup protocol. Proceedings of the Advances in Cryptology\u2014CRYPTO 2023: 43rd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part VII.","DOI":"10.1007\/978-3-031-38551-3_11"},{"key":"ref_28","first-page":"135","article-title":"Design and Implementation of a Multiple-Choice E-voting Scheme on Mobile System using Novel t-out-of-n Oblivious Signature","volume":"34","author":"Chiou","year":"2018","journal-title":"J. Inf. Sci. Eng."},{"key":"ref_29","first-page":"851","article-title":"E-commerce Scheme Based on Proxy t-out-of-n Oblivious Signature","volume":"26","author":"Chen","year":"2024","journal-title":"Int. J. Netw. Secur."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Huang, Y., and Goldberg, I. (2013, January 4). Outsourced private information retrieval. Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society, Berlin, Germany.","DOI":"10.1145\/2517840.2517854"},{"key":"ref_31","unstructured":"Eskandarian, S., and Zaharia, M. (2017). Oblidb: Oblivious query processing for secure databases. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Garg, S., Mohassel, P., and Papamanthou, C. (2016, January 14\u201318). TWORAM: Efficient oblivious RAM in two rounds with applications to searchable encryption. Proceedings of the Advances in Cryptology\u2014CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part II.","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Ghosh, S., Nielsen, J.B., Nilges, T., and Trifiletti, R. (November, January 30). TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134024"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Santos, M.B., Mateus, P., and Pinto, A.N. (2022). Quantum oblivious transfer: A short review. Entropy, 24.","DOI":"10.20944\/preprints202206.0209.v1"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Casacuberta, S., Hesse, J., and Lehmann, A. (2022, January 6\u201310). SoK: Oblivious Pseudorandom Functions. Proceedings of the 2022 IEEE European Symposium on Security and Privacy (EuroS&P), Genoa, Italy.","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Yadav, V.K., Andola, N., Verma, S., and Venkatesan, S. (2022). A Survey of Oblivious Transfer Protocol, ACM.","DOI":"10.1145\/3503045"},{"key":"ref_39","unstructured":"Barreto, P.S., David, B., Dowsley, R., Morozov, K., and Nascimento, A.C. (2017). A framework for efficient adaptively secure composable oblivious transfer in the ROM. arXiv."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Lai, Y.F., Galbraith, S.D., and Delpech de Saint Guilhem, C. (2021, January 17\u201321). Compact, efficient and UC-secure isogeny-based oblivious transfer. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia. Proceedings, Part I.","DOI":"10.1007\/978-3-030-77870-5_8"},{"key":"ref_41","first-page":"1","article-title":"Simple Two-Round OT in the Explicit Isogeny Model","volume":"1","author":"Orsini","year":"2024","journal-title":"Commun. Cryptol."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Mansy, D., and Rindal, P. (2019, January 11\u201315). Endemic oblivious transfer. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3354210"},{"key":"ref_43","unstructured":"Dong, S., Cui, H., Zhang, K., Yang, K., and Yu, Y. (2025, March 12). A Simple Post-Quantum Oblivious Transfer Protocol from Mod-LWR. Cryptology ePrint Archive, Report 2024\/1116. Available online: https:\/\/eprint.iacr.org\/2024\/1116."},{"key":"ref_44","first-page":"448","article-title":"Efficient oblivious transfer protocols","volume":"Volume 1","author":"Naor","year":"2001","journal-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., and Smart, N.P. (2021, January 10\u201313). Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. Proceedings of the IACR International Conference on Public-Key Cryptography, Virtual.","DOI":"10.1007\/978-3-030-75248-4_10"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., and Gur, K.D. (2024, January 15\u201319). Verifiable oblivious pseudorandom functions from lattices: Practical-ish and thresholdisable. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2024: 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India. Proceedings, Part VIII.","DOI":"10.1007\/978-981-96-0894-2_7"},{"key":"ref_47","unstructured":"Esgin, M.F., Steinfeld, R., Tairi, E., and Xu, J. (2025, April 03). LeOPaRd: Towards Practical Post-Quantum Oblivious PRFs via Interactive Lattice Problems.Cryptology ePrint Archive, Report 2024\/1615. Available online: https:\/\/eprint.iacr.org\/2024\/1615."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., and Gardham, D. (2024, January 26\u201330). Crypto Dark Matter on the Torus: Oblivious Prfs from Shallow Prfs and Tfhe. Proceedings of theAdvances in Cryptology\u2014EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland. Proceedings, Part I.","DOI":"10.1007\/978-3-031-58751-1_16"},{"key":"ref_49","unstructured":"Cheon, J.H., and Jang, D. (2025). Cryptanalysis on Lightweight Verifiable Homomorphic Encryption. arXiv."},{"key":"ref_50","unstructured":"Basso, A. (2023, January 15\u201316). A post-quantum round-optimal oblivious PRF from isogenies. Proceedings of the Selected Areas in Cryptography\u2014SAC 2023: 29th International Conference, Saskatoon, SK, Canada. Revised Selected Papers."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Beullens, W., Dodgson, L., Faller, S., and Hesse, J. (April, January 30). The 2Hash OPRF framework and efficient post-quantum instantiations. Proceedings of theAdvances in Cryptology\u2014EUROCRYPT 2025: 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Ljubljana, Slovenia. Proceedings, Part I.","DOI":"10.1007\/978-3-031-91101-9_12"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Yang, Y., Benhamouda, F., Halevi, S., Krawczyk, H., and Rabin, T. (2025, January 18\u201322). Gold OPRF: Post-quantum oblivious power-residue PRF. Proceedings of the 2025 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP61157.2025.00116"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Canetti, R. (2001, January 14\u201317). Universally composable security: A new paradigm for cryptographic protocols. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, USA.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., and Rudich, S. (1989, January 15\u201317). Limits on the provable consequences of one-way permutations. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, WA, USA.","DOI":"10.1145\/73007.73012"},{"key":"ref_55","unstructured":"Bellare, M., and Micali, S. (1989, January 20\u201324). Non-interactive oblivious transfer and applications. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201989: 9th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"215","DOI":"10.46586\/tches.v2021.i4.215-238","article-title":"Roted: Random oblivious transfer for embedded devices","volume":"4","author":"Branco","year":"2021","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., and Wang, X. (2020, January 9\u201313). Ferret: Fast extension for correlated OT with small communication. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual.","DOI":"10.1145\/3372297.3417276"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Neven, G., and Shelat, A. (2007, January 20\u201324). Simulatable adaptive oblivious transfer. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain. Proceedings.","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Rial, A., Kohlweiss, M., and Preneel, B. (2009, January 12\u201314). Universally composable adaptive priced oblivious transfer. Proceedings of the Pairing-Based Cryptography\u2013Pairing 2009: Third International Conference, Palo Alto, CA, USA. Proceedings 3.","DOI":"10.1007\/978-3-642-03298-1_15"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Coull, S., Green, M., and Hohenberger, S. (2009, January 18\u201320). Controlling access to an oblivious database using stateful anonymous credentials. Proceedings of the Public Key Cryptography\u2013PKC 2009: 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA. Proceedings 12.","DOI":"10.1007\/978-3-642-00468-1_28"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Beaver, D. (1996, January 22\u201324). Correlated pseudorandomness and the complexity of private computations. Proceedings of theTwenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237996"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., and Petrank, E. (2003, January 17\u201321). Extending oblivious transfers efficiently. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., and Kumaresan, R. (2013, January 1\u20135). Improved OT extension for transferring short secrets. Proceedings of the the Advances in Cryptology\u2014ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India. Proceedings, Part II.","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., and Scholl, P. (2019, January 18\u201322). Efficient pseudorandom correlation generators: Silent OT extension and more. Proceedings of the Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part III 39.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P., and Scholl, P. (2019, January 11\u201315). Efficient two-round OT extension and silent non-interactive secure computation. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3354255"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Orlandi, C., Scholl, P., and Yakoubov, S. (2021, January 17\u201321). The rise of paillier: Homomorphic secret sharing and public-key silent OT. Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia. Proceedings, Part I 40.","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., and Raghuraman, S. (2021, January 16\u201320). Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. Proceedings of the Advances in Cryptology\u2014CRYPTO 2021: 41st Annual International Cryptology Conference, Virtual. Proceedings, Part I.","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., and Scholl, P. (2022, January 15\u201319). Correlated pseudorandomness from expand-accumulate codes. Proceedings of the Advances in Cryptology\u2014CRYPTO 2022: 42nd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part II.","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Lemus, M., Ramos, M.F., Yadav, P., Silva, N.A., Muga, N.J., Souto, A., Paunkovi\u0107, N., Mateus, P., and Pinto, A.N. (2020). Generation and distribution of quantum oblivious keys for secure multiparty computation. Appl. Sci., 10.","DOI":"10.3390\/app10124080"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1049\/qtc2.12010","article-title":"Quantum and classical oblivious transfer: A comparative analysis","volume":"2","author":"Santos","year":"2021","journal-title":"IET Quantum Commun."},{"key":"ref_71","first-page":"1","article-title":"CRYSTALS-Kyber algorithm specifications and supporting documentation","volume":"2","author":"Avanzi","year":"2019","journal-title":"NIST PQC Round"},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Miller, C., Moody, D., and Peralta, R. (2022). Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process, Number NIST Internal or Interagency Report (NISTIR) 8413.","DOI":"10.6028\/NIST.IR.8413"},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Branco, P., Ding, J., Goul\u00e3o, M., and Mateus, P. (2019, January 16\u201318). A framework for universally composable oblivious transfer from one-round key-exchange. Proceedings of the Cryptography and Coding: 17th IMA International Conference, IMACC 2019, Oxford, UK. Proceedings 17.","DOI":"10.1007\/978-3-030-35199-1_5"},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.P., Karmakar, A., Sinha Roy, S., and Vercauteren, F. (2018, January 7\u20139). Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. Proceedings of the Progress in Cryptology\u2014AFRICACRYPT 2018: 10th International Conference on Cryptology in Africa, Marrakesh, Morocco. Proceedings.","DOI":"10.1007\/978-3-319-89339-6_16"},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Barreto, P., Nascimento, A., Oliveira, G., and Benits, W. (2018). Supersingular Isogeny Oblivious Transfer (SIOT). arXiv.","DOI":"10.5753\/sbseg.2019.13965"},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Castryck, W., and Decru, T. (2023, January 23\u201327). An efficient key recovery attack on SIDH. Proceedings of theAdvances in Cryptology\u2014EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France. Proceedings, Part III.","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., and Renes, J. (2018, January 2\u20136). CSIDH: An efficient post-quantum commutative group action. Proceedings of the Advances in Cryptology\u2013ASIACRYPT 2018: 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia. Proceedings, Part III 24.","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Masny, D., Mukherjee, P., Patranabis, S., Raghuraman, S., and Sarkar, P. (2023, January 7\u201310). Round-optimal oblivious transfer and MPC from computational CSIDH. Proceedings of the Public-Key Cryptography\u2014PKC 2023: 26th IACR International Conference on Public-Key Cryptography, Atlanta, GA, USA. Proceedings, Part I.","DOI":"10.1007\/978-3-031-31368-4_14"},{"key":"ref_79","first-page":"1","article-title":"Classic McEliece: Conservative code-based cryptography","volume":"1","author":"Bernstein","year":"2017","journal-title":"NIST Submiss."},{"key":"ref_80","unstructured":"Melchor, C.A., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Persichetti, E., Z\u00e9mor, G., and Bos, J. (2025, June 04). HQC Supporting Documentation. Available online: http:\/\/pqc-hqc.org\/resources.html."},{"key":"ref_81","doi-asserted-by":"crossref","unstructured":"Campos, F., Chavez-Saab, J., Chi-Dom\u00ednguez, J.-J., Meyer, M., Reijnders, K., Rodr\u00edguez-Henr\u00edquez, F., Schwabe, P., and Wiggers, T. (2025, April 21). Optimizations and Practicality of High-Security CSIDH. Cryptology ePrint Archive, Report 2023\/793. Available online: https:\/\/eprint.iacr.org\/2023\/793.","DOI":"10.62056\/anjbksdja"},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/972639.972643","article-title":"Number-theoretic constructions of efficient pseudo-random functions","volume":"51","author":"Naor","year":"2004","journal-title":"J. ACM"},{"key":"ref_83","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Yampolskiy, A. (2005, January 23\u201326). A verifiable random function with short proofs and keys. Proceedings of the Public Key Cryptography\u2014PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland. Proceedings.","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., and Krawczyk, H. (2014, January 7\u201311). Round-optimal password-protected secret sharing and T-PAKE in the password-only model. Proceedings of the Advances in Cryptology\u2013ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan. Proceedings, Part II 20.","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"ref_85","doi-asserted-by":"crossref","unstructured":"Miao, P., Patel, S., Raykova, M., Seth, K., and Yung, M. (2020, January 17\u201321). Two-sided malicious security for private intersection-sum with cardinality. Proceedings of theAdvances in Cryptology\u2014CRYPTO 2020: 40th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part I.","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"ref_86","unstructured":"Jarecki, S., and Liu, X. (2009, January 15\u201317). Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. Proceedings of the Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA. Proceedings 6."},{"key":"ref_87","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Shoup, V. (2003, January 17\u201321). Practical verifiable encryption and decryption of discrete logarithms. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"ref_88","unstructured":"Trieu, N., Yanai, A., and Gao, J. (2025, May 02). Multiparty Private Set Intersection Cardinality and Its Applications. Available online: https:\/\/eprint.iacr.org\/2022\/735."},{"key":"ref_89","unstructured":"Ion, M., Kreuter, B., Nergiz, E., Patel, S., Saxena, S., Seth, K., Shanahan, D., and Yung, M. (2025, May 02). Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions. Cryptology ePrint Archive, Report 2017\/738. Available online: https:\/\/eprint.iacr.org\/2017\/738."},{"key":"ref_90","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., and Trieu, N. (November, January 30). Practical multi-party private set intersection from symmetric-key techniques. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134065"},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"353","DOI":"10.2478\/popets-2022-0018","article-title":"Circuit-PSI with linear complexity via relaxed batch OPPRF","volume":"2022","author":"Chandran","year":"2022","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1093\/comjnl\/bxaf001","article-title":"Practical and veritable threshold multi-factor authentication for mobile devices","volume":"7","author":"Qin","year":"2025","journal-title":"Comput. J."},{"key":"ref_93","unstructured":"Everspaugh, A., Chaterjee, R., Scott, S., Juels, A., and Ristenpart, T. (2015, January 12\u201314). The pythia {PRF} service. Proceedings of the 24th USENIX Security Symposium (USENIX Security 15), Washington, DC, USA."},{"key":"ref_94","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Celi, S., Ristenpart, T., Sullivan, N., Tessaro, S., and Wood, C.A. (June, January 30). A fast and simple partially oblivious PRF, with applications. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway. Proceedings, Part II.","DOI":"10.1007\/978-3-031-07085-3_23"},{"key":"ref_95","unstructured":"Banerjee, A., and Peikert, C. (2014, January 17\u201321). New and improved key-homomorphic pseudorandom functions. Proceedings of the Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part I 34."},{"key":"ref_96","doi-asserted-by":"crossref","unstructured":"Yang, R., Au, M.H., Zhang, Z., Xu, Q., Yu, Z., and Whyte, W. (2019, January 18\u201322). Efficient lattice-based zero-knowledge arguments with standard soundness: Construction and applications. Proceedings of the Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part I 39.","DOI":"10.1007\/978-3-030-26948-7_6"},{"key":"ref_97","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., and Plan\u00e7on, M. (2022, January 15\u201319). Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. Proceedings of the Advances in Cryptology\u2014CRYPTO 2022: 42nd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part II.","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"ref_98","doi-asserted-by":"crossref","unstructured":"Beullens, W., and Seiler, G. (2023, January 20\u201324). LaBRADOR: Compact proofs for R1CS from module-SIS. Proceedings of the Advances in Cryptology\u2014CRYPTO 2023: 43rd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part VII.","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","article-title":"TFHE: Fast fully homomorphic encryption over the torus","volume":"33","author":"Chillotti","year":"2020","journal-title":"J. Cryptol."},{"key":"ref_100","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., and Wu, D.J. (2018, January 11\u201314). Exploring crypto dark matter: New simple PRF candidates and their applications. Proceedings of the Theory of Cryptography: 16th International Conference, TCC 2018, Panama City, Panama. Proceedings, Part II.","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., and Rindal, P. (2018, January 15\u201319). Labeled PSI from fully homomorphic encryption with malicious security. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada.","DOI":"10.1145\/3243734.3243836"},{"key":"ref_102","doi-asserted-by":"crossref","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., and Peikert, C. (2018, January 5\u20137). More efficient commitments from structured lattice assumptions. Proceedings of the Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy. Proceedings.","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"ref_103","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kogan, D., and Woo, K. (2020, January 7\u201311). Oblivious pseudorandom functions from isogenies. Proceedings of the Advances in Cryptology\u2013ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, Republic of Korea. Proceedings, Part II 26.","DOI":"10.1007\/978-3-030-64834-3_18"},{"key":"ref_104","doi-asserted-by":"crossref","unstructured":"Jao, D., and De Feo, L. (December, January 29). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. Proceedings of the Post-Quantum Cryptography: 4th International Workshop, PQCrypto 2011, Taipei, Taiwan. Proceedings 4.","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"ref_105","doi-asserted-by":"crossref","unstructured":"Basso, A., Kutas, P., Merz, S.P., Petit, C., and Sanso, A. (2021, January 6\u201312). Cryptanalysis of an oblivious PRF from supersingular isogenies. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore. Proceedings, Part IV 27.","DOI":"10.1007\/978-3-030-92062-3_6"},{"key":"ref_106","unstructured":"Damg\u00e5rd, I.B. (1988, January 21\u201325). On the randomness of Legendre and Jacobi sequences. Proceedings of the Conference on the Theory and Application of Cryptography, Santa Barbara, CA, USA."},{"key":"ref_107","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., and Wang, X. (2021, January 15\u201319). Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual.","DOI":"10.1145\/3460120.3484556"},{"key":"ref_108","doi-asserted-by":"crossref","unstructured":"Roy, L. (2022, January 15\u201319). SoftSpokenOT: Quieter OT extension from small-field silent VOLE in the minicrypt model. Proceedings of the Advances in Cryptology\u2014CRYPTO 2022: 42nd Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part III.","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"ref_109","unstructured":"Tso, R., Okamoto, T., and Okamoto, E. (2008, January 21\u201323). 1-out-of-n oblivious signatures. Proceedings of the Information Security Practice and Experience: 4th International Conference, ISPEC 2008, Sydney, Australia. Proceedings 4."},{"key":"ref_110","first-page":"381","article-title":"A practical electronic voting protocol based upon oblivious signature scheme","volume":"Volume 1","author":"Song","year":"2008","journal-title":"Proceedings of the 2008 International Conference on Computational Intelligence and Security"},{"key":"ref_111","unstructured":"Tso, R. (2016, January 28\u201330). Two-in-one oblivious signatures secure in the random oracle model. Proceedings of the Network and System Security: 10th International Conference, NSS 2016, Taipei, Taiwan."},{"key":"ref_112","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.future.2019.06.014","article-title":"Two-in-one oblivious signatures","volume":"101","author":"Tso","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_113","doi-asserted-by":"crossref","unstructured":"You, J.S., Liu, Z.Y., Tso, R., Tseng, Y.F., and Mambo, M. (2022, January 18\u201320). Quantum-resistant 1-out-of-n oblivious signatures from lattices. Proceedings of theInformation Security: 25th International Conference, ISC 2022, Bali, Indonesia.","DOI":"10.1007\/978-3-031-15255-9_9"},{"key":"ref_114","first-page":"116","article-title":"An Oblivious Signature Scheme Based on Isogenies of Supersingular Elliptic Curves","volume":"57","author":"Khutsaeva","year":"2023","journal-title":"Probl. Informatsionnoy Bezop. Komp\u2019yuternye Sist."},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"1836","DOI":"10.1587\/transinf.2022NGI0001","article-title":"Generic Construction of 1-out-of-n Oblivious Signatures","volume":"105","author":"Zhou","year":"2022","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_116","doi-asserted-by":"crossref","unstructured":"Tezuka, M., and Tanaka, K. (December, January 29). 1-out-of-n Oblivious Signatures: Security Revisited and a Generic Construction with an Efficient Communication Cost. Proceedings of the Information Security and Cryptology: 26th International Conference, ICISC 2023, Seoul, Republic of Korea.","DOI":"10.1007\/978-981-97-1235-9_14"},{"key":"ref_117","doi-asserted-by":"crossref","unstructured":"Zahur, S., and Evans, D. (2013, January 19\u201322). Circuit structures for improving efficiency of security and privacy tools. Proceedings of the 2013 IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2013.40"},{"key":"ref_118","unstructured":"Stefanov, E., Shi, E., and Song, D. (2011). Towards Practical Oblivious RAM. arXiv, Available online: https:\/\/arxiv.org\/abs\/1106.3652."},{"key":"ref_119","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3177872","article-title":"Path ORAM: An extremely simple oblivious RAM protocol","volume":"65","author":"Stefanov","year":"2018","journal-title":"J. ACM"},{"key":"ref_120","doi-asserted-by":"crossref","unstructured":"Li, X., Luo, Y., and Gao, M. (2024, January 20\u201323). BULKOR: Enabling Bulk Loading for Path ORAM. Proceedings of the2024 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP54263.2024.00103"},{"key":"ref_121","unstructured":"Ostrovsky, R., and Shoup, V. (1997, January 4\u20136). Private information storage. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, USA."},{"key":"ref_122","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., and Vahlis, Y. (2012, January 16\u201318). Secure two-party computation in sublinear (amortized) time. Proceedings of the 2012 ACM Conference on Computer and Communications Security, Raleigh, NC, USA.","DOI":"10.1145\/2382196.2382251"},{"key":"ref_123","unstructured":"Heath, D., Kolesnikov, V., and Ostrovsky, R. (2025, July 12). Practical Garbled RAM: GRAM with O(log2n) Overhead. Cryptology ePrint Archive, Paper 2021\/1519. Available online: https:\/\/eprint.iacr.org\/2021\/1519."},{"key":"ref_124","unstructured":"Park, A., Lin, W.K., and Shi, E. (2025, July 12). NanoGRAM: Garbled RAM with O\u02dc(logN) Overhead. Cryptology ePrint Archive, Paper 2022\/191. Available online: https:\/\/eprint.iacr.org\/2022\/191."},{"key":"ref_125","doi-asserted-by":"crossref","unstructured":"Devadas, S., Van Dijk, M., Fletcher, C.W., Ren, L., Shi, E., and Wichs, D. (2015, January 23\u201325). Onion ORAM: A constant bandwidth blowup oblivious RAM. Proceedings of the Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland. Proceedings, Part I.","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref_126","doi-asserted-by":"crossref","unstructured":"Chen, H., Chillotti, I., and Ren, L. (2019, January 11\u201315). Onion ring ORAM: Efficient constant bandwidth oblivious RAM from (leveled) TFHE. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3354226"},{"key":"ref_127","doi-asserted-by":"crossref","unstructured":"Cong, K., Das, D., Nicolas, G., and Park, J. (2024, January 8\u201312). Panacea: Non-Interactive and Stateless Oblivious RAM. Proceedings of the 2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P), Vienna, Austria.","DOI":"10.1109\/EuroSP60621.2024.00049"},{"key":"ref_128","doi-asserted-by":"crossref","unstructured":"Gagliardoni, T., Karvelas, N.P., and Katzenbeisser, S. (2017, January 26\u201328). ORAMs in a Quantum World. Proceedings of the Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands.","DOI":"10.1007\/978-3-319-59879-6_23"},{"key":"ref_129","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., and Wen, Z. (2013, January 4\u20138). When private set intersection meets big data: An efficient and scalable protocol. Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, Berlin, Germany.","DOI":"10.1145\/2508859.2516701"},{"key":"ref_130","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2020, January 10\u201314). PSI from PaXoS: Fast, malicious private set intersection. Proceedings of the the Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia. Proceedings, Part II.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref_131","doi-asserted-by":"crossref","unstructured":"Boneh, D. (2000, January 21\u201323). Finding smooth integers in short intervals using CRT decoding. Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, USA.","DOI":"10.1145\/335305.335337"},{"key":"ref_132","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D., and Nguyen, P.Q. (2000, January 14\u201318). Noisy polynomial interpolation and noisy Chinese remaindering. Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_4"},{"key":"ref_133","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s00145-017-9263-y","article-title":"Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs","volume":"31","author":"Hazay","year":"2018","journal-title":"J. Cryptol."},{"key":"ref_134","unstructured":"Hazay, C., and Lindell, Y. (2025, July 18). Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. Available online: https:\/\/eprint.iacr.org\/2009\/459."},{"key":"ref_135","unstructured":"Gajera, H., Giraud, M., G\u00e9rault, D., Das, M.L., and Lafourcade, P. (2019, January 11\u201312). Verifiable and private oblivious polynomial evaluation. Proceedings of the IFIP International Conference on Information Security Theory and Practice: 13th IFIP WG 11.2 International Conference, WISTP 2019, Paris, France."},{"key":"ref_136","doi-asserted-by":"crossref","unstructured":"Izabach\u00e8ne, M., Nitulescu, A., de Perthuis, P., and Pointcheval, D. (2022, January 12\u201314). Myope: Malicious security for oblivious polynomial evaluation. Proceedings of the Security and Cryptography for Networks: 13th International Conference, SCN 2022, Amalfi, Italy.","DOI":"10.1007\/978-3-031-14791-3_29"},{"key":"ref_137","first-page":"103560","article-title":"A constant round quantum secure protocol for oblivious polynomial evaluation","volume":"77","author":"Mohanty","year":"2023","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_138","unstructured":"Chang, Y.C., and Lu, C.J. (2001, January 9\u201313). Oblivious polynomial evaluation and oblivious neural learning. Proceedings of the Advances in Cryptology-ASIACRYPT 2001: 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia. Proceedings 7."},{"key":"ref_139","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s11390-022-0878-6","article-title":"Unconditionally secure oblivious polynomial evaluation: A survey and new results","volume":"37","author":"Cianciullo","year":"2022","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_140","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/JCS-200116","article-title":"Efficient protocols for oblivious linear function evaluation from ring-LWE","volume":"30","author":"Baum","year":"2022","journal-title":"J. Comput. Secur."},{"key":"ref_141","doi-asserted-by":"crossref","unstructured":"de Castro, L., Juvekar, C., and Vaikuntanathan, V. (2021, January 15). Fast vector oblivious linear evaluation from ring learning with errors. Proceedings of the 9th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, Seoul, Republic of Korea.","DOI":"10.1145\/3474366.3486928"},{"key":"ref_142","unstructured":"Sun, Y., Liu, H., Yang, K., Yu, Y., Wang, X., and Weng, C. (2025, July 18). Committed Vector Oblivious Linear Evaluation and Its Applications. Available online: https:\/\/eprint.iacr.org\/2025\/1037."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/4\/62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T14:37:58Z","timestamp":1759156678000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/4\/62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,27]]},"references-count":142,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["cryptography9040062"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9040062","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,27]]}}}