224 search results - page 6 / 45 » Secure Computation from Random Error Correcting Codes |
STACS
2010
Springer
14 years 1 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
ICALP
2007
Springer
14 years 25 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
SIGCOMM
2010
ACM
13 years 6 months ago
2010
ACM
Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper investigates the novel concept of error estimating codes (EEC). W...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
EUROCRYPT
2004
Springer
14 years 2 days ago
2004
Springer
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...