Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Revision(s):

Revision #2 to TR97-031 | 22nd February 1998 00:00

#### On the Limits of Non-Approximability of Lattice Problems Revision of: TR97-031

Revision #2
Authors: Oded Goldreich
Accepted on: 22nd February 1998 00:00
Keywords:

Abstract:

We show simple constant-round interactive proof systems for
problems capturing the approximability, to within a factor of $\sqrt{n}$,
of optimization problems in integer lattices; specifically,
the closest vector problem (CVP), and the shortest vector problem (SVP).
These interactive proofs are for the coNP direction'';
that is, we give an interactive protocol
showing that a vector is far'' from the lattice (for CVP),
and an interactive protocol
showing that the shortest-lattice-vector is long'' (for SVP).
Furthermore, these interactive proof systems
are Honest-Verifier Perfect Zero-Knowledge.

We conclude that approximating CVP (resp., SVP) within a factor
of $\sqrt{n}$ is in $NP\cap coAM$.
Thus, it seems unlikely that approximating these problems
to within a $\sqrt{n}$ factor is NP-hard.
Previously, for the CVP (resp., SVP) problem,
Lagarias et al, Hastad and Banaszczyk showed
that the gap problem corresponding to
approximating CVP (resp., SVP) within $n$ is in $NP\cap\coNP$.
On the other hand, Arora et al showed that the gap problem corresponding
to approximating CVP within $2^{\log^{0.999}n}$ is quasi-NP-hard.

Revision #1 to TR97-031 | 16th October 1997 00:00

#### On the Limits of Non-Approximability of Lattice Problems Revision of: TR97-031

Revision #1
Authors: Oded Goldreich
Accepted on: 16th October 1997 00:00
Keywords:

Abstract:

We show simple constant-round interactive proof systems for
problems capturing the approximability, to within a factor of $\sqrt{n}$,
of optimization problems in integer lattices; specifically,
the closest vector problem (CVP), and the shortest vector problem (SVP).
These interactive proofs are for the coNP direction'';
that is, we give an interactive protocol
showing that a vector is far'' from the lattice (for CVP),
and an interactive protocol
showing that the shortest-lattice-vector is long'' (for SVP).
Furthermore, these interactive proof systems
are Honest-Verifier Perfect Zero-Knowledge.

We conclude that approximating CVP (resp., SVP) within a factor
of $\sqrt{n}$ is in $NP\cap coAM$.
Thus, it seems unlikely that approximating these problems
to within a $\sqrt{n}$ factor is NP-hard.
Previously, for the CVP (resp., SVP) problem,
Lagarias et al, Hastad and Banaszczyk showed
that the gap problem corresponding to
approximating CVP (resp., SVP) within $n$ is in $NP\cap\coNP$.
On the other hand, Arora et al showed that the gap problem corresponding
to approximating CVP within $2^{\log^{0.999}n}$ is quasi-NP-hard.

### Paper:

TR97-031 | 9th September 1997 00:00

#### On the Limits of Non-Approximability of Lattice Problems

TR97-031
Authors: Oded Goldreich
Publication: 10th September 1997 09:22
Keywords:

Abstract:

We show simple constant-round interactive proof systems for
problems capturing the approximability, to within a factor of $\sqrt{n}$,
of optimization problems in integer lattices; specifically,
the closest vector problem (CVP), and the shortest vector problem (SVP).
These interactive proofs are for the coNP direction'';
that is, we give an interactive protocol
showing that a vector is far'' from the lattice (for CVP),
and an interactive protocol
showing that the shortest-lattice-vector is long'' (for SVP).
Furthermore, these interactive proof systems
are Honest-Verifier Perfect Zero-Knowledge.

We conclude that approximating CVP (resp., SVP) within a factor
of $\sqrt{n}$ is in $NP\cap coAM$.
Thus, it seems unlikely that approximating these problems
to within a $\sqrt{n}$ factor is NP-hard.
Previously, for the CVP (resp., SVP) problem, Lagarias et al showed
that the gap problem corresponding to approximating CVP within $n^{1.5}$
(resp., approximating SVP within $n$) is in $NP\cap coNP$.
On the other hand, Arora et al showed that the gap problem corresponding
to approximating CVP within $2^{\log^{0.499}n}$ is quasi-NP-hard.

ISSN 1433-8092 | Imprint