Abstract
AbstractIn a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.
Highlights
In [3], the authors and their collaborators presented a new hard problem, the Finite Field Isomorphism Problem
In this work we present a signature scheme based on the Computational Finite Field Isomorphism Problem (CFFI)
Future research directions include: The hardness of the finite field isomorphism problem: In this paper, we have indicated several ways in which one might try to solve the Computational FFI problem (CFFI) problem
Summary
In [3], the authors and their collaborators presented a new hard problem, the Finite Field Isomorphism Problem. We use the isomorphism X → Y to transfer the entire problem to a lattice that does not have any especially short vectors In this way, some previously described attacks against the private key of NTRU lattices, such as the hybrid attack [11], become impossible, since the very short vectors that exist in an NTRU lattice are mapped to random-looking vectors in the image lattice. A transcript reveals only this public distribution, and contains no information about the particular signing key that is used to generate the signatures This technique has become the de facto method for avoiding transcript leakage in lattice-based signature schemes; cf as [4, 8, 10, 14].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
