We introduce a CUDA GPU library to accelerate evaluations with homomorphic schemes
defined over polynomial rings enabled with a number of optimizations including algebraic …

Homomorphic encryption (HE) offers great capabilities that can solve a wide range of
privacy-preserving computing problems. This tool allows anyone to process encrypted data …

As a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully
homomorphic encryption (FHE) scheme. FHE allows the evaluation of arbitrary functions …

In 2010, Gentry and Halevi presented the first FHE implementation. FHE allows the
evaluation of arbitrary functions directly on encrypted data on untrusted servers. However …

We present a custom architecture for realizing the Gentry-Halevi fully homomorphic
encryption (FHE) scheme. This contribution presents the first full realization of FHE in …

Homomorphic encryption allows computation on encrypted data and makes it possible to
securely outsource computational tasks to untrusted environments. However, all proposed …

In this paper, we report on our implementation of a lattice-based key-policy attribute-based
encryption (KP-ABE) scheme, which uses short secret keys. The particular KP-ABE scheme …

Internet of Things (IoT) sensor nodes are placed ubiquitously to collect information, which is
then vulnerable to malicious attacks. For instance, adversaries can perform side channel …

Multipliers requiring large bit lengths have a major impact on the performance of many
applications, such as cryptography, digital signal processing (DSP) and image processing …

This paper presents the design of a power-and area-efficient high-speed 768000-bit
multiplier, based on fast Fourier transform multiplication for fully homomorphic encryption …