224 search results - page 17 / 45 » Secure Computation from Random Error Correcting Codes |
IFIPTCS
2000
13 years 10 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
ECCC
2000
13 years 6 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
SP
2005
IEEE
14 years 9 days ago
2005
IEEE
In this paper, we propose BIND (Binding Instructions aNd Data),1 a fine-grained attestation service for securing distributed systems. Code attestation has recently received consi...
APPROX
2011
Springer
12 years 6 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
SOSP
2009
ACM
14 years 3 months ago
2009
ACM
We present ClearView, a system for automatically patching errors in deployed software. ClearView works on stripped Windows x86 binaries without any need for source code, debugging...