Corpus ID: 16549090

Enhanced Flexibility for Homomorphic Encryption Schemes via CRT

  title={Enhanced Flexibility for Homomorphic Encryption Schemes via CRT},
  author={Yin Hu and W. Martin and B. Sunar},
The Chinese Remainder Theorem (CRT) has numerous applications including in cryptography. In a striking example of this utility, we demonstrate how the CRT facilitates making one additive homomorphic encryption scheme viable and making another more flexible. First we show that the CRT may be used to turn an intractable problem into a tractable one. Specifically, using the CRT to replace a single group element by a logarithmic number of elements in the same group, we lay the foundation for… Expand
Homomorphic Data Isolation for Hardware Trojan Protection
Cryptoleq: A Heterogeneous Abstract Machine for Encrypted and Unencrypted Computation
The general model of secure computation system
Computing Small Discrete Logarithms Faster
Computation on Encrypted Data using Dataflow Authentication
Talos: Encrypted Query Processing for the Internet of Things
Secure Sharing of Partially Homomorphic Encrypted IoT Data
Privacy-Preserving GWAS Computation on Outsourced Data Encrypted under Multiple Keys Through Hybrid System


Fully homomorphic encryption using ideal lattices
A New Approach for Algebraically Homomorphic Encryption
Implementing Gentry's Fully-Homomorphic Encryption Scheme
Additively Homomorphic Encryption with d-Operand Multiplications
A New Public-Key Cryptosystem as Secure as Factoring
A new public key cryptosystem based on higher residues
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
Lossy Trapdoor Functions and Their Applications
Lattice-based homomorphic encryption of vector spaces