搜索结果: 1-8 共查到“军事学 LWR”相关记录8条 . 查询时间(0.065 秒)
The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
Lattice cryptography Ring-LWE Error Correcting Codes
2018/12/3
Current estimation techniques for the probability of decryption failures in Ring/Mod-LWE/LWR based schemes assume independence of the failures in individual bits of the transmitted message to calculat...
On the impact of decryption failures on the security of LWE/LWR based schemes
Lattice cryptography Post-quantum cryptography Decryption failures
2018/11/12
In this paper we investigate the impact of decryption failures on the chosen-ciphertext security of (Ring/Module)-Learning With Errors and (Ring/Module)-Learning with Rounding based primitives. Our an...
On the Hardness of the Computational Ring-LWR Problem and its Applications
Lattice Techniques Public Key Cryptography
2018/6/5
In this paper, we propose a new assumption, the Computational Learning With Rounding over rings, which is inspired by the computational Diffie-Hellman problem. Assuming the hardness of ring-LWE, we pr...
Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
CPA-secure encryption CCA-secure KEM
2018/3/5
In this paper, we introduce Saber, a package of cryptographic primitives whose security relies on the hardness of the Module Learning With Rounding problem (Mod-LWR). We first describe a secure Diffie...
Lattice-Based Techniques for Accountable Anonymity: Composition of Abstract Stern’s Protocols and Weak PRF with Efficient Protocols from LWR
Lattice-Based Cryptography Zero-Knowledge Arguments of Knowledge Privacy-Preserving Protocol
2017/8/17
In an accountable anonymous system, a user is guaranteed anonymity and unlinkability unless some well-defined condition is met. A line of research focus on schemes that do not rely on any trusted thir...
Lizard: Cut off the Tail! Practical Post-Quantum Public-Key Encryption from LWE and LWR
Post-Quantum Cryptography Public-Key Encryption Learning with Rounding (LWR)
2016/12/7
The Learning with Errors (LWE) is one of the most promising primitive for post-quantum cryptography due to its strong security reduction from the worst-case of NP-hard problems and its lightweight ope...
Dimension-Preserving Reductions from LWE to LWR
lattice-based cryptography Learning with Errors LWE
2016/6/7
The Learning with Rounding (LWR) problem was first introduced
by Banerjee, Peikert, and Rosen (Eurocrypt 2012) as a derandomized
form of the standard Learning with Errors (LWE) problem.
The origina...
The Learning With Error problem (LWE) is becoming more
and more used in cryptography, for instance, in the design of some fully
homomorphic encryption schemes. It is thus of primordial importance to...