Sign In

Login

Password

Forgot Password ? Sign Up

Private information retrieval (English Wikipedia)

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

refsWebsite
Global rank English rank
12doi.org
2nd place
2nd place
5psu.edu
207th place
136th place
4github.com
383rd place
320th place
3semanticscholar.org
11th place
8th place
2web.archive.org
1st place
1st place
1arxiv.org
69th place
59th place
1tau.ac.il
4,464th place
4,468th place
1handle.net
102nd place
76th place
1ucla.edu
782nd place
585th place
1sourceforge.net
1,669th place
1,290th place
1stanford.edu
179th place
183rd place
1utexas.edu
916th place
706th place
1poly.edu
low place
low place

arxiv.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.

doi.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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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

handle.net

hdl.handle.net

poly.edu

uppir.poly.edu

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

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.
  • 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.

sourceforge.net

percy.sourceforge.net

stanford.edu

crypto.stanford.edu

tau.ac.il

ucla.edu

web.cs.ucla.edu

utexas.edu

cs.utexas.edu

web.archive.org