An Improved Compression Technique for Signatures Based on Learning with Errors
From MaRDI portal
Publication:5404744
DOI10.1007/978-3-319-04852-9_2zbMath1295.94011OpenAlexW49132692WikidataQ61914011 ScholiaQ61914011MaRDI QIDQ5404744
Publication date: 28 March 2014
Published in: Topics in Cryptology – CT-RSA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04852-9_2
Related Items (39)
Lattice-based proof of shuffle and applications to electronic voting ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Duplication free public keys based on SIS-type problems ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ Asymptotically efficient lattice-based digital signatures ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ 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 ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ Analysis of Error Terms of Signatures Based on Learning with Errors ⋮ Analysis of error-correcting codes for lattice-based key exchange ⋮ The lattice-based digital signature scheme qTESLA ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Unnamed Item ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Post-Quantum Cryptography: State of the Art ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ (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 ⋮ Quantum-resistant identity-based signature with message recovery and proxy delegation ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ On removing rejection conditions in practical lattice-based signatures
Uses Software
This page was built for publication: An Improved Compression Technique for Signatures Based on Learning with Errors
