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 Multi-user Security Under Adaptive Corruptions from LWE in the Standard Model

Shuai Han, Shengli Liu, Zhedong Wang, Dawu Gu

Published Jan 1, 2023• 9 citations
Publisher
DOI
10.1007/978-3-031-38554-4_22

Related papers

On the Multi-user Security of LWE-Based NIKE

Roman Langrehr

Lecture notes in computer science•Jan 1, 2023•3 citations

On Multi-User Security of Lattice-Based Signature Under Adaptive Corruptions and Key Leakages

Masayuki Fukumitsu, Shingo Hasegawa

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

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao

Lecture notes in computer science•Jan 1, 2016•11 citations

Multi-Client Functional Encryption for Linear Functions in the Standard Model from LWE

Benoît Libert, Radu Ţiţiu

Lecture notes in computer science•Jan 1, 2019•54 citations

Revocable Identity-Based Encryption Scheme Under LWE Assumption in the Standard Model

Yaling Zhang, Shangping Wang, Qing Du

A revocable identity-based encryption (IBE) scheme under learning with error (LWE) assumption from lattice is proposed; compared with the existing IBE schemes from lattices, two improvements are available in the new scheme. First, the revocation mechanism for identity of user (or thing) is added in the new scheme to manage the dynamic user (or thing) identity in the system, and making the IBE scheme from lattice becomes more practical than ever before. Second, the security of the new scheme is based on the LWE assumption from lattice, so our construction has a solid secure foundation. The scheme is proved to be secured against adaptive-ID attacks under LWE assumption from lattice in the standard model.

IEEE Access•Jan 1, 2018•3 citations

Post-quantum Insecurity from LWE

Alex Lombardi, Ethan Mook, Willy Quach +1 more

Lecture notes in computer science•Jan 1, 2022•5 citations
A revocable identity-based encryption (IBE) scheme under learning with error (LWE) assumption from lattice is proposed; compared with the existing IBE schemes from lattices, two improvements are available in the new scheme. First, the revocation mechanism for identity of user (or thing) is added in the new scheme to manage the dynamic user (or thing) identity in the system, and making the IBE scheme from lattice becomes more practical than ever before. Second, the security of the new scheme is based on the LWE assumption from lattice, so our construction has a solid secure foundation. The scheme is proved to be secured against adaptive-ID attacks under LWE assumption from lattice in the standard model.