1 citations · 1 across the 6 of their papers we have counts for
6 papers
Faster SVP in Polynomial Space
Yansong Feng, Yiming Gao, Jiaqi Liu
Kannan's algorithm, as analyzed by Hanrot and Stehlé in 2007, solves the exact Euclidean shortest vector problem in polynomial space and time. In the classi…
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
Jiaqi Liu, Yansong Feng, Yanbin Pan
Let range over primes congruent to modulo . Let be a primitive th root of unity, and put , with ring of integers $\mathcal{O}_K=\mathbb{Z}[ζ_…
CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan
We prove that exact Euclidean decision-CVP is -complete on the coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings $R_d:=\mathbb{Z}[y…
Ciphertext-Policy ABE for Circuits with Constant-Size Ciphertexts from Succinct LWE
Jiaqi Liu, Yuanyi Zhang, Fang-Wei Fu
We construct a lattice-based ciphertext-policy attribute-based encryption (CP-ABE) scheme for access policies with constant-size ciphertexts. Let be the securit…
Decentralized Multi-Authority Attribute-Based Inner-Product Functional Encryption: Noisy and Evasive Constructions from Lattices
Jiaqi Liu, Yan Wang, Fang-Wei Fu
We study multi-authority attribute-based functional encryption for noisy inner-product functionality, and propose two new primitives: (1) multi-authority attribute-based (noisy) in…
Learning with Errors over Group Rings Constructed by Semi-direct Product
Jiaqi Liu, Fang-Wei Fu
The Learning with Errors (\LWE) problem has been widely utilized as a foundation for numerous cryptographic tools over the years. In this study, we focus on an algebraic variant of…