Sciweavers

14 search results - page 3 / 3
» Single-Database Private Information Retrieval with Constant ...
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
IJISEC
2010
114views more  IJISEC 2010»
14 years 8 months ago
A new hardware-assisted PIR with O(n) shuffle cost
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 12 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CCS
2011
ACM
13 years 11 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg