Better key sizes (and attacks) for LWE-based encryption
From MaRDI portal
Publication:3073715
Recommendations
- On the concrete hardness of learning with errors
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- Practical analysis of key recovery attack against search-LWE problem
- On lattices, learning with errors, random linear codes, and cryptography
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A sieve algorithm for the shortest lattice vector problem
- An efficient and parallel Gaussian sampler for lattices
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster exponential time algorithms for the shortest vector problem
- Fully homomorphic encryption using ideal lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice-based Cryptography
- Lossy trapdoor functions and their applications
- New bounds in some transference theorems in the geometry of numbers
- New lattice-based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model
- On Lovász' lattice reduction and the nearest lattice point problem
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Predicting Lattice Reduction
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Public-key cryptosystems from the worst-case shortest vector problem
- Selecting cryptographic key sizes
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(only showing first 100 items - show all)- Lattice-based certificateless encryption scheme
- Lattice-based cryptography: a survey
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- scientific article; zbMATH DE number 697799 (Why is no real title available?)
- Improved efficiency of MP12
- Practical analysis of key recovery attack against search-LWE problem
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- How (not) to instantiate ring-LWE
- Anonymous, robust post-quantum public key encryption
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- An experimental study of Kannan's embedding technique for the search LWE problem
- Cryptanalysis of compact-LWE
- Provably weak instances of Ring-LWE
- Lattice-based SNARGs and their application to more efficient obfuscation
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- Provably secure password authenticated key exchange based on RLWE for the post-quantum world
- Secret computation of purchase history data using somewhat homomorphic encryption
- Post-quantum key exchange for the Internet and the open quantum safe project
- Towards post-quantum security for signal's X3DH handshake
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Random sampling revisited: lattice enumeration with discrete pruning
- Cryptanalysis of a round optimal lattice-based multisignature scheme
- A practical post-quantum public-key cryptosystem based on spLWE
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Gauss sieve algorithm on GPUs
- Polly cracker, revisited
- The geometry of lattice cryptography
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- FHEW with Efficient Multibit Bootstrapping
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Dual lattice attacks for closest vector problems (with preprocessing)
- Analysis of error-correcting codes for lattice-based key exchange
- Estimating quantum speedups for lattice sieves
- Lattice Point Enumeration on Block Reduced Bases
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Analyzing the shuffling side-channel countermeasure for lattice-based signatures
- On the efficacy of solving LWE by reduction to unique-SVP
- Coded-BKW: solving LWE using lattice codes
- Lattice-based key exchange on small integer solution problem
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- New techniques for SIDH-based NIKE
- Solving LWR via BDD Strategy: Modulus Switching Approach
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- Estimating key sizes for high dimensional lattice-based systems
- Multi-bit leveled homomorphic encryption via dual LWE-based
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Homomorphic AES evaluation using the modified LTV scheme
- Predicting the concrete security of LWE against the dual attack using binary search
- STP-LWE: A variant of learning with error for a flexible encryption
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- Homomorphic Encryption Standard
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Revocable hierarchical identity-based authenticated key exchange
- On the asymptotic complexity of solving LWE
- LWE from non-commutative group rings
- Semantic security and indistinguishability in the quantum world
- On the complexity of the BKW algorithm on LWE
- On Quantum Chosen-Ciphertext Attacks and Learning with Errors
- Practical FHE parameters against lattice attacks
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- LWE with side information: attacks and concrete security estimation
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- A public-key encryption scheme based on non-linear indeterminate equations
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- A secure hierarchical deterministic wallet with stealth address from lattices
- Generic and practical key establishment from lattice
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- Secure Implementation of Lattice-Based Encryption Schemes
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Concrete security from worst-case to average-case lattice reductions
- Finding and evaluating parameters for BGV
- Quantum lattice enumeration in limited depth
- On the concrete security of LWE with small secret
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- On the quantum security of high-dimensional RSA protocol
- NTWE: A Natural Combination of NTRU and LWE
- Post-quantum cryptography: state of the art
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Too many hints -- when LLL breaks LWE
- \(k\)-SUM in the sparse regime: complexity and applications
- Zaytun: lattice based PKE and KEM with shorter ciphertext size
- Making the BKW algorithm practical for LWE
- Security of public key encryption against resetting attacks
- Secure statistical analysis using RLWE-based homomorphic encryption
- Tightly secure ring-LWE based key encapsulation with short ciphertexts
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Lattice-based identity-based resplittable threshold public key encryption scheme
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
This page was built for publication: Better key sizes (and attacks) for LWE-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073715)
