Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Qiqi Lai, Feng-Hao Liu, Zhedong Wang

Published Jan 1, 2020• 17 citations
Publisher
DOI
10.1007/978-3-030-45374-9_22

Related papers

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

Zhedong Wang, Qiqi Lai, Feng-Hao Liu

Designs Codes and Cryptography•Nov 19, 2024•0 citations

Lattice IBE from Non-spherical Gaussian Sampling with Tight Security

Guotao Chai, Renjie Jin, Shuoqu Jian +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

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

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

Lecture notes in computer science•Dec 7, 2025•0 citations

Adaptively Secure IBE from Lattices with Asymptotically Better Efficiency

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Lecture notes in computer science•Jan 1, 2015•47 citations

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Journal of Cryptology•Aug 21, 2017•31 citations