Two-round threshold lattice-based signatures from threshold homomorphic encryption
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- A lattice-based provably secure multisignature scheme in quantum random oracle model
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A toolkit for ring-LWE cryptography
- Actively secure setup for SPDZ
- An efficient and parallel Gaussian sampler for lattices
- Bandwidth-efficient threshold EC-DSA
- Fast secure two-party ECDSA signing
- Fast threshold ECDSA with honest majority
- FROST: Flexible round-optimized Schnorr threshold signatures
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- How to share a secret
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Lattice signatures without trapdoors
- Lattice-based Cryptography
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- More efficient amortization of exact zero-knowledge proofs for LWE
- More efficient commitments from structured lattice assumptions
- MuSig-L: lattice-based multi-signature with single-round online phase
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On ideal lattices and learning with errors over rings
- On the concrete hardness of learning with errors
- Practical Schnorr threshold signatures without the algebraic group model
- Round-optimal lattice-based threshold signatures, revisited
- Sharing the LUOV: threshold post-quantum signatures
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Two-round threshold signature from algebraic one-more learning with errors
Cited in
(15)- Unmasking \textsf{TRaccoon}: a lattice-based threshold signature with an efficient identifiable abort protocol
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- Two-round threshold signature from algebraic one-more learning with errors
- Finally! A compact lattice-based threshold signature
- Partially non-interactive two-round lattice-based threshold signatures
- Strongly secure universal thresholdizer
- Improved universal thresholdizer from iterative Shamir secret sharing
- Partial lattice trapdoors: how to split lattice trapdoors, literally
- A lattice-based IND-CCA threshold KEM from the BCHK+ transform
- \textsf{TalonG}: bandwidth-efficient two-round threshold signatures from lattices
- Tweed: adaptively secure lattice-based two-round threshold signatures
- Optimal threshold traitor tracing
- HRA-secure homomorphic lattice-based proxy re-encryption with tight security
- Scalable two-round n-out-of-n and multi-signatures from lattices in the quantum random oracle model
- Tightly secure threshold signatures over pairing-free groups
This page was built for publication: Two-round threshold lattice-based signatures from threshold homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030925)
