Designs Codes and Cryptography

Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more

Zhedong Wang, Qiqi Lai, Feng-Hao Liu

Published Nov 19, 2024• 0 citations

Related papers

Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More

Qiqi Lai, Feng-Hao Liu, Zhedong Wang

Adaptively Secure IBE from Lattices with Asymptotically Better Efficiency

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

Lattice IBE from Non-spherical Gaussian Sampling with Tight Security

Guotao Chai, Renjie Jin, Shuoqu Jian +1 more

Revisiting Adaptively Secure IBE from Lattices with Smaller Modulus: A Conceptually Simple Framework with Low Overhead

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

More Efficient Tightly-Secure Lattice-Based Ibe with Equality Test

Quanbo Qu, Baocang Wang, Leizhang Wang +2 more

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay