Sciweavers

101 search results - page 1 / 21
» Replication is NOT Needed: SINGLE Database, Computationally-...
Sort
View
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 8 months ago
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
Jens Groth, Aggelos Kiayias, Helger Lipmaa
ISW
2010
Springer
13 years 2 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
WWW
2007
ACM
14 years 5 months ago
Globetp: template-based database replication for scalable web applications
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
Tobias Groothuyse, Swaminathan Sivasubramanian, Gu...
ICALP
2005
Springer
13 years 10 months ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
ACISP
2004
Springer
13 years 10 months ago
Single Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
Yan-Cheng Chang