77 search results - page 10 / 16 » Public-Key Cryptosystems from Lattice Reduction Problems |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
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 ...
SYRCODIS
2007
13 years 8 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
IEEEARES
2008
IEEE
14 years 1 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...