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

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

Published Jan 1, 2022• 24 citations
Publisher
DOI
10.1007/978-3-030-97131-1_17

Related papers

Lattice-Based Blind Signatures

Markus Rückert

Lecture notes in computer science•Jan 1, 2010•126 citations

Lattice-Based Blind Signatures, Revisited

Eduard Hauck, Eike Kiltz, Julian Loss +1 more

Lecture notes in computer science•Jan 1, 2020•59 citations

A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling

Rafaël del Pino, Shuichi Katsumata

Lecture notes in computer science•Jan 1, 2022•53 citations

Development of a lattice based blind signature scheme

Frank Nauheimer

•Jan 1, 2007•1 citation

Can Round-Optimal Lattice-Based Blind Signatures be Practical?

Shweta Agrawal, Elena Kirshanova, Damien Stehlé +1 more

•Jan 1, 2021•1 citation

Lattice Blind Signatures with Forward Security

Huy Quoc Le, Dung Hoang Duong, Willy Susilo +4 more

arXiv:2007.06884•Lecture notes in computer science•Jan 1, 2020•0 citations