An improved compression technique for signatures based on learning with errors
From MaRDI portal
Recommendations
Cited in
(55)- Analysis of error-correcting codes for lattice-based key exchange
- Document ranking for variable bit-block compression signatures
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Signatures from sequential-OR proofs
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- MPSign: a signature from small-secret middle-product learning with errors
- On removing rejection conditions in practical lattice-based signatures
- Compact ring signatures from learning with errors
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- The lattice-based digital signature scheme qTESLA
- Quantum-resistant identity-based signature with message recovery and proxy delegation
- Duplication free public keys based on SIS-type problems
- Asymptotically efficient lattice-based digital signatures
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Post-quantum cryptography: state of the art
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Comparison of signature file models with superimposed coding
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- A practical post-quantum public-key cryptosystem based on spLWE
- Analysis of error terms of signatures based on learning with errors
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Zero-knowledge proofs from spLWE-based commitments
- Multitarget decryption failure attacks and their application to Saber and Kyber
- Topics in Cryptology – CT-RSA 2004
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- SETLA: Signature and Encryption from Lattices
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
- Fiat-Shamir signatures based on module-NTRU
- On rejection sampling in Lyubashevsky's signature scheme
- A new lattice-based online/offline signatures framework for low-power devices
- Lattice-based programmable hash functions and applications
- Masking the GLP lattice-based signature scheme at any order
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- A Compact Digital Signature Scheme Based on the Module-LWR Problem
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- A new R-LWE based digital signature scheme
- The security of ML-DSA against fault-injection attacks
- Compact lattice signatures via iterative rejection sampling
- Designated-verifier ring signatures: strong definitions, generic constructions and efficient instantiations
- NTRU+Sign: compact NTRU-based signatures using bimodal distributions
- Current paradigms for construction of lattice-based digital signature schemes
- Optimized G+G signature
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Lattice-based proof of shuffle and applications to electronic voting
- SoK: how (not) to design and implement post-quantum cryptography
This page was built for publication: An improved compression technique for signatures based on learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404744)
