85 search results - page 1 / 17 » Worst Cases and Lattice Reduction |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
ARITH
2003
IEEE
13 years 10 months ago
2003
IEEE
ECCC
2008
13 years 4 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...