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