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 30 for “"fully 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 …
-
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 …
-
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
… to 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 …
-
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
… solution 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 …
-
Blockchain for Computational Integrity and Privacy
… proposes 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 …
-
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. …
-
Non-linear operations and verifiable decryption in BGV
Fully Homomorphic Encryption (FHE) schemes are cryptosystems that allow to compute over encrypted messages. Due to the inherent difficulty of training models using private data, this special property is closely watched. One of the most celebrated FHE schemes is BGV, which allows to compute …
-
Secure inference of quantized neural networks
… neural network that is compatible with leveled fully homomorphic encryption (LHE), a form of encryption that can support evaluation of degree-bounded polynomial functions over encrypted data without decrypting it, and Brakerski/Fan-Vercauteren (BFV) scheme - an efficient LHE cryptographic scheme …
-
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: …
-
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 …
-
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. …
-
BURLAP: Bits of Useful Randomness enable Learning with Adjustable Privacy
… While cryptography-based approaches such as Fully Homomorphic Encryption (FHE) can be used to provide privacy guarantees that have been rigorously characterized and proven, their adoption comes with two main practical hurdles. First, these tools often incur a significant computational …
-
Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications
Homomorphic secret sharing (HSS) is a powerful cryptographic primitive that enables efficient, low-communication secure computation without the use of fully homomorphic encryption. Public-key HSS is a well-known variant that supports inputs from multiple parties, but all parties must agree on a …
-
Succinct Cryptography via Propositional Proofs
… fiction”. For example, we have constructions of fully homomorphic encryption and private information retrieval from standard, cryptographic assumptions which achieve the ideal levels of succinctness. However, there are still some tasks in cryptography where achieving the “ideal” efficiency from …
-
Argos: Verifiable FHE Using Commodity Hardware
… a simple approach for adding verifiability to fully homomorphic encryption (FHE) schemes using trusted hardware. Traditional approaches to verifiable FHE require expensive cryptographic proofs, which incur an overhead of up to seven orders of magnitude on top of FHE, making them impractical. …
-
Securing cloud-based data analytics: A practical approach
… scripts on encrypted data. We avoid fully homomorphic encryption because of its prohibitively high cost; instead, in some cases, we rely on a minimal set of operations performed by the client. We present the algorithms used for this translation, and empirically demonstrate the …
-
Ascend : an architecture for performing secure computation on encrypted data
… untrusted batch programs can be realized through fully homomorphic encryption (FHE) techniques, but FHE's current overheads limit its applicability. Secure processors (e.g., Aegis), coprocessors (e.g., TPM) or hardware extensions (e.g., TXT) typically require trust in the entire processor, the …
-
Cryptographic agents
… of ''cryptographic objects'' -- identity-based encryption, fully-homomorphic encryption, functional encryption, and most recently, various forms of obfuscation -- have opened up exciting new possibilities for computing on encrypted data. Initial foundational results on this front consisted of …
Page 1 of 2