Search Results - bounded distance decoding problems*

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

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

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). In this paper, we present new algorithms that improve the…”
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

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

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

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

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

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

On the independence heuristic in the dual attack by Bashiri Kaveh, Wiemers Andreas

“… Along the main candidates for quantum-safe solutions are cryptographic schemes, whose security is based on classic lattice problems such as the bounded-distance decoding (BDD…”
Get full text

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

“… It is thus important to better understand the complexity of lattice problems.In this thesis…”
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

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

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). Our algorithm achieves an…”
Get full text

Codes & Lattices: Computational Complexity and Constructions by Veliche Hostetler, Alexandra

“… problems.We study the computational complexity of two key problems relevant to cryptography…”
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