Application of Lowner-John's Ellipsoid in the Steganography of Lattice Vectors and a Review of The Gentry's FHE

04/26/2018
by   Hossein Mohades, et al.
0

In this paper, first, we utilize the Lowner-John's 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2022

Lattices, Homomorphic Encryption, and CKKS

This is a survey on some topics in Lattice based cryptography and Homomo...
research
07/24/2019

A General Theory of Concept Lattice (I): Emergence of General Concept Lattice

As the first part of the treatise on A General Theory of Concept Lattice...
research
08/29/2022

Lattice Codes for Lattice-Based PKE

The public key encryption (PKE) protocol in lattice-based cryptography (...
research
05/30/2020

New bounds on the density of lattice coverings

We obtain new upper bounds on the minimal density of lattice coverings o...
research
01/22/2019

Dualization in lattices given by implicational bases

It was recently proved that the dualization in lattices given by implica...
research
10/08/2018

Fully Homomorphic Image Processing

Fully homomorphic encryption has allowed devices to outsource computatio...
research
06/27/2020

On Dualization over Distributive Lattices

Given a partially order set (poset) P, and a pair of families of ideals ...

Please sign up or login with your details

Forgot password? Click here to reset