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

Two-Round Threshold Signature from Algebraic One-More Learning with Errors

Thomas Espitau, Shuichi Katsumata, Kaoru Takemure

Published Jan 1, 2024• 25 citations
Publisher
DOI
10.1007/978-3-031-68394-7_13

Related papers

Two-Round Threshold Signature from Algebraic One-More Learning with Errors

Thomas Espitau, Shuichi Katsumata, Kaoru Takemure

Journal of Cryptology•Aug 15, 2025•8 citations

Two-Round Threshold Lattice-Based Signatures from Threshold Homomorphic Encryption

Kamil Doruk Gür, Jonathan I. Katz, Tjerand Silde

Lecture notes in computer science•Jan 1, 2024•29 citations

Round-optimal lattice-based threshold signatures, revisited

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2022•2 citations

Towards Practical and Round-Optimal Lattice-Based Threshold and Blind Signatures.

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2021•1 citation

Round-Optimal Threshold Blind Signature from Lattices

Haoqi Zhang, Qi Li, Leo Yu Zhang +1 more

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

Two-Round Oblivious Linear Evaluation from Learning with Errors

Pedro Costa Branco, Nico Döttling, Paulo Mateus

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