Lattice Signatures and Bimodal Gaussians
From MaRDI portal
Publication:2845659
DOI10.1007/978-3-642-40041-4_3zbMath1310.94141OpenAlexW2900370870MaRDI QIDQ2845659
Vadim Lyubashevsky, Tancrède Lepoint, Léo Ducas, Alain Durmus
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_3
Related Items (82)
Computational quantum key distribution (CQKD) on decentralized ledger and blockchain ⋮ A constant-time sampling algorithm for binary Gaussian distribution over the integers ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ How to meet ternary LWE keys ⋮ Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security ⋮ Policy-based signature scheme from lattices ⋮ Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite ⋮ Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures ⋮ How to find ternary LWE keys using locality sensitive hashing ⋮ Survey of information security ⋮ Integer LWE with non-subgaussian error and related attacks ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ Duplication free public keys based on SIS-type problems ⋮ Asymptotically efficient lattice-based digital signatures ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ Finding shortest lattice vectors faster using quantum search ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ On the feasibility of single-trace attacks on the Gaussian sampler using a CDT ⋮ A signature scheme from the finite field isomorphism problem ⋮ A lightweight identification protocol based on lattices ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Shorter hash-and-sign lattice-based signatures ⋮ SETLA: Signature and Encryption from Lattices ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ Ring signatures with user-controlled linkability ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ Lattice-based inner product argument ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Lattice-based programmable hash functions and applications ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Choosing Parameters for NTRUEncrypt ⋮ An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice ⋮ 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 ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ The lattice-based digital signature scheme qTESLA ⋮ Second order statistical behavior of LLL and BKZ ⋮ NTRU prime: reducing attack surface at low cost ⋮ ``Oops, I did it again -- security of one-time signatures under two-message attacks ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ Post-Quantum Cryptography: State of the Art ⋮ 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 ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Modular lattice signatures, revisited ⋮ An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers ⋮ Quantum key search for ternary LWE ⋮ On removing rejection conditions in practical lattice-based signatures
Uses Software
This page was built for publication: Lattice Signatures and Bimodal Gaussians
