{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:00:19Z","timestamp":1778497219434,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":82,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690326","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"1448-1462","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1154-2277","authenticated-orcid":false,"given":"Ben","family":"Fisch","sequence":"first","affiliation":[{"name":"Yale University, New Haven, Connecticut, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4288-2850","authenticated-orcid":false,"given":"Arthur","family":"Lazzaretti","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, Connecticut, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7291-3106","authenticated-orcid":false,"given":"Zeyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, Connecticut, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1905-9403","authenticated-orcid":false,"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, Connecticut, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_2_1","first-page":"169","volume-title":"Scott","author":"Albrecht M.R.","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Journal of Mathematical Cryptology pp. 169--203 (2015)"},{"key":"e_1_3_2_1_3_1","volume-title":"M.: Ciphers for MPC and FHE. In: EUROCRYPT 2015","author":"Albrecht M.R.","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: EUROCRYPT 2015, Part I (2015)"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976014.2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559364"},{"key":"e_1_3_2_1_7_1","first-page":"55","volume-title":"Zhang","author":"Bai S.","year":"2019","unstructured":"Bai, S., Boudgoust, K., Das, D., Roux-Langlois, A., Wen, W., Zhang, Z.: Middleproduct learning with rounding problem and its applications. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology -- ASIACRYPT 2019. pp. 55--81. Springer International Publishing, Cham (2019)"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--44598--6--4"},{"key":"e_1_3_2_1_10_1","volume-title":": Mathematical Theory of Connecting Networks and Telephone Traffic","author":"Bene","year":"1965","unstructured":"Bene?, V.E.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press (1965), google-Books-ID: nQcjAAAAMAAJ"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"e_1_3_2_1_12_1","first-page":"415","volume-title":"Montgomery","author":"Boneh D.","year":"2017","unstructured":"Boneh, D., Kim, S., Montgomery, H.: Private Puncturable PRFs from Standard Lattice Assumptions. In: Coron, J.S., Nielsen, J.B. (eds.) Advances in Cryptology -- EUROCRYPT 2017. pp. 415--445. Lecture Notes in Computer Science, Springer International Publishing, Cham (2017)"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--70503--3--22"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_17_1","first-page":"505","volume-title":"Vaikuntanathan","author":"Brakerski Z.","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully Homomorphic Encryption from Ring- LWE and Security for Key Dependent Messages. In: Rogaway, P. (ed.) Advances in Cryptology -- CRYPTO 2011. pp. 505--524. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (2011)"},{"key":"e_1_3_2_1_18_1","volume-title":"Chen","author":"Canetti R.","year":"2017","unstructured":"Canetti, R., Chen, Y.: Constraint-Hiding Constrained PRFs for NC^1from LWE. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT 2017. Springer International Publishing, Cham (2017)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"e_1_3_2_1_21_1","volume-title":"ON THE NEW AKS SORTING NETWORK","author":"Chv\u00e1tal V.","year":"1992","unstructured":"Chv\u00e1tal, V.: ON THE NEW AKS SORTING NETWORK (1992), https:\/\/www. semanticscholar.org\/paper\/ON-THE-NEW-AKS-SORTING-NETWORKChv% C3%A1tal\/9a178081dc3ba74aa6859436489c6766ac94598b?p2df"},{"key":"e_1_3_2_1_22_1","volume-title":"Raddum","author":"Cid C.","year":"2022","unstructured":"Cid, C., Indr\u00f8y, J.P., Raddum, H.: Fasta -- a stream cipher for fast fhe evaluation. In: Galbraith, S.D. (ed.) Topics in Cryptology -- CT-RSA 2022 (2022)"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 32nd USENIX Conference on Security Symposium. USA (Aug 2023)","author":"Colombo S.","unstructured":"Colombo, S., Nikitin, K., Corrigan-Gibbs, H., Wu, D.J., Ford, B.: Authenticated private information retrieval. In: Proceedings of the 32nd USENIX Conference on Security Symposium. USA (Aug 2023)"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031-07085--3_1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--45721--1--3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22969-5_2"},{"key":"e_1_3_2_1_28_1","first-page":"344","volume-title":"V\u00f6cking","author":"Czumaj A.","year":"2014","unstructured":"Czumaj, A., V\u00f6cking, B.: Thorp Shuffling, Butterflies, and Non-Markovian Couplings. In: Automata, Languages, and Programming. pp. 344--355. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (2014)"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0022"},{"key":"e_1_3_2_1_30_1","first-page":"665","volume":"202","author":"Deo A.","year":"2024","unstructured":"Deo, A., Joye,M., Libert, B., Curtis, B.R., de Bellabre, M.: Homomorphic evaluation of LWR-based PRFs and application to transciphering. Cryptology ePrint Archive, Paper 2024\/665 (2024), https:\/\/eprint.iacr.org\/2024\/665","journal-title":"Paper"},{"key":"e_1_3_2_1_31_1","volume-title":"Tessaro","author":"Dietz M.","year":"2023","unstructured":"Dietz, M., Tessaro, S.: Fully Malicious Authenticated PIR (2023), https:\/\/eprint. iacr.org\/2023\/1804, publication info: Preprint."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2023.i3.30-73"},{"key":"e_1_3_2_1_34_1","first-page":"144","volume":"201","author":"Fan J.","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012), https:\/\/ia.cr\/2012\/144","journal-title":"Report"},{"key":"e_1_3_2_1_35_1","first-page":"482","volume":"202","author":"Fisch B.","year":"2024","unstructured":"Fisch, B., Lazzaretti, A., Liu, Z., Papamanthou, C.: ThorPIR: Single server PIR via homomorphic thorp shuffles. Cryptology ePrint Archive, Paper 2024\/482 (2024), https:\/\/eprint.iacr.org\/2024\/482","journal-title":"Paper"},{"key":"e_1_3_2_1_36_1","volume-title":"Yates","author":"Fisher R.A.","year":"1963","unstructured":"Fisher, R.A., Yates, F.: Statistical tables for biological, agricultural and medical research. Edinburgh: Oliver and Boyd (1963), https:\/\/digital.library.adelaide.edu. au\/dspace\/handle\/2440\/10701"},{"key":"e_1_3_2_1_37_1","volume-title":"Ta-Shma","author":"Gelman E.","year":"2014","unstructured":"Gelman, E., Ta-Shma, A.: The Benes Network is q*(q-1)\/2n-Almost q-set-wise Independent (2014), https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs. FSTTCS.2014.327"},{"key":"e_1_3_2_1_38_1","volume-title":"ACM Symposium on Theory of Computing. ACM (2009)","author":"Gentry C.","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM Symposium on Theory of Computing. ACM (2009)"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8727-6_9"},{"key":"e_1_3_2_1_40_1","volume-title":"Ishai","author":"Gilboa N.","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed Point Functions and Their Applications. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology -- EUROCRYPT 2014. Springer (2014)"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38548-3_11"},{"key":"e_1_3_2_1_42_1","volume-title":"Cho","author":"Ha J.","year":"2020","unstructured":"Ha, J., Kim, S., Choi,W., Lee, J., Moon, D., Yoon, H., Cho, J.: Masta: An he-friendly cipher using modular arithmetic. IEEE Access (2020)"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0061"},{"key":"e_1_3_2_1_45_1","volume-title":"Vaikuntanathan","author":"Henzinger A.","year":"2022","unstructured":"Henzinger, A., Hong, M.M., Corrigan-Gibbs, H., Meiklejohn, S., Vaikuntanathan, V.: One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval p. 27 (2022)"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1208.1176"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Holmgren J. Canetti R. Richelson S.: Towards Doubly Efficient Private Information Retrieval. Tech. Rep. 568 (2017) https:\/\/eprint.iacr.org\/2017\/568","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"e_1_3_2_1_48_1","volume-title":"H.: Private Blocklist Lookups with Checklist. In: 30th USENIX Security Symposium (USENIX Security 21)","author":"Kogan D.","year":"2021","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private Blocklist Lookups with Checklist. In: 30th USENIX Security Symposium (USENIX Security 21). USENIX Association (2021), https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/kogan"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133991"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--48618-0_14"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_10"},{"key":"e_1_3_2_1_53_1","volume-title":"Papamanthou","author":"Lazzaretti A.","year":"2024","unstructured":"Lazzaretti, A., Papamanthou, C.: Single Pass Client Preprocessing Private Information Retrieval. In: USENIX Security 2024 (2024), https:\/\/eprint.iacr.org\/2024\/303"},{"key":"e_1_3_2_1_54_1","volume-title":"Wichs","author":"Lin W.K.","year":"2022","unstructured":"Lin,W.K., Mook, E., Wichs, D.: Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE (2022), https:\/\/eprint. iacr.org\/2022\/1703, report Number: 1703"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30634-1_10"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92062-3_8"},{"key":"e_1_3_2_1_57_1","volume-title":"Wang","author":"Liu Z.","year":"2023","unstructured":"Liu, Z., Wang, Y.: Amortized functional bootstrapping in less than 7 ms, with \u00d5(1) polynomial multiplications. Springer, Heidelberg, Germany (2023)"},{"key":"e_1_3_2_1_58_1","first-page":"172","volume":"202","author":"Liu Z.","year":"2024","unstructured":"Liu, Z.,Wang, Y.: Relaxed functional bootstrapping: A new perspective on bgv\/bfv bootstrapping. Cryptology ePrint Archive, Paper 2024\/172 (2024), https:\/\/eprint. iacr.org\/2024\/172, https:\/\/eprint.iacr.org\/2024\/172","journal-title":"Paper"},{"key":"e_1_3_2_1_59_1","volume-title":"Angel","author":"Ma Y.","year":"2022","unstructured":"Ma, Y., Ke, Z., Rabin, T., Angel, S.: Incremental Offline\/Online PIR (extended version). In: USENIX Security 2022 (2022), https:\/\/eprint.iacr.org\/2021\/1438"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"e_1_3_2_1_62_1","volume-title":"https:\/\/github.com\/Microsoft\/SEAL","author":"Microsoft","year":"2020","unstructured":"Microsoft SEAL (release 3.6). https:\/\/github.com\/Microsoft\/SEAL (2020), Microsoft Research, Redmond, WA."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOP409"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--55220--5_18"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_17"},{"key":"e_1_3_2_1_66_1","volume-title":"Ren","author":"Mughees M.H., I, S.","year":"2023","unstructured":"Mughees, M.H., I, S., Ren, L.: Simple and Practical Amortized Sublinear Private Information Retrieval (2023), https:\/\/eprint.iacr.org\/2023\/1072, preprint."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--43951--7_47"},{"key":"e_1_3_2_1_68_1","volume-title":"Weinert","author":"Okada H.","year":"2024","unstructured":"Okada, H., Player, R., Pohmann, S., Weinert, C.: Towards Practical Doubly-Efficient Private Information Retrieval. Financial Cryptography and Data Security 2024 (2024)"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3265583"},{"key":"e_1_3_2_1_70_1","volume-title":"Yeo","author":"Patel S.","year":"2017","unstructured":"Patel, S., Persiano, G., Yeo, K.: CacheShuffle: An Oblivious Shuffle Algorithm Using Caches. ArXiv (May 2017), https:\/\/www.semanticscholar.org\/ paper\/CacheShuffle%3A-An-Oblivious-Shuffle-Algorithm-Using-Patel-Persiano\/ba94758018b03a6f6ccfddf92d311c3ded44964f"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840378"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3219049"},{"key":"e_1_3_2_1_74_1","series-title":"Jul 2013","volume-title":"An Introductory Course in Elementary Number Theory","author":"Raji W.","unstructured":"Raji, W.: An Introductory Course in Elementary Number Theory (Jul 2013)"},{"key":"e_1_3_2_1_75_1","volume-title":"Dertouzos","author":"Rivest R.L.","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of Secure Computation (1978)"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1973.10481434"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_78_1","first-page":"1005","volume":"202","author":"Wang W.","year":"2024","unstructured":"Wang, W., Tang, D.: Differential fault attack on HE-friendly stream ciphers: Masta, pasta and elisabeth. Cryptology ePrint Archive, Paper 2024\/1005 (2024), https:\/\/eprint.iacr.org\/2024\/1005, https:\/\/eprint.iacr.org\/2024\/1005","journal-title":"Paper"},{"key":"e_1_3_2_1_79_1","volume-title":"Yang","author":"Wang Y.","year":"2023","unstructured":"Wang, Y., Zhang, J., Liu, J., Yang, X.: Crust: Verifiable And Efficient Private Information Retrieval with Sublinear Online Time (2023), https:\/\/eprint.iacr.org\/2023\/1607, publication info: Preprint."},{"key":"e_1_3_2_1_80_1","first-page":"392","volume-title":"Lu","author":"Wei B.","year":"2023","unstructured":"Wei, B., Wang, R., Li, Z., Liu, Q., Lu, X.: Fregata: Faster homomorphic evaluation of aes via tfhe. In: Athanasopoulos, E., Mennink, B. (eds.) Information Security. pp. 392--412. Springer Nature Switzerland, Cham (2023)"},{"key":"e_1_3_2_1_81_1","volume-title":"Shi","author":"Zhou M.","year":"2022","unstructured":"Zhou, M., Lin, W.K., Tselekounis, Y., Shi, E.: Optimal Single-Server Private Information Retrieval. ePrint IACR (2022)"},{"key":"e_1_3_2_1_82_1","volume-title":"Zheng","author":"Zhou M.","year":"2023","unstructured":"Zhou, M., Park, A., Shi, E., Zheng, W.: Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation (2023), https:\/\/eprint.iacr.org\/2023\/452, IEEE S&P 2024"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:15:47Z","timestamp":1755843347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":82,"alternative-id":["10.1145\/3658644.3690326","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690326","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}