50 search results - page 5 / 10 » crypto 2010 |
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
LATINCRYPT
2010
13 years 5 months ago
2010
Let E be a non-supersingular elliptic curve over a finite field Fq. At CRYPTO 2009, Icart introduced a deterministic function Fq → E(Fq) which can be computed efficiently, and ...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...