178
click to vote
EUROCRYPT
2012
Springer
13 years 8 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
183
click to vote
EUROCRYPT
2012
Springer
13 years 8 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
178
Voted
EUROCRYPT
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
196
click to vote
EUROCRYPT
2012
Springer
13 years 8 months ago
2012
Springer
We present a new approach for creating chosen ciphertext secure encryption. The focal point ork is a new abstraction that we call Detectable Chosen Ciphertext Security (DCCA). Int...
200
click to vote
EUROCRYPT
2012
Springer
13 years 8 months ago
2012
Springer
We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (ST...