5 search results - page 1 / 1 » On lattices, learning with errors, random linear codes, and ... |
STOC
2005
ACM
14 years 4 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
PKC
2011
Springer
12 years 7 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...
PKC
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...