Two-round threshold signature from algebraic one-more learning with errors

DOI10.1007/978-3-031-68394-7_13MaRDI QIDQ6653014FDOQ6653014

Authors: Thomas Espitau, Shuichi Katsumata, Kaoru Takemure

Publication date: 13 December 2024

Recommendations

Threshold raccoon: practical threshold signatures from standard lattice assumptions
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
Threshold and multi-signature schemes from linear hash functions

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

Security arguments for digital signatures and blind signatures
How to share a secret
Trapdoors for hard lattices and new cryptographic constructions
Efficient lattice (H)IBE in the standard model
Title not available (Why is that?)
Lattice signatures without trapdoors
Leveled fully homomorphic signatures from standard lattices
Title not available (Why is that?)
The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
Advances in Cryptology - CRYPTO 2003
Attribute-based encryption for circuits
Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
Title not available (Why is that?)
Separating succinct non-interactive arguments from all falsifiable assumptions
Separation Results on the “One-More” Computational Problems
Cryptography and Coding
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
Practical, Predictable Lattice Basis Reduction
Shortest vector from lattice sieving: a few dimensions for free
The algebraic group model and its applications
LWE with side information: attacks and concrete security estimation
CSI-FiSh: efficient isogeny based signatures through class group computations
Functional encryption for threshold functions (or fuzzy IBE) from lattices
Better zero-knowledge proofs for lattice encryption and their application to group signatures
FROST: Flexible round-optimized Schnorr threshold signatures
Adaptively secure distributed PRFs from LWE
Threshold cryptosystems from threshold fully homomorphic encryption
Key homomorphic PRFs and their applications
How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
Second order statistical behavior of LLL and BKZ
Predicate encryption for circuits from LWE
Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
Succinct vector, polynomial, and functional commitments from lattices
Threshold schemes from isogeny assumptions
Bandwidth-efficient threshold EC-DSA
Fast threshold ECDSA with honest majority
Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
Riding on asymmetry: efficient ABE for branching programs
ABE for circuits with constant-size secret keys and adaptive security
Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
MuSig2: simple two-round Schnorr multi-signatures
Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
On the hardness of module learning with errors with short distributions
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
The One-More Discrete Logarithm Assumption in the Generic Group Model
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Candidate witness encryption from lattice techniques
MuSig-L: lattice-based multi-signature with single-round online phase
Better than advertised security for non-interactive threshold signatures
Fully adaptive Schnorr threshold signatures
Practical Schnorr threshold signatures without the algebraic group model
Toward practical lattice-based proof of knowledge from Hint-MLWE
\textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
Round-optimal lattice-based threshold signatures, revisited
Threshold raccoon: practical threshold signatures from standard lattice assumptions

Cited In (4)

Lattice-based threshold, accountable, and private signature
Threshold raccoon: practical threshold signatures from standard lattice assumptions
\textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding

This page was built for publication: Two-round threshold signature from algebraic one-more learning with errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653014)