Private information retrieval (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Private information retrieval" in English language version.

Last modified: 21:38:04, 21 May 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1712doi.org

2^nd place

105psu.edu

299^th place

159^th place

63semanticscholar.org

15^th place

8^th place

44github.com

380^th place

337^th place

22web.archive.org

1^st place

21tau.ac.il

3,866^th place

3,877^th place

21sourceforge.net

1,842^nd place

1,520^th place

21stanford.edu

194^th place

182^nd place

11arxiv.org

49^th place

31^st place

11hdl.handle.net

66^th place

34^th place

11ucla.edu

885^th place

584^th place

11utexas.edu

868^th place

634^th place

11poly.edu

low place

arxiv.org (Global: 49^th place; English: 31^st place)

Baumeler, Ämin; Broadbent, Anne (17 April 2014). "Quantum Private Information Retrieval has Linear Communication Complexity". Journal of Cryptology. 28: 161–175. arXiv:1304.5490. doi:10.1007/s00145-014-9180-2. S2CID 1450526.

doi.org (Global: 2^nd place; English: 2^nd place)

Baumeler, Ämin; Broadbent, Anne (17 April 2014). "Quantum Private Information Retrieval has Linear Communication Complexity". Journal of Cryptology. 28: 161–175. arXiv:1304.5490. doi:10.1007/s00145-014-9180-2. S2CID 1450526.
Chor, Benny; Kushilevitz, Eyal; Goldreich, Oded; Sudan, Madhu (1 November 1998). "Private information retrieval" (PDF). Journal of the ACM. 45 (6): 965–981. CiteSeerX 10.1.1.51.3663. doi:10.1145/293347.293350. S2CID 544823. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kushilevitz, Eyal; Ostrovsky, Rafail (1997). "Replication is not needed: single database, computationally-private information retrieval". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida, USA: IEEE Computer Society. pp. 364–373. CiteSeerX 10.1.1.56.2667. doi:10.1109/SFCS.1997.646125. ISBN 978-0-8186-8197-4. S2CID 11000506. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Cachin, Christian; Micali, Silvio; Stadler, Markus (1999). "Computationally Private Information Retrieval with Polylogarithmic Communication". Advances in Cryptology – EUROCRYPT '99. Prague, Czech Republic: Springer-Verlag. pp. 402–414. doi:10.1007/3-540-48910-X_28. ISBN 978-3-540-48910-8.
Lipmaa, Helger (2005). "An Oblivious Transfer Protocol with Log-Squared Communication". Proceedings of the 8th International Conference on Information Security (ISC 2005). Lecture Notes in Computer Science. Vol. 3650. Singapore: Springer-Verlag. pp. 314–328. CiteSeerX 10.1.1.73.8768. doi:10.1007/11556992_23. ISBN 978-3-540-31930-6. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Gentry, Craig; Ramzan, Zulfikar (2005). "Single-Database Private Information Retrieval with Constant Communication Rate". ICALP. LNCS. Vol. 3580. Springer. pp. 803–815. CiteSeerX 10.1.1.113.6572. doi:10.1007/11523468_65. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Kiayias, Aggelos; Leonardos, Nikos; Lipmaa, Helger; Pavlyk, Kateryna; Tang, Qiang (2015). "Optimal Rate Private Information Retrieval from Homomorphic Encryption". Proceedings on Privacy Enhancing Technologies 2015. Vol. 2015. DE GRUYTER. pp. 222–243. doi:10.1515/popets-2015-0016. hdl:20.500.11820/0f84afcb-8ee1-4744-a2ba-4642104c51c5.
Lipmaa, Helger (2010). "First CPIR Protocol with Data-Dependent Computation". Proceedings of the 12th International Conference on Information Security and Cryptology. Lecture Notes in Computer Science. Vol. 5984. Seoul, Korea: Springer-Verlag. pp. 193–210. CiteSeerX 10.1.1.215.7768. doi:10.1007/978-3-642-14423-3_14. ISBN 978-3-642-14423-3. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail; Sahai, Amit (2004). "Batch codes and their applications" (PDF). STOC'04. ACM. pp. 262–271. doi:10.1145/1007352.1007396. Retrieved 2015-10-23.
Ostrovsky, Rafail; Skeith III; William E. (2007). "A Survey of Single-Database Private Information Retrieval: Techniques and Applications". Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography. Springer-Verlag. pp. 393–411. doi:10.1007/978-3-540-71677-8_26. ISBN 978-3-540-71677-8.
Di Crescenzo, Giovanni; Malkin, Tal; Ostrovsky, Rafail (2000). "Single Database Private Information Retrieval Implies Oblivious Transfer". Eurocrypt 2000. LNCS. Vol. 1807. Springer. pp. 122–138. doi:10.1007/3-540-45539-6_10.
Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail (2005). "Sufficient Conditions for Collision-Resistant Hashing". Proceedings of the Second Theory of Cryptography Conference. Cambridge, MA, USA: Springer-Verlag. pp. 445–456. doi:10.1007/978-3-540-30576-7_24. ISBN 978-3-540-30576-7.

github.com (Global: 380^th place; English: 337^th place)

"MuchPIR Demo". GitHub. 14 September 2021.
"SealPIR". Github. Retrieved 2018-06-07.
"encryptogroup/RAID-PIR". GitHub. Retrieved 2016-05-26.
"XPIR-team/XPIR". GitHub. Retrieved 2016-05-26.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Kiayias, Aggelos; Leonardos, Nikos; Lipmaa, Helger; Pavlyk, Kateryna; Tang, Qiang (2015). "Optimal Rate Private Information Retrieval from Homomorphic Encryption". Proceedings on Privacy Enhancing Technologies 2015. Vol. 2015. DE GRUYTER. pp. 222–243. doi:10.1515/popets-2015-0016. hdl:20.500.11820/0f84afcb-8ee1-4744-a2ba-4642104c51c5.

poly.edu (Global: low place; English: low place)

uppir.poly.edu

"upPIR". uppir.poly.edu. Archived from the original on 2016-06-25. Retrieved 2016-05-26.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Chor, Benny; Kushilevitz, Eyal; Goldreich, Oded; Sudan, Madhu (1 November 1998). "Private information retrieval" (PDF). Journal of the ACM. 45 (6): 965–981. CiteSeerX 10.1.1.51.3663. doi:10.1145/293347.293350. S2CID 544823. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kushilevitz, Eyal; Ostrovsky, Rafail (1997). "Replication is not needed: single database, computationally-private information retrieval". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida, USA: IEEE Computer Society. pp. 364–373. CiteSeerX 10.1.1.56.2667. doi:10.1109/SFCS.1997.646125. ISBN 978-0-8186-8197-4. S2CID 11000506. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Lipmaa, Helger (2005). "An Oblivious Transfer Protocol with Log-Squared Communication". Proceedings of the 8th International Conference on Information Security (ISC 2005). Lecture Notes in Computer Science. Vol. 3650. Singapore: Springer-Verlag. pp. 314–328. CiteSeerX 10.1.1.73.8768. doi:10.1007/11556992_23. ISBN 978-3-540-31930-6. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Gentry, Craig; Ramzan, Zulfikar (2005). "Single-Database Private Information Retrieval with Constant Communication Rate". ICALP. LNCS. Vol. 3580. Springer. pp. 803–815. CiteSeerX 10.1.1.113.6572. doi:10.1007/11523468_65. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Lipmaa, Helger (2010). "First CPIR Protocol with Data-Dependent Computation". Proceedings of the 12th International Conference on Information Security and Cryptology. Lecture Notes in Computer Science. Vol. 5984. Seoul, Korea: Springer-Verlag. pp. 193–210. CiteSeerX 10.1.1.215.7768. doi:10.1007/978-3-642-14423-3_14. ISBN 978-3-642-14423-3. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Baumeler, Ämin; Broadbent, Anne (17 April 2014). "Quantum Private Information Retrieval has Linear Communication Complexity". Journal of Cryptology. 28: 161–175. arXiv:1304.5490. doi:10.1007/s00145-014-9180-2. S2CID 1450526.
Chor, Benny; Kushilevitz, Eyal; Goldreich, Oded; Sudan, Madhu (1 November 1998). "Private information retrieval" (PDF). Journal of the ACM. 45 (6): 965–981. CiteSeerX 10.1.1.51.3663. doi:10.1145/293347.293350. S2CID 544823. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kushilevitz, Eyal; Ostrovsky, Rafail (1997). "Replication is not needed: single database, computationally-private information retrieval". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida, USA: IEEE Computer Society. pp. 364–373. CiteSeerX 10.1.1.56.2667. doi:10.1109/SFCS.1997.646125. ISBN 978-0-8186-8197-4. S2CID 11000506. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

percy.sourceforge.net

Percy++ / PIR in C++ at SourceForge

stanford.edu (Global: 194^th place; English: 182^nd place)

crypto.stanford.edu

Saint-Jean, Felipe (2005). "A Java Implementation of a Single-Database Computationally Symmetric Private Information Retrieval (cSPIR) protocol" (PDF). Yale University Technical Report YALEU/DCS/TR-1333.

tau.ac.il (Global: 3,866^th place; English: 3,877^th place)

Chor, Benny; Kushilevitz, Eyal; Goldreich, Oded; Sudan, Madhu (1 November 1998). "Private information retrieval" (PDF). Journal of the ACM. 45 (6): 965–981. CiteSeerX 10.1.1.51.3663. doi:10.1145/293347.293350. S2CID 544823. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

ucla.edu (Global: 885^th place; English: 584^th place)

web.cs.ucla.edu

Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail; Sahai, Amit (2004). "Batch codes and their applications" (PDF). STOC'04. ACM. pp. 262–271. doi:10.1145/1007352.1007396. Retrieved 2015-10-23.

utexas.edu (Global: 868^th place; English: 634^th place)

cs.utexas.edu

"Popcorn" (PDF). Archived from the original (PDF) on 2016-08-21. Retrieved 2016-05-26.

web.archive.org (Global: 1^st place; English: 1^st place)

"Popcorn" (PDF). Archived from the original (PDF) on 2016-08-21. Retrieved 2016-05-26.
"upPIR". uppir.poly.edu. Archived from the original on 2016-06-25. Retrieved 2016-05-26.

Private information retrieval (English Wikipedia)

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

github.com (Global: 380th place; English: 337th place)

hdl.handle.net (Global: 66th place; English: 34th place)