Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Single Database Private Information Retrieval with Logarithmic Communication

Yan-Cheng Chang

Published Jan 1, 2004• 162 citations
Publisher
DOI
10.1007/978-3-540-27800-9_5

Related papers

Single Database Private Information Retrieval Implies Oblivious Transfer

Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2000•158 citations

Fast Single-Database Private Information Retrieval With Lattices

Carlos Aguilar Melchor, Philippe Gaborit

•Jul 4, 2007•0 citations

Computationally Private Information Retrieval with Polylogarithmic Communication

Christian Cachin, Silvio M. Micali, Markus A. Stadler

Lecture notes in computer science•Jan 1, 1999•588 citations

A t-private k-database information retrieval scheme

Carlo Blundo, Paolo D’Arco, Alfredo De Santis

International Journal of Information Security•Aug 1, 2001•8 citations

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Springer eBooks•Feb 25, 2008•12 citations

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Lecture notes in computer science•Jan 1, 1997•174 citations