60 search results - page 11 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
CODES
2008
IEEE
13 years 7 months ago
2008
IEEE
As the importance of multimedia applications in hand-held devices increases, the computational strain and corresponding demand for energy in such devices continues to grow. Portab...
IACR
2011
12 years 5 months ago
2011
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
PKC
2011
Springer
12 years 8 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...