Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 59 for “"Homomorphic Encryption"”.
-
Optimizing fully homomorphic encryption
Fully homomorphic encryption (FHE) presents the possibility of removing the need to trust cloud providers with plaintext data. We present two new FHE scheme variants of BGV'12, both of which remove the need for key switching after a ciphertext multiplication, overall halving the runtime of …
-
Practical homomorphic encryption implementations & applications
Homomorphic encryption is an exciting technology that enables computations to be performed over encrypted data. While initial constructions were impractical, recent works have enabled eciency necessary for many practical application. In this thesis, we present a new library for homomorphic …
-
Evaluation of somewhat homomorphic encryption schemes
Homomorphic encryption allows one to outsource expensive computation to an untrusted party while keeping data in an encrypted form. While there has been a growing research focus in fully homomorphic encryption schemes, many real-world applications require a scheme to be only "somewhat" homomorphic. …
-
PFHE: partially homomorphic encryption on CNN inference
Fully Homomorphic Encryption (FHE) enables secure computation on encrypted data, but its high computational overhead poses significant challenges for practical deep learning inference. In many application scenarios, high-resolution images may only contain a small portion of sensitive information. …
-
HEIDE: An IDE for the Homomorphic Encryption Library HElib
<p>Work in the field of Homomorphic Encryption has exploded in the past 5 years, after Craig Gentry proposed the first encryption scheme capable of performing Homomorphic Encryption. Under the scheme one can encrypt data, perform computations on the encrypted result (without needing the original …
-
A Tensor Compiler for Simple and EfficientFully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) enables computing on encrypted data, letting clients securely offload computation to untrusted servers. Though FHE is slow on CPUs, hardware acceleration enables large FHE programs, like deep neural networks. Unfortunately, FHE is extremely hard to program: …
-
Designing a Programmable Hardware Accelerator for Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) allows computing on encrypted data, enabling secure offloading of computation to untrusted servers. Though it provides ideal security, FHE is expensive when executed in software, 4 to 5 orders of magnitude slower than computing on unencrypted data. These overheads …
-
A protocol for secure distributed spatial searching using homomorphic encryption.
… propose a protocol by putting into application Homomorphic Encryption and a Distributed Ring Algorithm, to ensure anonymity of data of both parties involved in a spatial search, that is, a data provider and a searcher. To achieve this aim, three objectives were set. The first objective was to …
-
A protocol for secure distributed spatial searching using homomorphic encryption.
… propose a protocol by putting into application Homomorphic Encryption and a Distributed Ring Algorithm, to ensure anonymity of data of both parties involved in a spatial search, that is, a data provider and a searcher. To achieve this aim, three objectives were set. The first objective was to …
-
GPUHElib and DistributedHElib: Distributed Computing Variants of HElib, a Homomorphic Encryption Library
<p>Homomorphic Encryption, an encryption scheme only developed in the last five years, allows for arbitrary operations to be performed on encrypted data. Using this scheme, a user can encrypt data, and send it to an online service. The online service can then perform an operation on the data and …
-
Making Computation on Encrypted Data Practical through Hardware Acceleration of Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) enables offloading computation to untrusted servers with cryptographic privacy. Despite its attractive security, FHE is not yet widely adopted due to its prohibitive overheads, about 10,000× over unencrypted computation. Hardware acceleration is an attractive …
-
Thresholdizing lattice based encryption schemes
… construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, …
-
Efficient Architecture and Implementation for NTRU Based Systems
… systems have also been shown having property of homomorphic encryption with important application in cloud computing security. In this thesis, several efficient algorithms and architectures for NTRUEcrypt system and for NTRU based homomorphic encryption system are proposed. For NTRUEncrypt …
-
Blockchain for Computational Integrity and Privacy
… a blockchain based system that utilizes fully homomorphic encryption to provide security of data in use as well as computational integrity. This is achieved by leveraging the attributes of blockchain which provides availability and data integrity combined with homomorphic encryption that …
-
Privacy-preserving encoding for cloud computing
… from the cloud and unlock the real answers. Homomorphic encryption is a solution for privacy-preserving processing, allowing computation over cipher text. At the time of writing, a fully homomorphic system allows arbitrary operations but requires minutes to compute an operation, whereas …
-
Keeping secrets from those you work with : constructions and characterizations of encryption
… (leading to constructions such as identity-based encryption) and the additional functionalities supported by encryption schemes (such as homomorphic operations). This thesis explores the relations between several of these primitives and models, both in terms of generic constructions, and …
-
Efficient cryptographic primitives: Secure comparison, binary decomposition and proxy re-encryption
… to solve the QPED problem is to utilize fully homomorphic encryption. However, fully homomorphic encryption is yet to be practical. The second solution is to adopt multi-server setting. However, the existing work is not efficient. Their implementations adopt costly primitives, such as secure …
-
Extending the language and applications of Maude-NPA through rewriting semantics
… for approximating the algebraic property of homomorphic encryption over an Abelian group, which enables analysis of protocols having homomorphic encryption over abelian group in Maude-NPA; (ii) it extends the strand space model with support for choice, and develops a protocol process algebra …
-
Multiparty Protocols for Tree Classifiers
… adversaries. It is about designing and analyzing encryption schemes and protocols that protect data from unauthorized reading. However, in our modern information-driven society with highly complex and interconnected information systems, encryption alone is no longer enough as it makes the data …
Page 1 of 3