搜索结果: 1-15 共查到“Ideal lattices”相关记录20条 . 查询时间(0.093 秒)
Approx-SVP in Ideal Lattices with Pre-processing
heuristic assumptions pre-processing phase outputs
2019/2/28
We describe an algorithm to solve the approximate Shortest Vector Problem for lattices corresponding to ideals of the ring of integers of an arbitrary number field KK. This algorithm has a pre-process...
In this paper, we first revisit the generic two-message key exchange (TMKE) scheme (which will be referred to as KF) introduced by Kurosawa and Furukawa (CT-RSA 2014). This protocol is mainly based on...
NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme
Lattices-based Post-quantum Cryptography NTRUEncrypt NTRU-Prime
2018/1/31
In this paper, we propose NTRU-LPR IND-CPA, a new secure scheme based on the decisional variant of Bounded Distance Decoding problem over rings (DR-BDD). This scheme is IND-CPA secure and has two KEM ...
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Ring LWE Bilinear Maps Identity-Based Encryption
2016/12/10
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing property of the schemes is that it achieves shorter public parameters than previous s...
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
public-key cryptography multilinear maps
2016/1/9
The GGH Graded Encoding Scheme [10], based on ideal lattices, is the first plausible approximation
to a cryptographic multilinear map. Unfortunately, using the security analysis in [10], the
scheme ...
In this paper, we present a practical and provably secure two-pass AKE protocol from ideal lattices,
which is conceptually simple and has similarities to the Diffie-Hellman based protocols such as HM...
Sieving for Shortest Vectors in Ideal Lattices: a Practical Perspective
Lattice cryptanalysis parallel Gauss sieve ideal lattices
2016/1/6
The security of many lattice-based cryptographic schemes relies on the hardness of
finding short vectors in integral lattices. We propose a new variant of the parallel Gauss sieve
algorithm to compu...
Implementing Candidate Graded Encoding Schemes from Ideal Lattices
algorithms implementation lattice-based cryptography
2016/1/6
Multilinear maps have become popular tools for designing cryptographic schemes
since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi
(GGH). This construction was la...
Multilinear Maps Using Ideal Lattices without Encodings of Zero
Multilinear maps Ideal lattices Multipartite Diffie-Hellman key exchange
2016/1/5
Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using
ideal lattices. However, Hu and Jia recently presented an efficient attack for two applications based
on the GGH ma...
Ideal Multilinear Maps Based on Ideal Lattices
Ideal multilinear maps ideal lattices multipartite Diffie–Hellman key exchange
2016/1/3
Cryptographic multilinear maps have many applications, such as multipartite key
exchange and software obfuscation. However, the encodings of three current constructions are
“noisy” and their multili...
Strongly Secure Authenticated Key Exchange from Ideal Lattices
cryptographic protocols practical authenticated key exchange
2015/12/31
In this paper, we propose an efficient and practical authenticated key exchange (AKE) protocol from ideal
lattices, which is well-designed and has some similarity to the HMQV protocol. Using the hard...
Cryptanalysis of the multilinear map on the ideal lattices
Multilinear maps graded encoding schemes zeroizing attack
2015/12/30
We improve the zeroizing attack on the multilinear map of Garg, Gentry and Halevi (GGH). Our algorithm can solve the Graded Decisional Diffie-Hellman (GDDH) problem on the GGH scheme when the dimensio...
ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices
Lattice-based cryptography Ideal lattices ETRU
2015/12/30
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Proble...
New multilinear maps from ideal lattices
Multilinear maps Ideal lattices Multipartite Diffie-Hellman key exchange
2015/12/24
Recently, Hu and Jia presented an efficient attack on the GGH13 map. They show that
the MPKE and WE based on GGH13 with public tools of encoding are not secure. Currently, an
open problem is to fix ...
Security Analysis of Cryptosystems Using Short Generators over Ideal Lattices
Short generators Cyclotomic fields Log-unit lattices
2015/12/22
In this paper, we analyze the security of cryptosystems using
short generators over ideal lattices such as candidate multilinear maps
by Garg, Gentry and Halevi and fully homomorphic encryption by S...