2020
DOI: 10.1109/tit.2020.2967047
|View full text |Cite
|
Sign up to set email alerts
|

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications

Abstract: In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard to solve unless some trapdoor information is revealed. We thoroughly analyze the security of our proposed functions using state-of-theart attacks and results on lattice reductions. Finally, we describe how our functions can be used to design quantum-safe encryption schemes with reasonable … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 46 publications
0
9
0
Order By: Relevance
“…Since the previous frame image is added with pseudorandom sequence and the latter frame image is subtracted with pseudorandom sequence, it has little impact on vision as a whole, which is the effect of hybrid complementarity. After complementary scrambling of the original image, the overall time domain and frequency domain are changed, which can also achieve the purpose of protecting the useful information of the image [23][24][25].…”
Section: Design Of Antileakage Methods Of Digital Videomentioning
confidence: 99%
“…Since the previous frame image is added with pseudorandom sequence and the latter frame image is subtracted with pseudorandom sequence, it has little impact on vision as a whole, which is the effect of hybrid complementarity. After complementary scrambling of the original image, the overall time domain and frequency domain are changed, which can also achieve the purpose of protecting the useful information of the image [23][24][25].…”
Section: Design Of Antileakage Methods Of Digital Videomentioning
confidence: 99%
“…The drawback is that while the decoding algorithm remains polynomial time, the explicit construction of the lattice (computation of discrete logarithm) is not polynomial time anymore; though it can heuristically be made quasi-polynomial time [2]. This drawback can be cicumvented by resorting to product of finite fields, as recently done in the cryptosystem of Li et al [11].…”
Section: Adapting the Construction To Finite Fieldsmentioning
confidence: 99%
“…Boschini et al [13] propose a PKE scheme whose security is based on a variant of LWE for a specific class of ''hybrid lattices'' as defined by the authors, but the accompanying security arguments are lacking. Li et al [26] propose a PKE scheme based on the hardness of decoding and correcting errors on lattice vectors. The authors propose using a trapdoor function as a private key to solve BDD correctly; the resulting cryptosystem achieves IND-CCA2 security.…”
Section: Introductionmentioning
confidence: 99%