Error correction and ciphertext quantization in lattice cryptography

DOI10.1007/978-3-031-38554-4_21MaRDI QIDQ6190152zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio, M. 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

zbMATH Keywords

fully homomorphic encryptionvector quantization

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Lattice cryptography for the internet
• Lattice Codes for Lattice-Based PKE
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Efficient public key encryption based on ideal lattices (extended abstract)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A modular analysis of the Fujisaki-Okamoto transformation
• Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• Compressible FHE with applications to PIR
• Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Generic and practical key establishment from lattice
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• scientific article; zbMATH DE number 1859030 (Why is no real title available?)
• Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Limits on the efficiency of (ring) LWE-based non-interactive key exchange
• Linear-Time Nearest Point Algorithms for Coxeter Lattices
• Log-concavity and strong log-concavity: a review
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• On lattices, learning with errors, random linear codes, and cryptography
• On Lovász' lattice reduction and the nearest lattice point problem
• Pseudorandom functions and lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• Simultaneous Packing and Covering in Euclidean Space
• The basic distributional theory for the product of zero mean correlated normal random variables
• The closest vector problem in tensored root lattices of type A and in their duals
• The covering of space by spheres
• The Kannan-Lovász-Simonovits conjecture
• Theory of cryptography. 17th international conference, TCC 2019, Nuremberg, Germany, December 1--5, 2019. Proceedings. Part I
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(3)

• Lattice Codes for Lattice-Based PKE
• NEV: faster and smaller NTRU encryption using vector decoding
• HQC beyond the standard: ciphertext compression and refined DFR analysis

This page was built for publication: Error correction and ciphertext quantization in lattice cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190152)