Sciweavers

9 search results - page 2 / 2
» Robust Information-Theoretic Private Information Retrieval
Sort
View
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
13 years 9 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
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
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
EDBT
2012
ACM
225views Database» more  EDBT 2012»
11 years 7 months ago
Differentially private search log sanitization with optimal output utility
Web search logs contain extremely sensitive data, as evidenced by the recent AOL incident. However, storing and analyzing search logs can be very useful for many purposes (i.e. in...
Yuan Hong, Jaideep Vaidya, Haibing Lu, Mingrui Wu