Lattice signatures without trapdoors
From MaRDI portal
Publication:2894441
Recommendations
- Asymptotically Efficient Lattice-Based Digital Signatures
- Asymptotically efficient lattice-based digital signatures
- Improved short lattice signatures in the standard model
- Trapdoors for hard lattices and new cryptographic constructions
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
Cited in
(only showing first 100 items - show all)- Lattice-based proof of shuffle and applications to electronic voting
- Speeding-up verification of digital signatures
- 0-RTT key exchange with full forward secrecy
- A code-based signature scheme from the Lyubashevsky framework
- Cryptanalysis of a code-based one-time signature
- Finding shortest lattice vectors faster using quantum search
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- On rejection sampling in Lyubashevsky's signature scheme
- Identity-based interactive aggregate signatures from lattices
- Ring signatures with user-controlled linkability
- A Digital Signature Scheme Based on CVP ∞
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Efficient lattice-based polynomial evaluation and batch ZK arguments
- Tightly secure signature schemes from the LWE and subset sum assumptions
- High-speed signatures from standard lattices
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Post-quantum online voting scheme
- Analysis of error terms of signatures based on learning with errors
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A framework for cryptographic problems from linear algebra
- Lattice-based revocable certificateless signature
- Finite interval-time transition system for real-time actors
- A framework for practical anonymous credentials from lattices
- Analysis of the security of the PSSI problem and cryptanalysis of the Durandal signature scheme
- Lattice signature with efficient protocols, application to anonymous credentials
- Lattice-based key exchange on small integer solution problem
- Digital signatures from the middle-product LWE
- Lattice-based cryptography: a survey
- On removing rejection conditions in practical lattice-based signatures
- Quantum key search for ternary LWE
- Short identity-based signatures with tight security from lattices
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Efficient multi-party concurrent signature from lattices
- Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Post-quantum asynchronous deniable key exchange and the signal handshake
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- SETLA: Signature and Encryption from Lattices
- One-shot verifiable encryption from lattices
- A new lattice-based online/offline signatures framework for low-power devices
- Dilithium for memory constrained devices
- Lattice-based inner product argument
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Banquet: short and fast signatures from AES
- Survey of information security
- A compressed \(\varSigma \)-protocol theory for lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- How to meet ternary LWE keys
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- On the multi-user security of LWE-based NIKE
- A secure hierarchical deterministic wallet with stealth address from lattices
- Practical product proofs for lattice commitments
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Efficient lattice-based signature scheme
- Lattice-based certificateless encryption scheme
- The security of the code-based signature scheme based on the Stern identification protocol
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Shorter hash-and-sign lattice-based signatures
- Efficient lattice-based traceable ring signature scheme with its application in blockchain
- Adding Linkability to Ring Signatures with One-Time Signatures
- Policy-based signature scheme from lattices
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Does Fiat-Shamir require a cryptographic hash function?
- SKCN: practical and flexible digital signature from module lattice
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Efficient lattice-based inner-product functional encryption
- Improved power analysis attacks on Falcon
- Tightly secure signatures from lossy identification schemes
- Asymptotically Efficient Lattice-Based Digital Signatures
- Verifiable Decryption for Fully Homomorphic Encryption
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013
- A generic construction of fuzzy signature
- Multi-bit leveled homomorphic encryption via dual LWE-based
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- Cryptanalysis of a round optimal lattice-based multisignature scheme
- On the semantic security of functional encryption schemes
- Lattice-based programmable hash functions and applications
- A novel certificateless multi-signature scheme over NTRU lattices
- Memory-efficient attacks on small LWE keys
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Untraceability of partial blind and blind signature schemes
- Improvement and efficient implementation of a lattice-based signature scheme
- Forward security of Fiat-Shamir lattice signatures
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- DualRing: generic construction of ring signatures with efficient instantiations
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- A non-PCP approach to succinct quantum-safe zero-knowledge
- A new key recovery attack on a code-based signature from the Lyubashevsky framework
This page was built for publication: Lattice signatures without trapdoors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894441)