Hardness of SIS and LWE with Small Parameters
From MaRDI portal
Publication:2845658
DOI10.1007/978-3-642-40041-4_2zbMath1310.94161OpenAlexW39036742MaRDI QIDQ2845658
Daniele Micciancio, Chris Peikert
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_2
Related Items (48)
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ How to meet ternary LWE keys ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Property-preserving hash functions for Hamming distance from standard assumptions ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Quantum algorithms for variants of average-case lattice problems via filtering ⋮ Asymptotically efficient lattice-based digital signatures ⋮ 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 ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ On the hardness of module learning with errors with short distributions ⋮ Multi-key Homomorphic Authenticators ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Indistinguishability obfuscation ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Lattice-based e-cash, revisited ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Computational fuzzy extractors ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ 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 ⋮ Modular lattice signatures, revisited ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Chosen-ciphertext lattice-based public key encryption with equality test in standard model ⋮ Worst-case to average-case reductions for module lattices ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
Uses Software
This page was built for publication: Hardness of SIS and LWE with Small Parameters
