224 search results - page 26 / 45 » Secure Computation from Random Error Correcting Codes |
COCO
2009
Springer
14 years 1 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The concept of artificial evolution has been applied to numerous real world applications in different domains. In this paper, we use this concept in the domain of virology to ev...
IMC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
MMSEC
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...