Search Results - "Bounded Distance Decoding Problem"

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications by Li, Zhe, Ling, San, Xing, Chaoping, Yeo, Sze Ling

“…In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices…”
Get full text

Improved analysis of the reduction from BDD to uSVP by Zhao, Chunhuan, Zheng, Zhongxiang

“…In ICALP 2016, Bai, Stehlé and Wen showed that for polynomially bounded parameter γ, the Bounded Distance Decoding (BDD) problem with parameter 1/(2γ) can be…”
Get full text

Fully Homomorphic Encryption Using Hidden Ideal Lattice by Plantard, Thomas, Susilo, Willy, Zhenfei Zhang

“…All the existing fully homomorphic encryption schemes are based on three different problems, namely the bounded distance decoding problem over ideal lattice, the approximate greatest common divisor…”
Get full text

An Additively Homomorphic Encryption over Large Message Space by Chen, Hu, Hu, Yupu, Lian, Zhizhu, Jia, Huiwen, Wang, Xu An

“…Fully homomorphic encryption schemes available are not efficient enough to be practical, and a number of real-world applications require only that a…”
Get full text

An Additively Homomorphic Encryption from Ideal Lattices by Hu Chen, Yupu Hu, Huiwen Jia

“…An additively homomorphic encryption scheme based heavily on Smart-Vercauteren encryption scheme (SV10 scheme, PKC 2010) is put forward, where both schemes…”
Get full text

Using Variational Quantum Algorithm to Solve the LWE Problem by Lv, Lihui, Yan, Bao, Wang, Hong, Ma, Zhi, Fei, Yangyang, Meng, Xiangdong, Duan, Qianheng

“…) using VQA are proposed. First, after reducing the LWE problem into the bounded distance decoding problem, the quantum approximation optimization algorithm (QAOA…”
Get full text

Accurate Score Prediction for Dual-Sieve Attacks: Accurate Score Prediction for Dual-Sieve Attacks by Ducas, Léo, Pulles, Ludo N.

“…Guo and Johansson (ASIACRYPT 2021), and MATZOV (tech. report 2022) have independently claimed improved attacks against various NIST lattice candidates by using…”
Get full text

Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo by Athukorala, Pabasara, Galbraith, Steven D.

“… The security of the scheme relies on both the decoding problem for <inline-formula> <tex-math notation="LaTeX">(q-1) </tex-math></inline-formula>-ary codes, and the Bounded Distance Decoding problem…”
Get full text

On the List and Bounded Distance Decodability of Reed–Solomon Codes by Cheng, Qi, Wan, Daqing

“… The bounded distance decoding problem is to find one codeword if there is at least one codeword within the given distance, or to output the empty set if there is…”
Get full text

A note on BDD problems with λ2-gap by Liu, Mingjie, Wang, Xiaoyun, Xu, Guangwu, Zheng, Xuexin

“…In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2γ (Bounded Distance Decoding Problem) ⩽ uSVPγ…”
Get full text

Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor by Micciancio, Daniele

“…Lattices have received considerable attention as a potential source of computational hardness to be used in cryptography, after a breakthrough result of Ajtai…”
Get full text

A note on BDD problems with [lamda]-gap by Liu, Mingjie, Wang, Xiaoyun, Xu, Guangwu, Zheng, Xuexin

“…In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD... (Bounded Distance Decoding Problem) ≤ uSVP…”
Get full text

A note on BDD problems with lambda 2 lambda 2-gap by Liu, Mingjie, Wang, Xiaoyun, Xu, Guangwu, Zheng, Xuexin

“… (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem…”
Get full text

Lattice Problems: New Lower and Upper Bounds by Tang, Yi

“…In the upcoming era of quantum computation, those successful classical, number-theoretical public-key cryptosystems that get widely deployed nowadays, such as…”
Get full text

NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem by Gandikota, Venkata, Ghazi, Badih, Grigorescu, Elena

“…Establishing the complexity of Bounded Distance Decoding for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami…”
Get full text

On the NP-hardness of bounded distance decoding of Reed-Solomon codes by Gandikota, Venkata, Ghazi, Badih, Grigorescu, Elena

“… Understanding the complexity of this Bounded Distance Decoding problem as the amount of error in the target decreases is an important open problem in the study of Reed-Solomon codes…”
Get full text

On the list and bounded distance decodibility of Reed-Solomon codes by Qi Cheng, Daqing Wan

“… The bounded distance decoding problem is to find one codeword if there is at least one codeword within the given distance, or to output the empty set if there is…”
Get full text

An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem by Eldar, Lior, Shor, Peter W

“… Using a "smooth" analysis of lattices by SysNF lattices we design a quantum algorithm that can efficiently solve the following variant of the bounded-distance-decoding problem…”
Get full text

Limits on the Hardness of Lattice Problems in ℓp Norms by Peikert, Chris

“… Approximating the closest vector and bounded distance decoding problems with preprocessing to within factors can be accomplished in deterministic polynomial time…”
Get full text

Local and Global Computation on Algebraic Data by Gandikota, Venkata Surya Srikanth

“…Point lattices and error-correcting codes are algebraic structures with numerous applications in communication, storage, and cryptography. In this dissertation…”
Get full text