Fully homomorphic encryption from the finite field isomorphism problem
type: Item
instance of: scholarly article
title: Fully homomorphic encryption from the finite field isomorphism problem
zbMATH Open document ID: 1385.94032
DOI: 10.1007/978-3-319-76578-5_5
author: Yarkın Doröz
author: Jeff Hoffstein
author: Jill Pipher
author: Joseph H. Silverman
author: Berk Sunar
author: William Whyte
author: Zhenfei Zhang
publication date: 2018-05-16T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6869047
zbMATH Keywords: finite field isomorphism
zbMATH Keywords: fully homomorphic encryption
zbMATH Keywords: lattice-based cryptography
MaRDI profile type: Publication
full work available at URL: 978-3-319-76578-5 5
OpenAlex ID: W2612490152
Recommended article: Revisiting homomorphic encryption schemes for finite fields
Recommended article: Partially homomorphic encryption schemes over finite fields
Recommended article: Fully Homomorphic Encryption over the Integers
Recommended article: Q2993216
Recommended article: Fully Homomophic Encryption over the Integers Revisited
Recommended article: Fully homomorphic encryption using ideal lattices
Recommended article: Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Recommended article: Q5397097
Recommended article: Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
Recommended article: Verifiable Decryption for Fully Homomorphic Encryption
description: scientific article; zbMATH DE number 6869047