Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
From MaRDI portal
Publication:5918439
DOI10.1007/978-3-030-75245-3_5zbMath1479.94305OpenAlexW3164801972MaRDI QIDQ5918439
Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi, Ivan B. Damgård
Publication date: 21 December 2021
Published in: Public-Key Cryptography – PKC 2021 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_5
Related Items
Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Verifiable decryption in the head ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Covert authentication from lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tightly secure signatures from lossy identification schemes
- Efficient discrete logarithm based multi-signature scheme in the plain public key model
- Secure distributed key generation for discrete-log based cryptosystems
- Security arguments for digital signatures and blind signatures
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Masking the GLP lattice-based signature scheme at any order
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Threshold cryptosystems from threshold fully homomorphic encryption
- Four-round concurrent non-malleable commitments from one-way functions
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
- More efficient commitments from structured lattice assumptions
- An efficient lattice-based multisignature scheme with applications to bitcoins
- Bandwidth-efficient threshold EC-DSA
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- Sharing the LUOV: threshold post-quantum signatures
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Zero-knowledge elementary databases with more expressive queries
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Two-party ECDSA from hash proof systems and efficient instantiations
- Simple Schnorr multi-signatures with applications to bitcoin
- A lattice-based provably secure multisignature scheme in quantum random oracle model
- Improved OR-Composition of Sigma-Protocols
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- New Generic Algorithms for Hard Knapsacks
- Bonsai Trees, or How to Delegate a Lattice Basis
- An Efficient and Parallel Gaussian Sampler for Lattices
- A Lattice-Based Threshold Ring Signature Scheme
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A Toolkit for Ring-LWE Cryptography
- Improved Lattice-Based Threshold Ring Signature Scheme
- Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Fast secure two-party ECDSA signing
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
