Fully homomorphic encryption from the finite field isomorphism problem

DOI10.1007/978-3-319-76578-5_5MaRDI QIDQ1749277zbMATH OpenOpenAlexFDO

Authors Yarkın Doröz, Jeff Hoffstein, Jill Pipher, Joseph H. Silverman, Berk Sunar, William Whyte, Zhenfei Zhang

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_5

zbMATH Keywords

finite field isomorphismfully homomorphic encryptionlattice-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Revisiting homomorphic encryption schemes for finite fields
• Partially homomorphic encryption schemes over finite fields
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption from approximate ideal lattices
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption for mathematicians
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Verifiable Decryption for Fully Homomorphic Encryption

Cited in

(4)

• Partially homomorphic encryption schemes over finite fields
• A signature scheme from the finite field isomorphism problem
• On the hardness of the finite field isomorphism problem
• Revisiting homomorphic encryption schemes for finite fields

This page was built for publication: Fully homomorphic encryption from the finite field isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749277)