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 Lattice-Based Signatures from Threshold Homomorphic Encryption

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

Published Jan 1, 2024• 29 citations
Publisher
DOI
10.1007/978-3-031-62746-0_12

Related papers

Threshold Cryptosystems from Threshold Fully Homomorphic Encryption

Dan Boneh, Rosario Gennaro, Steven Goldfeder +4 more

Lecture notes in computer science•Jan 1, 2018•246 citations

Multiparty Computation from Threshold Homomorphic Encryption

Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2001•588 citations

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

Fully-Homomorphic Encryption from Lattice Isomorphism

Pedro Costa Branco, Giulio Malavolta, Zayd Maradni

Lecture notes in computer science•Dec 1, 2025•5 citations

Round-optimal lattice-based threshold signatures, revisited

Shweta Agrawal, Damien Stehlé, Anshu Yadav

•Jan 1, 2022•2 citations

Two-round quantum homomorphic encryption scheme based on matrix decomposition

Tao Shang, Shuolin Wang, Yazhuo Jiang +1 more

Quantum Information Processing•Nov 28, 2023•9 citations