搜索结果: 121-135 共查到“军事学 LWE”相关记录135条 . 查询时间(0.078 秒)
We consider the binary-LWE problem, which is the learning with errors problem when the entries of the secret vector are chosen from $\{ 0, 1\}$ or $\{ -1, 0, 1 \}$ (and the error vector is sampled fro...
On the Efficacy of Solving LWE by Reduction to Unique-SVP
LWE Lattice-based cryptography FHE
2014/3/7
We present a study of the concrete complexity of solving instances of the unique shortest vector problem (uSVP). In particular, we study the complexity of solving the Learning with Errors (LWE) proble...
Recent advances in lattice cryptography, mainly stemming from the development of ring-based primitives such as ring-$\lwe$, have made it possible to design cryptographic schemes whose efficiency is co...
Provably Secure LWE-Encryption with Uniform Secret
LWE Encryption Lattice-Based Cryptography
2013/4/18
In this paper we present the (to the best of our knowledge) first LWE-based encryption scheme that removes the need of Gaussian sampling for the error, i.e. the discrete Gaussian distribution is repla...
Hardness of SIS and LWE with Small Parameters
complexity theory foundations lattice techniques
2013/4/19
The Short Integer Solution (SIS) and Learning With Errors (LWE) problems are the foundations for countless applications in lattice-based cryptography, and are provably as hard as approximate lattice p...
Efficient Multi-Query CPIR from Ring-LWE
cryptographic protocols / Circuit complexity compressed constant-weight codes computational batch codes CPIR parallel computation ring-LWE
2012/3/22
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
Efficient Multi-Query CPIR from Ring-LWE
cryptographic protocols / Circuit complexity compressed constant-weight codes computational batch codes CPIR parallel computation ring-LWE
2012/3/21
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
foundations
2012/3/26
We study under what conditions the conjectured one-wayness of the knapsack function (with polynomially bounded inputs) over an arbitrary finite abelian group implies that the output of the function is...
Efficient Fully Homomorphic Encryption from (Standard) LWE
public-key cryptography / fully homomorphic encryption learning with errors
2012/3/27
We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the...
Efficient Fully Homomorphic Encryption from (Standard) LWE
public-key cryptography fully homomorphic encryption learning with errors
2011/7/25
We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption.
Fully Homomorphic Encryption, Approximate Lattice Problem and LWE
Fully Homomorphic Encryption, Approximate Lattice Problem Approximate Principal Ideal Lattice Problem LWE, Approximate GCD Integer Factoring
2012/3/29
In this paper, we first introduce a new concept of approximate lattice problem (ALP), which is an extension of learning with errors (LWE). Next, we propose two ALP-based public key encryption schemes....
Fully Homomorphic Encryption and Ring-LWE over the Integers
Fully Homomorphic Encryption Principal Ideal Lattice Ring-LWE over theIntegers
2011/3/11
This paper constructs a new fully homomorphic encryption scheme by applying self-loop bootstrappable technique. The security of our scheme depends on the hardness of the decision problem of a hidden p...
Better Key Sizes (and Attacks) for LWE-Based Encryption
lattice-based cryptography basis reduction learning with errors
2010/12/1
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the ``learning with errors'' (LWE) problem. Our main contributions are: (1)~a new lattic...
Solving LWE problem with bounded errors in polynomial time
LWE Lattice bounded errors multivariate polynomials linerization
2010/11/10
In this paper, we present a new algorithm, such that, for the learning with errors (LWE) problems, if the errors are bounded -- the errors do not span the whole prime finite field $F_q$ but a fixed kn...