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 222 for “"homomorphic encryption"”.
-
Homomorphic Encryption
In this thesis, we provide a summary of fully homomorphic encryption, and in particular, look at the BGV encryption scheme by Brakerski, Gentry, and Vaikuntanathan; as well the DGHV encryption scheme by van Dijk, Gentry, Halevi, and Vaikuntanathan. We explain the mechanisms developed by Gentry in …
-
Efficiency of Homomorphic Encryption Schemes
In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical …
-
Simulation of Quantum Homomorphic Encryption
… and ensuring the privacy of the data. Quantum homomorphic encryption is a cryptographic primitive that seeks to address these two objectives in the quantum setting, allowing for quantum computation on encrypted quantum data. In this work, we provide a software simulation of a quantum …
-
Towards practical fully homomorphic encryption
Fully homomorphic encryption (FHE) allows for computation of arbitrary func- tions on encrypted data by a third party, while keeping the contents of the encrypted data secure. This area of research has exploded in recent years following Gentry’s seminal work. However, the early realizations of FHE, …
-
Quantum Homomorphic Encryption: Implementation and Applications
… offshoot is the construction of quantum homomorphic encryption (QHE) which allows anyone in possession of a ciphertext to perform an arbitrary computation directly without having to decrypt beforehand. We describe the construction and experimental implementation of a QHE scheme which, …
-
Homomorphic Encryption: Computing on encrypted data
Homomorphic encryption is the ability to compute mathematical functions on encrypted data without decryption. The output of the computations is itself in encrypted form which when decrypted is identical to the output had the computation been performed on the plaintexts directly. A homomorphic …
-
Fully Homomorphic Encryption: A Case Study
Fully Homomorphic Encryption (FHE) has been dubbed as cryptography’s holy grail. It opens the door to many new capabilities with the goal to solve the IT world’s problems of security and trust. After 2009, when Craig Gentry showed that FHE can be realised, research in the area exploded and …
-
Applying Fully Homomorphic Encryption: Practices and Problems
Fully homomorphic encryption (FHE) has been regarded as the "holy grail" of cryptography for its versatility as a cryptographic primitive and wide range of potential applications. Since Gentry published the first theoretically feasible FHE design in 2008, there has been a lot of new discoveries and …
-
Accelerating Secure Computations Under Fully Homomorphic Encryption
Fully homomorphic encryption (FHE) systems enable computations on encrypted data without decrypting and without knowledge of the secret key. In this thesis, we describe an optimized RLWE-based and NTRU-based variants of the FHE system recently proposed by Gentry, Sahai and Waters (GSW). Although …
-
CPU and GPU accelerated fully homomorphic encryption
Fully Homomorphic Encryption (FHE) is one of the most promising technologies for privacy protection as it allows an arbitrary number of function computations over encrypted data. However, the computational cost of these FHE systems limits their widespread applications. In this thesis, our objective …
-
Homomorphic Encryption for Parallel Machine Learning Graphs
… but some of our data is too sensitive. Homomorphic encryption allows us to perform operations on encrypted data, foregoing the time consuming process of decryption and re-encryption, and allowing us to store our data in a way that is secure even from the owner of the database. This …
-
Towards practical homomorphic encryption and efficient implementation
… by enforcing cryptographic measures. Fully homomorphic encryption (FHE), a special form of public key encryption has emerged as a primary tool in deploying such cryptographic security assurances without sacrificing many of the privileges of working with data in cleartext. In brief, a FHE …
-
Homomorphic Encryption and the Approximate GCD Problem
… simultaneously ensuring the privacy of the data. Homomorphic encryption allows one to securely delegate the processing of private data. As such, it has managed to hit the sweet spot of academic interest and industry demand. Though the concept was proposed in the 1970s, no cryptosystem realizing …
-
Homomorphic Encryption and Cryptanalysis of Lattice Cryptography
… same time protecting it---one such technique is homomorphic encryption that allows computations to be done on data while it is still encrypted. The question of security for homomorphic encryption relates to the broader field of lattice cryptography. Lattice cryptography is one of the main areas …
-
Homomorphic Encryption Based Obfuscated Complex Queries System
This thesis presents a novel Homomorphic Encryption-based system for executing complex queries over plaintext databases or corpora, ensuring the confidentiality of the queries, results, and matching logic. The goal is to enable privacy-preserving querying of remote, non-encrypted data while keeping …
-
Privacy-Preserving Public Verification via Homomorphic Encryption
… Verifikationen durch den Einsatz von Fully Homomorphic Encryption (FHE) und Proxy Re-Encryption (PRE). Um die Eignung des Systemmodells für eine Vielzahl realer Szenarien zu verdeutlichen, werden in dieser Dissertation Protokolle für verschiedene Verifikationsfunktionen entworfen. Dies …
-
PFHE: partially homomorphic encryption on CNN inference
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2026-02-19 without embargo terms
Page 1 of 12