Compact lattice-coded (multi-recipient) Kyber without CLT independence assumption
From MaRDI portal
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A modular analysis of the Fujisaki-Okamoto transformation
- A novel CCA attack using decryption errors against LAC
- Analysis of error-correcting codes for lattice-based key exchange
- Decryption failure attacks on IND-CCA secure lattice-based schemes
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fast quantizing and decoding and algorithms for lattice quantizers and codes
- Lattice codes for CRYSTALS-Kyber
- Lattice Codes for Lattice-Based PKE
- Least squares quantization in PCM
- Maximum likelihood decoding of the Leech lattice
- On lattices, learning with errors, random linear codes, and cryptography
- On the Voronoi Regions of Certain Lattices
- Packed ciphertexts in LWE-based homomorphic encryption
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Security in Communication Networks
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- TFHE: fast fully homomorphic encryption over the torus
This page was built for publication: Compact lattice-coded (multi-recipient) Kyber without CLT independence assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228250)