A new scale-invariant homomorphic encryption scheme

DOI10.1016/J.INS.2017.09.012MaRDI QIDQ781008zbMATH OpenOpenAlexWikidataFDO

Authors Sungwook Kim, Jae Hong Seo, Jinsu Kim

Publication date 16 July 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2017.09.012

zbMATH Keywords

fully homomorphic encryptioninteger-basedscale-invariantunknown message space

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• (Batch) fully homomorphic encryption over integers for non-binary message spaces
• Scale-invariant fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers
• CRT-based fully homomorphic encryption over the integers
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

Cites work

• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Approximate common divisors via lattices
• Batch fully homomorphic encryption over the integers
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Scale-invariant fully homomorphic encryption over the integers

Cited in

(1)

• Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing

Describes a project that uses

Uses Software

• fhe

This page was built for publication: A new scale-invariant homomorphic encryption scheme

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