Sciweavers

103 search results - page 2 / 21
» Private Locally Decodable Codes
Sort
View
EUROCRYPT
2004
Springer
13 years 10 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ECCC
2010
147views more  ECCC 2010»
13 years 4 days ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 9 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
ECCC
2010
131views more  ECCC 2010»
13 years 5 months ago
High-rate codes with sublinear-time decoding
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
STACS
2009
Springer
14 years 1 days ago
Locally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that ...
Jop Briet, Ronald de Wolf