Partially homomorphic encryption schemes over finite fields

DOI10.1007/978-3-319-49445-6_6zbMATH Open1398.68143OpenAlexW2554075857MaRDI QIDQ1989613FDOQ1989613

Authors: Jian Liu, Sihem Mesnager, Lusheng Chen 

Publication date: 26 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-49445-6_6

Recommendations

• Revisiting homomorphic encryption schemes for finite fields
• Partially homomorphic encryption
• Fully homomorphic encryption from the finite field isomorphism problem
• Fully homomorphic encryption over the integers
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers with shorter public keys
• Homomorphic encryption
• Semi-homomorphic encryption and multiparty computation
• Homomorphic encryption and applications
• An efficient somewhat homomorphic encryption scheme based on factorization

zbMATH Keywords

finite fieldshomomorphic encryptionsymmetric cryptographyperfect secrecy\(q\)-ary functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (9)

• Partial covering sequences: a method for designing classes of cryptographic functions
• Revisiting homomorphic encryption schemes for finite fields
• Fully homomorphic encryption from the finite field isomorphism problem
• Communication Complexity in Algebraic Two-Party Protocols
• Homomorphic cryptosystems and their applications.
• Private multiplication over finite fields
• Somewhat/fully homomorphic encryption: implementation progresses and challenges
• Bit Security of the CDH Problems over Finite Fields
• On constructing homomorphic encryption schemes from coding theory

This page was built for publication: Partially homomorphic encryption schemes over finite fields

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