XPIR: Private information retrieval for everyone
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
A Private Information Retrieval (PIR) scheme is a protocol in which a user retrieves a record from a database while hiding which from the database administrators. PIR can be achieved using mutuallydistrustful replicated databases, trusted hardware, or cryptography. In this paper we focus on the later setting which is known as single-database computationally- Private Information Retrieval (cPIR). Classic cPIR protocols require that the database server executes an algorithm over all the database content at very low speeds which impairs their usage. In [1], given certain assumptions, realistic at the time, Sion and Carbunar showed that cPIR schemes were not practical and most likely would never be. To this day, this conclusion is widely accepted by researchers and practitioners. Using the paradigm shift introduced by lattice-based cryptography, we show that the conclusion of Sion and Carbunar is not valid anymore: cPIR is of practical value. This is achieved without compromising security, using standard crytosystems, and conservative parameter choices.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Furthermore, Koh et al. [276] recently showed that many heuristic defenses based on data sanitization remain vulnerable to adaptive poisoning attacks, suggesting that even a federated approach to data sanitization may not be enough to defend against data poisoning.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [276]
Citations
Cites
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250 · cited 7×
“Parameters are dependent on each cryptographic system: ** NoCryptography if a trivial full database download is to be done after which PIRClient stores only the element the user is interested in. ** Paillier:A:B:C if Paillier’s cryptosystem is to be used with A security bits, a plaintext modulus of B bits and a cipher…”
BackgroundInfluentialGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603 · cited 1×
“This property offers strong guaranties on ciphertext secrecy as proved by Goldwasser and Micali [50].”
BackgroundOn Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Ohm, J.-R., Sullivan, G. J., Schwarz, H., Tan, T. K., & Wiegand, T. (2012) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2221192 · Cited by 1,279 · cited 1×
“265 - High Efficiency Video Coding (HEVC) is the forthcoming standard for video-streams compression[44, 45].”
BackgroundFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096 · cited 8×
“This is basically the symmetric homomorphic encryption scheme of [28] with a composite modulus.”
BackgroundMethodInfluentialReplication is not needed: single database, computationally-private information retrieval
Kushilevitz, E., & Ostrovsky, R. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646125 · Cited by 932
Better Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688 · cited 2×
“Each of the encryption schemes has a predefined list of possible parameters for security varying from 80 to 256 bits (following NIST recommendations for factoring-based cryptography for Paillier and [32] for lattice-based schemes).”
MethodKeyword Search and Oblivious Pseudorandom Functions
Freedman, M. J., Ishai, Y., Pinkas, B., & Reingold, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_17 · Cited by 441 · cited 1×
“The basic idea of private keyword search [34] is that the database can arrange its elements by grouping them us-ing keywords.”
Background
Cited by
Items 101–184 of 184
BitBatSPIR: Efficient Batch Symmetric Private Information Retrieval From PSI
Li, S., Peng, L., Liu, W., Zhang, C., Gu, Z., & Lin, D. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3579365 · Cited by 2
“This situation was changed by the work of [14], which designed the first practical PIR protocol using lattice-based homomorphic encryption.”
Proof of Censorship: Enabling Centralized Censorship-Resistant Content Providers
Martiny, I., Miers, I., & Wustrow, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-662-58387-6_6 · Cited by 2
“The PIR library that we use (XPIR [2]) provides two optimizations: recursion and aggregation.”
MethodTowards Efficient FHE Based cPIR Schemes and Their Parameter Selection
Yakupoglu, C., & Rohloff, K. R. (2022) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3538969.3544417 · Cited by 2
Blockchain Query Framework Based on Trusted Execution Environment
Zhang, Y., Wu, Y., Wang, J., Liu, B., Liu, A., & Chen, X. (2024) · International Conference on Computing, Networks and Internet of Things (CNIOT) · doi:10.1145/3670105.3670135 · Cited by 2
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
Verma, N., & Hollanti, C. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619469 · Cited by 7
Single server private information retrieval protocols with codes over rings
Bodur, Ş., Martı́nez-Moro, E., & Ruano, D. (2025) · Journal of Algebra and Its Applications · doi:10.1142/s0219498825410129 · Cited by 2
On Computational Shortcuts for Information-Theoretic PIR
Hong, M. M., Ishai, Y., Kolobov, V. I., & Lai, R. W. F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64375-1_18 · Cited by 2
Short Paper: Industrial Feasibility of Private Information Retrieval
Jäschke, A., Grohmann, B., Armknecht, F., & Schaad, A. (2017) · International Joint Conference on e-Business and Telecommunications (ICETE) · doi:10.5220/0006382003950400 · Cited by 2
“Publications following this general idea are (Kushilevitz and Ostrovsky, 1997), (Chang, 2004), (Melchor et al., 2016) (Group Homomorphic), (Trostle and Parrish, 2010) (Trapdoor Group), (Kiayias et al., 2015; Lipmaa, 2009; Ishai and Paskin, 2007) (Branching Programs), (Melchor and Gaborit, 2007)…”
BackgroundRevisiting Multivariate Lattices for Encrypted Signal Processing
Pedrouzo-Ulloa, A., Troncoso-Pastoriza, J. R., & Pérez‐González, F. (2019) · ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec) · doi:10.1145/3335203.3335730 · Cited by 2
“Due to this lack of flexibility, lattice cryptosystems (which present aringhomomorphism)arebeingprogressivelyadoptedbyresearchers in the field [2, 3, 16, 19, 34].”
BackgroundInformation-Theoretically Secure and Highly Efficient Search and Row Retrieval
Sharma, S., Li, Y., Mehrotra, S., Panwar, N., Kumari, K., & Roychoudhury, S. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3603581.3603582 · Cited by 2
“However, in keyword search protocol [37], the query size and computation cost at a server will be equal to all possible combinations of unique keywords across all columns of a database (see §2.3 of [57]).”
BackgroundInfluentialA Paged Domain Name System for Query Privacy
Asoni, D. E., Hitz, S., & Perrig, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-02641-7_12 · Cited by 2
“Unfortunately, even with recent improvements [14,4], PIR has remained too costly in terms of computation to be used for a critical application like DNS.”
BackgroundIncremental Offline/Online PIR (extended version).Preprint
Ma, Y., Zhong, K., Rabin, T., & Angel, S. (2021) · IACR Cryptology ePrint Archive · Cited by 2
A Ring-LWE-based digital signature inspired by Lindner–Peikert scheme
Sharafi, J., & Daghigh, H. (2022) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2021-0013 · Cited by 1
“…over poly - nomial rings, we have to choose our ring so that the multiplication operation has a very e ffi cient imple - mentation via the Number Theoretic Transform ( NTT ) , see e.g., [ 29,30 ] , which is just a version of FFT that works over the fi nite fi eld q rather than over the complex numbers.”
MethodVPIR: an efficient verifiable private information retrieval scheme resisting malicious cloud server
Zhang, W., Shang, S., Wang, H., Cai, Z., Zhao, Y., & Li, X. (2024) · Telecommunication Systems · doi:10.1007/s11235-024-01162-1 · Cited by 2
Periscoping: Private Key Distribution for Large-Scale Mixnets
Liu, S., Chen, L., & Fu, Y. (2024) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom52122.2024.10621274 · Cited by 1
“The state-of-the-art practical single-server PIR schemes [24]–[26] are based on some forms of fully homomorphic encryption, such as BGV [27], BFV [28], [29], and RGSW [30], [31].”
BackgroundBstPIR: Keyword Private Information Retrieval Based on Binary Search Trees
Xu, K., Su, L., He, S., Chen, S., & Geng, H. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3546291 · Cited by 1
“Such solutions usually rely on cryptographic intractability, such as the quadratic residuosity assumption [16] or average-case hardness assumptions over lattice [3], [8].”
Finding Balance in Unbalanced PSI: A New Construction from Single-Server PIR
Lin, C., Liu, Z., Miao, P., & Tromanhauser, M. (2025) · IACR Communications in Cryptology · doi:10.62056/angy4fvtw · Cited by 1
“Achieving concretely efficient PIR constructions for practical applications has been an active area of research [DC14, KLL + 15, GLM16, ABFK16, ACLS18, GH19, PT20, ALP + 21a, MCR21, MW22, LLM22].”
Zhang, L., Jia, Y., & Wu, Q. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.115139 · Cited by 1
A New Method for Computational Private Information Retrieval
Tillem, G., Savaş, E., & Kaya, K. (2017) · The Computer Journal · doi:10.1093/comjnl/bxx025 · Cited by 1
“Here we extend the discussion by comparing the proposed CPIR scheme with those in two recent papers [23] and XPIR [24], emphasizing bandwidth requirements.”
BackgroundMethodResultInfluentialPrivacy-aware Character Pattern Matching over Outsourced Encrypted Data
Mainardi, N., Barenghi, A., & Pelosi, G. (2021) · Digital Threats Research and Practice · doi:10.1145/3462333 · Cited by 1
“In particular, XPIR [29] and SealPIR [1] are two recently proposed PIR solutions that improve upon the scheme introduced by Stern in Reference [37] showing significant improvements in terms of computation by relying on lattice-based additive homomorphic encryption schemes instead of…”
BackgroundSearch and Permission Request Over Encrypted Database
Tjuawinata, I., Zhao, Y., Shen, B., Lam, K., & Chi, C. (2023) · International Conference on ICT for Smart Society (ICISS) · doi:10.1109/iciss59129.2023.10291415 · Cited by 1
About Cloud Request Protection
Варновский, Н. П., Martishin, S. A., Khrapchenko, M. V., & Shokurov, A. V. (2023) · Proceedings of the Institute for System Programming of RAS · doi:10.15514/ispras-2022-35(5)-3 · Cited by 1
Street Rep: A Privacy-Preserving Reputation Aggregation System
Hauser, C., Nilizadeh, S., Shoshitaishvili, Y., Trieu, N., Ravi, S., Kruegel, C., & Vigna, G. (2024) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-64954-7_18 · Cited by 1
“Most PIR schemes, including XPIR, do not ensure database confidentiality.”
MethodInfluentialAn Efficient and Secure Anonymous Query Protocol
Hu, W., & Yin, L. (2024) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom63139.2024.00297 · Cited by 1
Symmetric Private Shortest Path Retrieval for LM-Enabled Route Services on Consumer Devices
Liu, X., Lyu, F., Lei, J., Yang, M., Yau, K. A., & Lin, Y. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3573179 · Cited by 1
“Using the NTT-CRT form, the computational cost of multiplying elements in two polynomial rings is reduced from O ( n 2 × log 2 τ) to O ( n × log τ) [28], where n is the degree of the polynomials and τ is the modulus.”
Efficient Private Information Retrieval Scheme with Dynamic Database
Li, X., Xu, W., Tang, D., Cao, Y., Zhang, J., & Zhao, W. (2025) · Electronics · doi:10.3390/electronics14173441 · Cited by 1
Enabling Privacy-assured Mobile Advertisement Targeting and Dissemination
Shi, Z., Liu, X., & Yuan, X. (2017) · International Workshop on Security in Cloud Computing (SCC) · doi:10.1145/3055259.3055269 · Cited by 1
Privacy-Assured Large-Scale Navigation from Encrypted Approximate Shortest Path Recommendation
Shi, Z. (2018) · Communications in computer and information science · doi:10.1007/978-981-10-8890-2_14 · Cited by 1
One Improved RLWE-based FHE and Fast Private Information Retrieval
Song, W., & Zhao, B. H. A. X.-F. (2019) · KSII Transactions on Internet and Information Systems · doi:10.3837/tiis.2019.12.025 · Cited by 1
Xu, W., Wang, B., Lu, R., Qu, Q., Chen, Y., & Hu, Y. (2021) · Security and Communication Networks · doi:10.1155/2021/5553256 · Cited by 1
Distributed systems and trusted execution environments : trade-offs and challenges
Pires, R. P. (2019) · doi:10.35662/unine-thesis-2812 · Cited by 2
“They generally rely on heavy cryptographic protocols that are still unpractical [153], especially when data stores contain millions of documents, which is the case of search engines.”
BackgroundArgus: A Fully Transparent Incentive System for Anti-Piracy Campaigns (Extended Version)Preprint
Zhang, X., Guo, X., Zeng, Z., Liu, W., Guo, Z., Chen, Y., Chen, S., Yin, Q., Yang, M., & Zhou, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.06049 · Cited by 1
“ShareData includes two phases, OT (Section V) and PIR (Section VI).”
BackgroundMethodInfluentialPartial Server Side Parameter Selection in Private Information Retrieval
Vannet, T., & Kunihiro, N. (2016) · Asia Joint Conference on Information Security (AsiaJCIS) · doi:10.1109/asiajcis.2016.27
“Finally, Section VII describes how the techniques detailed previously can also be applied to the Ring-LWE-based scheme from [11].”
BackgroundMethodInfluentialTowards the Use of Graph Summaries for Privacy Enhancing Release and Querying of Linked Data
Heitmann, B., Hermsen, F., & Decker, S. (2016) · RWTH Publications (RWTH Aachen)
Similarity Based Interactive Private Information Retrieval
Dara, S., & Muralidhara, V. N. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71501-8_9
What Storage Access Privacy is Achievable with Small Overhead?Preprint
Patel, S., Persiano, G., & Yeo, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.05452
“The majority of PIR constructions use homomorphic encryption [2, 4] or other expensive encryptions with useful properties [12, 24, 35].”
BackgroundOctopus: Privacy-Preserving Collaborative Evaluation of Loan StackingPreprint
Li, Y., Gao, K., Duan, Y., & Xu, W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02234
“Systems like XPIR [9] and SealPIR [10] employ somewhat fully homomorphic encryption (FHE).”
BackgroundMethodInfluentialOn single server private information retrieval in a coding theory perspectivePreprint
Alfarano, G. N., Khathuria, K., & Weger, V. (2020) · Zurich Open Repository and Archive (University of Zurich) · doi:10.48550/arxiv.2008.06417
“The rest of the examples are based on the existing PIR schemes [13], [19] and [1], respectively.”
BackgroundMethodInfluentialNguyen, T., Asghar, H. J., Bhakar, R., Kaafar, D., & Farokhi, F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09904
“This may appear similar to the PIR setting [Yekhanin, 2010, Aguilar Melchor et al., 2016].”
BackgroundMethodArgus: A Fully Transparent Incentive System for Anti-Piracy Campaigns
Zhang, X., Guo, X., Zeng, Z., Liu, W., Guo, Z., Chen, Y., Chen, S., Yin, Q., & Yang, M. (2021) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds53918.2021.00023
Oldenburg, L., & Tschorsch, F. (2021) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3465481.3469189
“Highly optimized schemes exist in prototypes [1–3], but CPIR typically still incurs significant computation and communication overhead over ITPIR.”
BackgroundPrivately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party
Hildebrandt, A. K., Althaus, E., & Hildebrandt, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-93043-1_4
Angel, S. (2022) · Springer eBooks · doi:10.1007/978-3-642-27739-9_1792-1
Parallel private information retrieval protocol with index anonymity for untrusted databases
Yu, X., Tang, D., Zhao, Z., & Zhao, W. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101903
Receiver Efficient Location-Based Service Scheme by OT Using PKE
Yadav, V. K., Agarwal, K., Aggarwal, S., Yadav, A., & Dagar, I. (2024) · International Conference on Intelligent Systems for Cybersecurity (ISCS) · doi:10.1109/iscs61804.2024.10581002
“The receiver-efficient scheme proposed here ensures Private Information Retrieval (PIR), [16], i.e. the vehicle user can retrieve data from the database without revealing which particular query they are interested in. Authorized licensed use limited to the terms of the applicable license agreement…”
BackgroundSingle-Server PIR via NTRU-Based FHE: Simpler, Smaller, and Faster
Xia, H., & Wang, M. (2024) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp60621.2024.00023
“However, lattice-based constructions of single-server PIR [1, 4, 6, 30, 38, 47, 64, 67, 70] have made significant advancements, far surpassing the trivial PIR in terms of efficiency.”
BackgroundAn Efficient Private Information Retrieval Protocol Based on TFHE
Tian, H., & Lin, Y. (2024) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-64948-6_24
Angel, S. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_1792
Enhanced PIR Scheme Combining SimplePIR and Spiral: Achieving Higher Throughput Without Client Hints
Xu, H., Li, Y., & Tian, H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-4566-4_21
Li, F., Tang, D., Huang, Y., Xu, W., Wei, X., Li, X. S., Cao, Y., & Zhao, W. (2025) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda64898.2025.11030467
EAPIR: Efficient and Authenticated Private Information Retrieval with Fast Server Processing
Shen, H., Li, X., Fan, Z., Wu, G., & Zhang, M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-9101-2_20
Fast Private Retrieval on Key-Value Store with Multiple Values per Key
Dong, F., Wang, P., Wang, Y., Zhang, C., & Cui, L. (2025) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65448.2025.00203
HADES: Range-Filtered Private Aggregation on Public Data
Liu, X., Trieu, N., Gupta, T., Ahmad, I., & Song, D. X. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3734839.3734852
“( The use of encrypted indicator vectors in HADES resembles that of existing PIR solutions, such as XPIR [19], that select one record from a set of records.”
BCPIR: More Efficient Keyword PIR via Block Building Codewords
Wang, S., Yang, H., & Zhou, L. (2025) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-94445-1_9
Liu, W., Wang, X. A., Zhao, W., Jiang, W., Wu, L., Lei, H., Liu, Z., & Tang, D. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3637285
“Aguilar-Melchor et al. [34] proposed the XPIR scheme, which utilizes the paradigm shift introduced by lattice cryptography to prove that single-database computationally private information retrieval (CPIR) has practical value.”
CHOO-PIR: Hint-Based Private Information Retrieval with Commodity Servers
Phalakarn, K., & Hayashi, R. (2025) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1109/pst65910.2025.11268842
“…many real-life applications, including private database search [34], private communication [35], certificate transparency [13], privacy-preserving media streaming [36], privacy-preserving advertising [37], private DNS [38], private contact discovery [39], credential breach reporting [40], and more.”
Ke, P., Zhang, L. F., Wang, H., & Wang, L.-P. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5116-3_7
IM-PIR: In-Memory Private Information Retrieval
Mwaisela, M., Yuhala, P., Felber, P. A., & Schiavoni, V. (2025) · International Middleware Conference · doi:10.1145/3721462.3770764
Wang, C., Shi, J., Liu, Y., Fan, M., & Wang, W. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-3477-7_24
HET-PIR: practical Keyword PIR via a Novel homomorphic equality test Algorithm
Song, P., & Wang, M. (2026) · Cybersecurity · doi:10.1186/s42400-025-00506-x
“The second approach, single-server PIR, handles client queries via a single untrusted server, with security guaranteed by computational assumptions (Melchor et al. 2016; Angel et al. 2018; Mughees et al. 2021; Menon and Wu 2022; Ali et al. 2021; Park and Tibouchi 2020; Chang 2004; Henzinger et al.…”
PIRacle: A Fast and Scalable Private Information Retrieval System for Key-Value Stores
Chen, Z., Shen, Z., Wang, Y., Lü, H., & Ju, L. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3656406
“Currently, PIR systems are primarily categorized into two main types: Index PIR [9], [10], [11], [12], [13], [14], [15] and Keyword PIR [7], [16], [17], [18].”
InfluentialDPF-PIR: a scheme of feasible two-server keyword PIR with logarithmic communication
Li, C., Liang, Z., Zhang, F., Long, J., Zhang, B., & Liu, J. (2026) · Frontiers of Computer Science · doi:10.1007/s11704-025-41120-x
Privacy-preserving Location-Based Services with A New Private Information Retrieval Scheme
Wang, X., Wang, L., & Guo, L. (2025) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom66490.2025.00192 · Cited by 1
Kim, S., Ji, H., Kim, J., Choi, W., Park, J., & Ahn, J. H. (2026) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca68181.2026.11408461 · Cited by 2
Conflux: A High-Performance Keyword Private Retrieval System for Dynamic Datasets
Chen, Z., Shen, Z., Wei, Q., Lu, H., & Ju, L. (2026) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca68181.2026.11408617
NewtonPIR: Communication Efficient Single-Server PIR
Lu, P., & Zhang, G. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-7072-0_30
“Since Aguilar-Melchor et al. [36] proposed the first practical single-server PIR protocol, numerous PIR schemes [5,37,38,44,45] have been developed to further reduce computational and communication costs.”
Protecting workers in crowdsourcing platforms : a technical perspective
Duguépéroux, J. (2020) · theses.fr (ABES) · doi:10.70675/3d4ca379za7c3z40e9zb7c1zf7f24f9c5db5
Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space
Henzinger, A., & Ragavan, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25330-9_3 · Cited by 2
Efficient Single Server Private Information Retrieval Without Preprocessing
Jiang, H., Qu, Y., Chen, L., Zhang, M., Wang, X., & Feng, D. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-0375-8_33
A Novel Design for Private Information Retrieval with Logarithmic Client Overhead
Guo, W., Li, L., Li, X., Li, L., Gao, F., & Li, R. (2026) · International Conference on Communications, Information System and Computer Engineering (CISCE) · doi:10.1109/cisce69494.2026.11504624
“Although the authors in [12] have proposed solutions to the problem of ciphertext expansion, the Kushilevitz-Ostrovsky approach still serves as the foundational framework for several major PIR protocols [10], [11], [13], [14].”
FlashPIR: low-latency FHE-based single-server PIR with low client overhead
Dai, Y., Xiang, B. B., Qin, L., Deng, Y., & Zhang, J. (2026) · Cybersecurity · doi:10.1186/s42400-026-00601-7
FancyPIR: Stateless Batch Private Information Retrieval With Communication-Computation Trade-Offs
Lu, P., Li, Z., Wang, M., & Zhang, B. (2026) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2026.3706422
“Due to the excessive costs, some existing PIR-backed systems only accommodate small databases containing fewer than 100 K entries [3], [4], [6], [14].”
InsPIRe: Communication-Efficient PIR with Server-Side Preprocessing
Mahdavi, R. A., Patel, S., Seo, J. Y., & Yeo, K. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00061
VIA: Communication-Efficient Single-Server Private Information Retrieval
Liu, C., Wang, X., & Zhang, Z. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00086 · Cited by 1
“The efficient single-server PIR protocols [2], [12], [13], [19], [32], [33], [34] are constructed using lattice-based homomorphic encryption schemes [23], [35], [36], [37], [38], [39].”
Single-Server Stateful PIR with Verifiability and Balanced Efficiency
Arunachalaramanan, P. S., & Ren, L. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00019
Resisting Cumulative Leakage in Multi-Round Private Sum Retrieval
Zhou, B., Liu, K., Guo, Y., Lai, C., Zhang, Y., & Ma, W. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11588107
Sinba: Low-Latency Vectorized Batch PIR via 2D Baby-Step/Giant-Step
Ma, Z., Song, P., & Wang, M. (2026) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-032-32764-2_22
Verifiable and Forward-Private Single-Server Incremental PIR for Dynamic Edge-Cloud Repositories
Jia, Y., Zhang, L., Wu, Q., Rezaeibagha, F., & Zhou, F. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3717997
“Since then, PIR has evolved along two main directions: multiserver PIR [14], [15], [16], [17], [18], [19] and single-server PIR [20], [21], [22], [23], [24], [25], [26].”
GPIR: Efficient Single‐Server Private Information Retrieval With Garbled Bloom Filters
Di, Z., Zhang, W., Shang, S., Gao, R., & Guo, Z. (2026) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70878
“Melchor et al. proposed XPIR [9], which adopts an RLWE-based homomorphic encryption scheme and represents one of the early engineering efforts to make lattice-based PIR practical.”
On Arithmetic Private Information Retrieval: Why Code-Based PIR (Usually) Fails
Applebaum, B., Ishai, Y., & Shechter, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35428-0_17
Cloud-Compatible and Scalable Private Messaging via Authentication Piggybacking
Lu, J., Hao, M., Zhang, Y., Song, Y., & Yang, T. (2026) · International Workshop on Quality of Service · doi:10.1109/iwqos70441.2026.11661079
“While information-theoretic PIR [18] requires multiple non-colluding servers, computational PIR (CPIR) [9], [16], [19] enables single-server deployment based on cryptographic hardness assumptions.”
InfluentialStorage-Optimized Stateful Private Information Retrieval with Constant Response Size
Zhang, T., Wang, J., Wang, Y., Li, Z., & Cui, S. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-5737-9_8
Multi-keyword Private Information Retrieval Without Hints
Zhao, S., Lu, J., Huang, Y., Miao, D., Zhang, Z., Liu, J., Chen, Z., & Zhao, C. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38695-3_6
Weiss, J., & Gilad, Y. (2026) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3830418.3843910
Metadata
- Authors
- Aguilar-Melchor, C., Barrier, J., Fousse, L., & Killijian, M.-O.
- Affiliations
- Univ de Toulouse, IRIT, France
- Centre National de la Recherche Scientifique (FR)
- Univ de Grenoble, LJK, France
- Venue
- Proceedings on Privacy Enhancing Technologies
- Published
- 2015-12-30
- Volume
- 2016
- Issue
- 2
- Pages
- 155-174
- ISSN
- 2299-0984 (ISSN-L)
- OpenAlex
- W2401976587
- Cited by
- 185
- References
- 46
- Citations by year
- 2026: 24 · 2025: 25 · 2024: 17 · 2023: 18 · 2022: 14 · 2021: 20 · 2020: 17 · 2019: 18 · 2018: 8 · 2017: 15 · 2016: 9
- FWCI
- 10.46
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Proceedings on Privacy Enhancing Technologies (publishedVersion, cc-by-nc-nd)
- HAL (submittedVersion, other-oa)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Keywords
- private information retrieval, lattice-based cryptography, database privacy
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.