Sciweavers

107 search results - page 1 / 22
» Improving the Robustness of Private Information Retrieval
Sort
View
SP
2007
IEEE
102views Security Privacy» more  SP 2007»
13 years 11 months ago
Improving the Robustness of Private Information Retrieval
Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modificati...
Ian Goldberg
JOC
2007
93views more  JOC 2007»
13 years 4 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
13 years 10 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek
ICALP
2005
Springer
13 years 10 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf