Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
Author:
Sipasseuth Arnaud,Plantard Thomas,Susilo Willy
Abstract
Abstract
We present a technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme.
The security of GGH has practically been broken by lattice reduction techniques.
Those attacks are successful due to the structure of the basis used in the secret key.
In this work, we aim to present a new technique to alleviate this problem by modifying the public key which hides the structure of the corresponding private key.
We intersect the initial lattice with a random one while keeping the initial lattice as our secret key and use the corresponding result of the intersection as the public key.
We show sufficient evidence that this technique will make GGH implementations secure against the aforementioned attacks.
Publisher
Walter de Gruyter GmbH
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications
Reference150 articles.
1. Faster Gaussian lattice sampling using lazy floating-point arithmetic;Advances in Cryptology—ASIACRYPT 2012,2012
2. Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems;Advances in Cryptology—EUROCRYPT 2016. Part II,2016
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献