相关论文: A Note on Banaszczyk's Inequality

We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums…

In this work, we unveil an analogy between well-known lattice based learning with error problem and ill-posed inverse problems. We show that LWE problem is a structured inverse problem. Further, we propose a symmetric encryption scheme…

An abstract version of the celebrated inequality is described by means of the spectral bound of an operator defined on a Banach lattice. As a consequence, uniqueness and continuous dependence results for the general semilinear problem…

We consider the well-posedness of Bayesian inverse problems when the prior measure has exponential tails. In particular, we consider the class of convex (log-concave) probability measures which include the Gaussian and Besov measures as…

This article presets a review of the achievements rapidly developing field of cryptography - public-key cryptography based on the lattice theory. Paper contains the necessary basic concepts and the major problems of the lattice theory, as…

Lattice Boltzmann schemes are efficient numerical methods to solve a broad range of problems under the form of conservation laws. However, they suffer from a chronic lack of clear theoretical foundations. In particular, the consistency…

Ab initio numerical simulations of the thermodynamics of dense quark matter remain a challenge. Apart from the infamous sign problem, lattice methods have to deal with finite volume and discretization effects as well as with the necessity…

This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…

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 `learning from parity with error' problem to higher moduli. It can…

We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only known under quantum reductions. Our techniques capture the…

LWE-based cryptosystems are an attractive alternative to traditional ones in the post-quantum era. To minimize the storage cost of part of its public key - a $256 \times 640$ integer matrix, $\textbf{T}$ - a binary version of $\textbf{T}$…

We introduce a continuous analogue of the Learning with Errors (LWE) problem, which we name CLWE. We give a polynomial-time quantum reduction from worst-case lattice problems to CLWE, showing that CLWE enjoys similar hardness guarantees to…

We establish the bilateral exact reciprocal interrelations between a tail behavior of a measurable functions and its norm in the suitable Grand Lebesgue Space (GLS) as well as Orlicz one, builded over the set with infinite measure. We bring…

Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which ${\cal O}(a^2)$ errors are removed is presented. ${\cal O}(a^2)$ improvement of the gauge fixing condition improves…

$ \newcommand{\R}{\ensuremath{\mathbb{R}}} \newcommand{\lat}{\mathcal{L}} \newcommand{\ensuremath}[1]{#1} $We show that for any lattice $\lat \subseteq \R^n$ and vectors $\vec{x}, \vec{y} \in \R^n$, \[ \rho(\lat + \vec{x})^2 \rho(\lat +…

In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…

In a Bayesian inverse problem setting, the solution consists of a posterior measure obtained by combining prior belief, information about the forward operator, and noisy observational data. This measure is most often given in terms of a…

We show that $L^2$-accurate score estimation, in the absence of strong assumptions on the data distribution, is computationally hard even when sample complexity is polynomial in the relevant problem parameters. Our reduction builds on the…

In this paper, we study the conjecture of Gardner and Zvavitch from \cite{GZ}, which suggests that the standard Gaussian measure $\gamma$ enjoys $\frac{1}{n}$-concavity with respect to the Minkowski addition of \textbf{symmetric} convex…

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…