Hardness of SIS and LWE with small parameters
From MaRDI portal
Publication:2845658
DOI10.1007/978-3-642-40041-4_2zbMATH Open1310.94161OpenAlexW39036742MaRDI QIDQ2845658FDOQ2845658
Authors: 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
Recommendations
Cited In (63)
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Lattice signature with efficient protocols, application to anonymous credentials
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Property-preserving hash functions for Hamming distance from standard assumptions
- How to meet ternary LWE keys
- Watermarking cryptographic functionalities from standard lattice assumptions
- LWE without modular reduction and improved side-channel attacks against BLISS
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Entropic hardness of Module-LWE from module-NTRU
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Multi-key Homomorphic Authenticators
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Quantum algorithms for variants of average-case lattice problems via filtering
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- A key exchange based on the short integer solution problem and the learning with errors problem
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- Lattice-based e-cash, revisited
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Multi-theorem preprocessing NIZKs from lattices
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Verifiable single-server private information retrieval from LWE with binary errors
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Computational fuzzy extractors
- Towards sound fresh re-keying with hard (physical) learning problems
- MuSig-L: lattice-based multi-signature with single-round online phase
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Modular lattice signatures, revisited
- On the hardness of module learning with errors with short distributions
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Asymptotically efficient lattice-based digital signatures
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- Worst-case to average-case reductions for module lattices
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- On the concrete security of LWE with small secret
- Indistinguishability obfuscation
- Hardness of (M)LWE with semi-uniform seeds
- Quantum CCA-secure PKE, revisited
- Tagged chameleon hash from lattices and application to redactable blockchain
- Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model
- Forward-Secure Group Encryptions from Lattices
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- A systematic study of sparse LWE
- Revocable policy-based chameleon hash using lattices
- Lattice problems beyond polynomial time
Uses Software
This page was built for publication: Hardness of SIS and LWE with small parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845658)
