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

“…, the Bounded Distance Decoding (BDD) problem with parameter 1/(2γ) can be probabilistically reduced to the unique Shortest Vector Problem (uSVP) with parameter γ…”
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

Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices by Ducas, Léo, Pierrot, Cécile

“…We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD…”
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

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

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding by Aggarwal, Divesh, Chen, Yanlin, Kumar, Rajendra, Shen, Yixin

“…The most important computational problem on lattices is the Shortest Vector Problem (SVP…”
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

Bounded distance decoding of linear error-correcting codes with Gröbner bases by Bulygin, Stanislav, Pellikaan, Ruud

“…The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed…”
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

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

On the hardnesses of several quantum decoding problems by Kuo, Kao-Yueh, Lu, Chung-Chin

“…: quantum bounded distance decoding (QBDD), quantum maximum likelihood decoding (QMLD), and quantum minimum error probability decoding (QMEPD…”
Get full text

On the Closest Vector Problem with a Distance Guarantee by Dadush, Daniel, Regev, Oded, Stephens-Davidowitz, Noah

“…We present a new efficient algorithm for the search version of the approximate Closest Vector Problem with Preprocessing (CVPP…”
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

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 and Vardy (IEEE Trans. Inf. Theory, 2005…”
Get full text

Improving BDD Enumeration for LWE Problem Using GPU by Esseissah, Mohamed S., Bhery, Ashraf, Bahig, Hatem M.

“…) problem using a lattice-based Bounded Distance Decoding (BDD) approach. To the best of our knowledge, this is the first GPU-based implementation for the LWE problem…”
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

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

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

Toward Non-interactive Zero-Knowledge Proofs for NP from LWE by Rothblum, Ron D., Sealfon, Adam, Sotiraki, Katerina

“… a decisional variant of the bounded distance decoding ( BDD ) problem. That is, we show that assuming LWE , every language L…”
Get full text