Error correction and ciphertext quantization in lattice cryptography
From MaRDI portal
Publication:6190152
DOI10.1007/978-3-031-38554-4_21OpenAlexW4385654739MaRDI QIDQ6190152
Daniele Micciancio, Mark Schultz
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_21
Cites Work
- Unnamed Item
- Unnamed Item
- Log-concavity and strong log-concavity: a review
- On Lovász' lattice reduction and the nearest lattice point problem
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- A modular analysis of the Fujisaki-Okamoto transformation
- The closest vector problem in tensored root lattices of type A and in their duals
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Theory of cryptography. 17th international conference, TCC 2019, Nuremberg, Germany, December 1--5, 2019. Proceedings. Part I
- Generic and practical key establishment from lattice
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- (Leveled) fully homomorphic encryption without bootstrapping
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- Lattice Coding for Signals and Networks
- Public-key cryptosystems from the worst-case shortest vector problem
- The Kannan–Lovász–Simonovits conjecture
- Linear-Time Nearest Point Algorithms for Coxeter Lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Simultaneous Packing and Covering in Euclidean Space
- On lattices, learning with errors, random linear codes, and cryptography
- The covering of space by spheres
- Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
- The basic distributional theory for the product of zero mean correlated normal random variables
This page was built for publication: Error correction and ciphertext quantization in lattice cryptography
