{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T19:08:10Z","timestamp":1784833690324,"version":"3.55.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325747","type":"print"},{"value":"9783032325754","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32575-4_1","type":"book-chapter","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:45:45Z","timestamp":1784832345000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TAPIR: A Two-Server Authenticated PIR Scheme with\u00a0Preprocessing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8415-6237","authenticated-orcid":false,"given":"Francesca","family":"Falzon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3673-6421","authenticated-orcid":false,"given":"Laura","family":"Hetz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9535-2590","authenticated-orcid":false,"given":"Annamira","family":"O\u2019Toole","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,24]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alon, B., Beimel, A.: On the definition of malicious private information retrieval. In: The sixth Information-Theoretic Cryptography (ITC) (2025)","DOI":"10.1007\/978-3-030-71522-9_1472"},{"key":"1_CR2","unstructured":"Angel, S., Setty, S.T.V.: Unobservable communication over fully untrusted infrastructure. In: OSDI, pp. 551\u2013569. USENIX Association (2016)"},{"key":"1_CR3","unstructured":"Apple Machine Learning Research: Combining Machine Learning and Homomorphic Encryption in the Apple Ecosystem (2024). https:\/\/machinelearning.apple.com\/research\/homomorphic-encryption. Accessed 26 Sept 2025"},{"key":"1_CR4","unstructured":"Arunachalaramanan, P.S., Ren, L.: Single-server stateful PIR with verifiability and balanced efficiency. Cryptology ePrint Archive, Paper 2025\/1055 (2025). https:\/\/eprint.iacr.org\/2025\/1055"},{"key":"1_CR5","unstructured":"Asi, H., et al.: Scalable Private Search with Wally. CoRR abs\/2406.06761 (2024)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Tu, Y.: Improved constructions for distributed multi-point functions. In: 2025 IEEE Symposium on Security and Privacy, pp. 2414\u20132432. IEEE Computer Society Press (2025). https:\/\/doi.org\/10.1109\/SP61157.2025.00044","DOI":"10.1109\/SP61157.2025.00044"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1292\u20131303. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"1_CR9","unstructured":"de\u00a0Castro, L., Lee, K.: VeriSimplePIR: verifiability in SimplePIR at no online cost for honest servers. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/de-castro"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Celi, S., Davidson, A.: Call me by my name: simple, practical private information retrieval for keyword queries. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, pp. 4107\u20134121. ACM Press (2024). https:\/\/doi.org\/10.1145\/3658644.3670271","DOI":"10.1145\/3658644.3670271"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Chase, M., Deshpande, A., Ghosh, E., Malvai, H.: SEEMless: secure end-to-end encrypted messaging with less trust. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 1639\u20131656. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363202","DOI":"10.1145\/3319535.3363202"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, R., et al.: Talek: private group messaging with hidden access patterns. In: ACSAC, pp. 84\u201399. ACM (2020)","DOI":"10.1145\/3427228.3427231"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS, pp. 41\u201350. IEEE Computer Society Press (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"1_CR15","unstructured":"Colombo, S., Nikitin, K., Corrigan-Gibbs, H., Wu, D.J., Ford, B.: Authenticated private information retrieval. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 3835\u20133851. USENIX Association (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/colombo"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with sublinear amortized time. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 3\u201333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-45721-1_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Corrigan-Gibbs","year":"2020","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 44\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Dietz, M., Tessaro, S.: Fully malicious authenticated PIR. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 113\u2013147. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_4","DOI":"10.1007\/978-3-031-68400-5_4"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964). https:\/\/doi.org\/10.1145\/364520.364540","DOI":"10.1145\/364520.364540"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Eriguchi, R., Kurosawa, K., Nuida, K.: On the optimal communication complexity of error-correcting multi-server PIR. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0III. LNCS, vol. 13749, pp. 60\u201388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22368-6_3","DOI":"10.1007\/978-3-031-22368-6_3"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Falk, B.H., Mishra, P., Shtepel, M.: Malicious security for PIR (almost) for free. In: CRYPTO 2025, Part I. LNCS. Springer, Cham (2025)","DOI":"10.1007\/978-3-032-01913-4_6"},{"key":"1_CR23","unstructured":"Falzon, F., Hetz, L., O\u2019Toole, A.: TAPIR: a two-server authenticated PIR scheme with preprocessing. Cryptology ePrint Archive, Paper 2025\/2177 (2025). https:\/\/eprint.iacr.org\/2025\/2177"},{"key":"1_CR24","unstructured":"Fisher, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research. Hafner Publishing Company (1953)"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Zhou, M., Shi, E.: Efficient pre-processing PIR without public-key cryptography. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 210\u2013240. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_8","DOI":"10.1007\/978-3-031-58751-1_8"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Zhou, M., Shi, E., Peng, B.: Pseudorandom functions with weak programming privacy and applications to private information retrieval. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0VII. LNCS, vol. 15607, pp. 284\u2013313. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_11","DOI":"10.1007\/978-3-031-91098-2_11"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"1_CR28","unstructured":"G\u00f6bel, T., Huigens, D.: Proton Key Transparency Whitepaper (2024). https:\/\/proton.me\/files\/proton_keytransparency_whitepaper.pdf. Accessed 26 Sept 2025"},{"key":"1_CR29","unstructured":"Google, Inc.: Key Transparency (2024). https:\/\/github.com\/google\/keytransparency. Accessed 26 Sept 2025"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: Pointproofs: aggregating proofs for multiple vector commitments. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 2007\u20132023. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417244","DOI":"10.1145\/3372297.3417244"},{"key":"1_CR31","unstructured":"Hao, M., et al.: Practical keyword private information retrieval from key-to-index mappings. In: USENIX Security 2025. USENIX Association (2025)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Henzinger, A., Dauterman, E., Corrigan-Gibbs, H., Zeldovich, N.: Private web search with tiptoe. In: SOSP, pp. 396\u2013416. ACM (2023)","DOI":"10.1145\/3600006.3613134"},{"key":"1_CR33","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. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 3889\u20133905. USENIX Association (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/henzinger"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Hu, Y., Hooshmand, K., Kalidhindi, H., Yang, S.J., Popa, R.A.: Merkle$$^2$$: a low-latency transparency log system. In: 2021 IEEE Symposium on Security and Privacy, pp. 285\u2013303. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00088","DOI":"10.1109\/SP40001.2021.00088"},{"key":"1_CR35","unstructured":"keybase.io: Keybase Chat. book.keybase.io\/docs\/chat (2022). Accessed 26 Sept 2025"},{"key":"1_CR36","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3. Pearson Education (1997)"},{"key":"1_CR37","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private blocklist lookups with checklist. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 875\u2013892. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/kogan"},{"key":"1_CR38","unstructured":"KT Internet Engineering Task Force Working Group: Key Transparency (keytrans) (2025). https:\/\/datatracker.ietf.org\/wg\/keytrans\/about\/. Accessed 26 Sept 2025"},{"key":"1_CR39","unstructured":"K\u00fclaots, E., Krips, T., Eerikson, H., Pullonen-Raudvere, P.: SLAMP-FSS: two-party multi-point function secret sharing from simple linear algebra. Cryptology ePrint Archive, Report 2024\/1394 (2024). https:\/\/eprint.iacr.org\/2024\/1394"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th FOCS, pp. 364\u2013373. IEEE Computer Society Press (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646125","DOI":"10.1109\/SFCS.1997.646125"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Lazzaretti, A., Papamanthou, C.: TreePIR: sublinear-time and polylog-bandwidth private information retrieval from DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 284\u2013314. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_10","DOI":"10.1007\/978-3-031-38545-2_10"},{"key":"1_CR42","unstructured":"Lazzaretti, A., Papamanthou, C.: Single pass client-preprocessing private information retrieval. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/lazzaretti"},{"key":"1_CR43","unstructured":"Lewi, K., Lawlor, S.: Introducing Auditable Key Transparency for End-to-End Encrypted Messaging (2023). https:\/\/engineering.fb.com\/2023\/04\/13\/security\/whatsapp-key-transparency\/. Accessed 26 Sept 2025"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: PerfOMR: oblivious message retrieval with reduced communication and computation. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/liu-zeyu","DOI":"10.1109\/SP54263.2024.00115"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Malvai, H., et al.: Parakeet: practical key transparency for end-to-end encrypted messaging. In: NDSS 2023. The Internet Society (2023)","DOI":"10.14722\/ndss.2023.24545"},{"key":"1_CR46","unstructured":"Melara, M.S., Blankstein, A., Bonneau, J., Felten, E.W., Freedman, M.J.: CONIKS: bringing key transparency to end users. In: Jung, J., Holz, T. (eds.) USENIX Security 2015, pp. 383\u2013398. USENIX Association (2015). https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/melara"},{"key":"1_CR47","unstructured":"Meta: WhatsApp Key Transparency Overview (2023). https:\/\/www.whatsapp.com\/security\/WhatsApp-Key-Transparency-Whitepaper.pdf. Accessed 26 Sept 2025"},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Tomescu, A., Bhupatiraju, V., Papadopoulos, D., Papamanthou, C., Triandopoulos, N., Devadas, S.: Transparency logs via append-only authenticated dictionaries. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 1299\u20131316. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3345652","DOI":"10.1145\/3319535.3345652"},{"key":"1_CR49","unstructured":"Wang, Y., Liu, X., Zhang, J., Liu, J., Yang, X.: Crust: Verifiable and efficient private information retrieval with sublinear online time. Cryptology ePrint Archive, Report 2023\/1607 (2023). https:\/\/eprint.iacr.org\/2023\/1607"},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Zhou, M., Park, A., Zheng, W., Shi, E.: Piano: extremely simple, single-server PIR with sublinear server computation. In: 2024 IEEE Symposium on Security and Privacy, pp. 4296\u20134314. IEEE Computer Society Press (2024). https:\/\/doi.org\/10.1109\/SP54263.2024.00055","DOI":"10.1109\/SP54263.2024.00055"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32575-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:45:48Z","timestamp":1784832348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32575-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,24]]},"ISBN":["9783032325747","9783032325754"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32575-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,24]]},"assertion":[{"value":"24 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}