Fully homomorphic SIMD operations

@article{Smart2014FullyHS,
  title={Fully homomorphic SIMD operations},
  author={Nigel P. Smart and Frederik Vercauteren},
  journal={Designs, Codes and Cryptography},
  year={2014},
  volume={71},
  pages={57-81}
}
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations. The slow key generation process of the Smart–Vercauteren system was then addressed in a paper by Gentry and Halevi, but their key generation method appears to exclude the SIMD style operation alluded to by Smart and Vercauteren. In this paper, we show how to select parameters to enable such SIMD operations. As such… Expand
An Additively Homomorphic Encryption over Large Message Space
TLDR
An additively homomorphic encryption scheme based heavily on Smart-Vercauteren encryption scheme SV10 scheme, PKC 2010 is put forward, where both schemes each work with two ideals I and J, and a two-element representation of the ideal I is given and proven by factoring prime numbers in a number field. Expand
Better Bootstrapping in Fully Homomorphic Encryption
TLDR
A simpler approach that bypasses the homomorphic modular-reduction bottleneck to some extent, by working with a modulus very close to a power of two, and allows to store the encryption of the secret key as a single ciphertext, thus reducing the size of the public key. Expand
Optimizations in Fully Homomorphic Encryption
TLDR
This chapter sketches different technics to optimize and simplify fully homomorphic encryption schemes, and focuses on the trans-ciphering one, which is supposed to be an efficient solution to optimize data storage in a context of outsourcing computations to a remote cloud computing. Expand
Homomorphic AES Evaluation using NTRU
TLDR
This work develops a customized implementation of the ATV scheme that embodies a number of optimizations and introduces a specialization of the ring structure that allows to drastically reduce the public key size making evaluation of deep circuits such as the AES block cipher viable on a standard computer with a reasonable amount of memory. Expand
Fully Homomorphic Encryption: A Case Study
TLDR
This thesis is survey on FHE and MKFHE, with special attention to the state of the art implementations available as well as three implementations including the first implementation in the multi-key settings to the best of the authors' knowledge. Expand
TFHE: Fast Fully Homomorphic Encryption Over the Torus
TLDR
A new circuit bootstrapping is presented that makes the leveled mode of TFHE composable and which is fast enough to speed up arithmetic functions, compared to the gate bootstrapped approach. Expand
Scale-Invariant Fully Homomorphic Encryption over the Integers
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption scheme based on the LWE problem, in which the same modulus is used throughout the evaluation process, instead of aExpand
Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption
TLDR
It is proved that the problem of minimizing bootstrapping is NP-complete with a reduction from a graph problem and a flexible technique is proposed that permits to determine both such minimal number of bootstrappings and where to place them in the circuit. Expand
Homomorphic AES evaluation using the modified LTV scheme
TLDR
This work develops a customized implementation of the LTV scheme that embodies a number of optimizations and introduces a specialization of the ring structure that allows us to drastically reduce the public key size making evaluation of deep circuits such as the AES block cipher viable on a standard computer with a reasonable amount of memory. Expand
Faster Homomorphic Trace-Type Function Evaluation
TLDR
The rotations-and-sums is not the optimal solution in terms of runtime complexity and that a trade-off exists between time and space, so a more efficient trace-type function evaluation is proposed by using loop-unrolling, compatible with other optimization techniques such as hoisting, and can exploit multi-threading. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Implementing Gentry's Fully-Homomorphic Encryption Scheme
TLDR
A working implementation of a variant of Gentry's fully homomorphic encryption scheme, similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010), with a number of optimizations that allow it to implement all aspects of the scheme, including the bootstrapping functionality. Expand
Better Bootstrapping in Fully Homomorphic Encryption
TLDR
A simpler approach that bypasses the homomorphic modular-reduction bottleneck to some extent, by working with a modulus very close to a power of two, and allows to store the encryption of the secret key as a single ciphertext, thus reducing the size of the public key. Expand
Fully Homomorphic Encryption with Polylog Overhead
TLDR
This work presents a construction of fully homomorphic encryption schemes that for security parameter λ can evaluate any width-Ω(λ) circuit with t gates in time t· polylog(λ), and introduces permuting/routing techniques to move plaintext elements across these vectors efficiently. Expand
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
TLDR
A somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security reduces to the worst-case hardness of problems on ideal lattices using the RLWE assumption, which allows us to completely abstract out the lattice interpretation. Expand
Homomorphic Evaluation of the AES Circuit
TLDR
A working implementation of leveled homomorphic encryption without bootstrapping that can evaluate the AES-128 circuit in three different ways, and develops both AES-specific optimizations as well as several "generic" tools for FHE evaluation. Expand
Fully Homomorphic Encryption without Bootstrapping
TLDR
A new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry’s bootstrapping procedure is presented, which dramatically improves performance and bases security on weaker assumptions. Expand
(Leveled) fully homomorphic encryption without bootstrapping
TLDR
A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011). Expand
Can homomorphic encryption be practical?
TLDR
A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext. Expand
Fully homomorphic encryption using ideal lattices
TLDR
This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable. Expand
Ring Switching in BGV-Style Homomorphic Encryption (Preliminary Version)
BGV-style homomorphic encryption schemes over polynomial rings, rely for their security on rings of very large dimension. This large dimension is needed because of the large modulus-to-noise ratio inExpand
...
1
2
3
4
...