25 search results - page 4 / 5 » Multi-bit Cryptosystems Based on Lattice Problems |
EUROCRYPT
2010
Springer
14 years 7 days ago
2010
Springer
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
LATINCRYPT
2010
13 years 5 months ago
2010
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
ECCC
2006
13 years 7 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...