Practical MP - LWE-based encryption balancing security-risk versus efficiency
From MaRDI portal
Publication:2334442
Recommendations
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- scientific article; zbMATH DE number 1418252
- Efficient fully homomorphic encryption from (standard) LWE
- Towards efficient LPN-based symmetric encryption
- Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- Compact (targeted homomorphic) inner product encryption from LWE
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Verifying solutions to LWE with implications for concrete security
Cites work
- A modular analysis of the Fujisaki-Okamoto transformation
- Concentration inequalities. A nonasymptotic theory of independence
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Efficient computation of the DFT with only a subset of input or output points
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Faster arithmetic for number-theoretic transforms
- Finding shortest lattice vectors faster using quantum search
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generalized Compact Knapsacks Are Collision Resistant
- How (not) to instantiate ring-LWE
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- Large modulus ring-LWE \(\geq \) module-LWE
- Lattice cryptography for the internet
- Middle-product Learning with Errors
- Minkowski's Convex Body Theorem and Integer Programming
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the efficacy of solving LWE by reduction to unique-SVP
- On the ring-LWE and polynomial-LWE problems
- Provably weak instances of Ring-LWE
- Provably weak instances of ring-LWE revisited
- Recovering short generators of principal ideals in cyclotomic rings
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Secure integration of asymmetric and symmetric encryption schemes
- Short Stickelberger class relations and application to Ideal-SVP
- The middle product algorithm. I: Speeding up the division and square root of power series
- Weak instances of PLWE
- Worst-case to average-case reductions for module lattices
Cited in
(13)- Middle-product Learning with Errors
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- Improved efficiency of MP12
- MPSign: a signature from small-secret middle-product learning with errors
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Making the BKW algorithm practical for LWE
- 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
- Lattice trapdoors and IBE from middle-product LWE
- Middle-product learning with rounding problem and its applications
- Algebraically structured LWE, revisited
- Middle-products of skew polynomials and learning with errors
- Improved reduction from \textsf{RLWE} to \textsf{MP-LWE}
This page was built for publication: Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334442)
