搜索结果: 1-15 共查到“密码学 learning with errors”相关记录26条 . 查询时间(0.062 秒)
Structured Module Learning With Errors From Cyclic Algebras
Lattices Public-Key Cryptography Learning With Errors
2019/6/12
The Learning with Errors (LWE) problem is the fundamental backbone of modern lattice based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems. ...
Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors
noninteractive zero knowledge correlation intractability learning with errors
2019/2/25
We finally close the long-standing problem of constructing a noninteractive zero-knowledge (NIZK) proof system for any NP language with security based on the plain Learning With Errors (LWE) problem, ...
On Quantum Chosen-Ciphertext Attacks and Learning with Errors
chosen-ciphertext security learning with errors quantum attacks
2018/12/11
Large-scale quantum computing is a significant threat to classical public-key cryptography. In strong “quantum access” security models, numerous symmetric-key cryptosystems are also vulnerable. We con...
On the Security of the Multivariate Ring Learning with Errors Problem
cryptanalysis lattice techniques public-key cryptography
2018/11/6
The Multivariate Ring Learning with Errors (mm-RLWE) problem was introduced in 2015 by Pedrouzo-Ulloa, Troncoso-Pastoriza and Pérez-González. Instead of working over a polynomial residue ring with one...
On the Hardness of Learning With Errors with Binary Secrets
complexity theory lattice based cryptography foundations
2018/11/5
We give a simple proof that the decisional Learning With Errors (LWE) problem with binary secrets (and an arbitrary polynomial number of samples) is at least as hard as the standard LWE problem (with ...
We repurpose existing RSA/ECC co-processors for (ideal) lattice-based cryptography by exploiting the availability of fast long integer multiplication. Such co-processors are deployed in smart cards in...
In this work we provide a traitor tracing construction with ciphertexts that grow polynomially in log(n) where n is the number of users and prove it secure under the Learning with Errors (LWE) assumpt...
How to validate the secret of a Ring Learning with Errors (RLWE) key
RLWE key exchange post-quantum
2018/1/24
We use the signal function from RLWE key exchange to derive an efficient zero knowledge authentication protocol to validate an RLWE key p=as+ep=as+e with secret ss and error ee in the Random Oracle Mo...
Middle-Product Learning With Errors
MPLWE LWE
2017/6/28
We introduce a new variant MPLWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials modulo an integer q. We exhibit a reduction from the Polynomial-LWE prob...
Estimation of the Hardness of the Learning with Errors Problem with a Restricted Number of Samples
learning with errors hardness estimation lattice-based cryptography
2017/2/21
Lattice-based cryptography is a promising candidate to build cryptographic primitives that are secure against quantum algorithms. The Learning with Errors problem is one of the most important hardness...
A Secure and Fast Dispersal Storage Scheme Based on the Learning with Errors Problem
dispersal storage data confidentiality data availability
2017/2/20
Data confidentiality and availability are of primary concern in data storage. Dispersal storage schemes achieve these two security properties by transforming the data into multiple codewords and dispe...
Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
Errors Assumption Symmetric-Key Bit Encryption
2017/2/20
In this work we separate private-key semantic security from circular security using the Learning with Error assumption. Prior works used the less standard assumptions of multilinear maps or indistingu...
Interpolating Predicate and Functional Encryption from Learning With Errors
functional encryption learning with errors predicate encryption
2016/6/29
We construct a functional encryption scheme for circuits which achieves a notion of security
that interpolates predicate and functional encryption. Our scheme is secure based on the
subexponential l...
Post-quantum key exchange for the TLS protocol from the ring learning with errors problem
post-quantum learning with errors Transport Layer Security (TLS) key exchange
2016/1/8
Lattice-based cryptographic primitives are believed to offer resilience against attacks by quantum
computers. We demonstrate the practicality of post-quantum key exchange by constructing ciphersuites...
Augmented Learning with Errors: The Untapped Potential of the Error Term
Lattice-Based Cryptography Encryption Scheme Lattice-Based Assumptions
2016/1/7
The Learning with Errors (LWE) problem has gained a lot of attention in recent years leading to
a series of new cryptographic applications. Specifically, it states that it is hard to distinguish rand...