Local Testing for Membership in Lattices

  title={Local Testing for Membership in Lattices},
  author={Karthekeyan Chandrasekaran and Mahdi Cheraghchi and Venkata Gandikota and Elena Grigorescu},
  journal={Electron. Colloquium Comput. Complex.},
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing membership in lattices is also motivated in practice, by applications to integer programming, error detection in lattice-based communication, and cryptography. Apart from establishing the conceptual foundations of lattice testing, our results include the following… Expand
1 Citations
Testing Proximity to Subspaces: Approximate ℓ ∞ Minimization in Constant Time
This paper proposes a quick tester that solves the subspace proximity problem correctly with high probability and demonstrates the scalability and applicability of the tester using synthetic and real data sets. Expand


Tolerant Linearity Testing and Locally Testable Codes
This work gives a general sufficient condition on the distribution μ for linearity to be tolerantly testable with a constant number of queries and shows that linearity is tolerant testable for several natural classes of distributions including low bias, symmetric and product distributions. Expand
Tolerant Locally Testable Codes
This work revisits some recent constructions of LTCs and shows how one can make them locally testable in a tolerant sense, and defines such testers, which are called tolerant testers following some recent work in property testing. Expand
Lattice-Based Cryptography
An important question in the area is to determine the smallest factor g such that one can build cryptographic functions that are as hard to break as finding g-approximate solutions to lattice problems. Expand
Lattice problems in NP ∩ coNP
We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of &nradic; lie in NP intersect coNP. The result (almost) subsumes the threeExpand
Connections between Construction D and related constructions of lattices
It is shown that Construction by Code Formula produces a lattice packing if and only if the nested codes being used are closed under Schur product, thus proving the similarity of Construction D and Construction by code Formula when applied to Reed–Muller codes. Expand
Optimal Testing of Reed-Muller Codes
This work shows that the Gowers norm test is tolerant, in that it also accepts close code words, and improves the parameters of an XOR lemma for polynomials given by Viola and Wigderson for graph properties. Expand
Proof verification and the hardness of approximation problems
It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard. Expand
Short Locally Testable Codes and Proofs: A Survey in Two Parts
This work surveys known results regarding local testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs, with related concept of local decodable codes. Expand
On Bounded Distance Decoding for General Lattices
It is shown how a recent technique can be used to solve α-BDD with pre-processing in polynomial time for α=O\left(\sqrt{(\log{n})/n}\right)$, which improves upon the previously best known algorithm due to Klein. Expand
On the construction of dense lattices with a given automorphism group
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicativeExpand