Application of Lowner-John Ellipsoid in the Steganography of Lattice Vectors and a Review of The Gentry's FHE
This work addresses steganography and encryption challenges for secure data transmission, but it appears incremental as it applies known methods to lattice vectors without claiming major breakthroughs.
The paper tackles the problem of hiding lattice data information in steganography by applying the Lowner-John ellipsoid to convex sets, achieving information recovery in polynomial time using the Todd-Khachyian algorithm. It also reviews Gentry's homomorphic encryption scheme, which leverages lattice data for secure computations.
In this paper, first, we utilize the Lowner-John ellipsoid of a convex set to hide the lattice data information. We also describe the algorithm of information recovery in polynomial time by employing the Todd-Khachyian algorithm. The importance of lattice data is generally due to their applications in the homomorphic encryption schemes. For this reason we also outline the general scheme of a homomorphic encryption provided by Gentry.