2897 search results - page 165 / 580 » Mobile Code Security |
156
click to vote
TIT
2008
15 years 6 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
163
click to vote
SP
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper shows how system-speci c static analysis can nd security errors that violate rules such as \integers from untrusted sources must be sanitized before use" and \do n...
178
click to vote
CODES
2007
IEEE
16 years 25 days ago
2007
IEEE
We propose a method for dynamic security domain scaling on SMPs that offers both highly scalable performance and high security for future high-end embedded systems. Its most impor...
247
click to vote
PLDI
1999
ACM
15 years 10 months ago
1999
ACM
This paper explores compiler techniques for reducing the memory needed to load and run program executables. In embedded systems, where economic incentives to reduce both ram and r...
175
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design rema...