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 99 for “"Encryption schemes"”.
-
Efficiency of Homomorphic Encryption Schemes
… 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 use, which …
-
Trustless advanced encryption schemes from lattices
Public-key encryption (PKE) is an extremely useful cryptographic primitive, seeing constant use when browsing the internet. A PKE scheme is a simple way for users to communicate securely without exchanging any secret keys beforehand. However, PKE by itself only enables one-to-one communication. For …
-
Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes
Homomorphic Encryption has been considered the 'Holy Grail of Cryptography' since the discovery of secure public key cryptography in the 1970s. In 2009, a long-standing question about whether fully homomorphic encryption is theoretically plausible was affirmatively answered by Craig Gentry and his …
-
Leveled Homomorphic Encryption Schemes: Noise and Precision Control
Homomorphic encryption allows for computations on encrypted data without exposing the underlying plaintext, enabling secure and private data processing in various applications such as cloud computing and machine learning. In this thesis, we conduct a comprehensive worst-case noise analysis for …
-
NOVEL QUANTUM ENCRYPTION SCHEMES FOR SECURE DATA TRANSMISSION AND STORAGE
Quantum encryption is to protect the privacy of messages with unconditional security. During the last fifteen years, the research in this area is on the design and analysis of quantum key distribution protocols. In this thesis, two results on quantum encryption are presented. One result is the …
-
Parameter selection in fully homomorphic encryption schemes and fhe applications
… era that facilitates the implementation of encryption systems for practical applications.</p><p>The Learning with Error (LWE) and Ring-LWE problems introduce new lattice hardness assumptions that have been incorporated into public-key cryptosystems to facilitate the implementation of …
-
Universal secret-key and public-key encryption using combiners
We construct universal secret-key and public-key encryption schemes using combiners, in the style of Levin’s universal one-way function. Given a finite list of candidate encryption schemes, our combiners produce a single scheme that is correct and semantically secure if and only if at least one of …
-
Short Message Service (SMS) security solution for mobile devices
… communication (GSM) network and the use of encryption to protect SMS messages. A detailed study of the GSM network and SMS protocol, and encryption schemes was conducted to understand the properties of different encryption schemes and their applicability to SMS messages. An experiment was …
-
Public Key Cryptography over the Gaussian and Eisenstein Integers
Public key encryption has been studied in great detail mainly in the context of the ring of integers. In this thesis, we develop analogues of popular encryption schemes in the settings of Gaussian and Eisenstein integers. We will specifically study analogues of the following asymmetric public key …
-
Encryption security against key-dependent-message attacks: applications, realizations and separations
… we study the notion of circular security for bit-encryption schemes. Informally speaking, a bit-encryption scheme is circular secure if it remains secure even if the key of the system is used to encrypt its own individual bits. This notion (or slight extensions thereof) has foundational …
-
On the security and efficiency of encryption
… design and analysis of practical provably-secure encryption schemes. We give several results that include new schemes with attractive tradeoffs between efficiency and security and new techniques for analyzing existing schemes. Our results are divided into three chapters, which we summarize below. …
-
Privacy-preserving queries on encrypted databases
… several practical and provable secure structured encryption schemes that allow the data owner to encrypt data without losing the ability to query and retrieve it efficiently for authorized clients. This thesis includes two parts. The first part investigates graph encryption schemes. This thesis …
-
Secure Quantum Encryption
… to new protocols. In this thesis, quantum encryption, i.e. encryption schemes for quantum data, is defined, along with several definitions of security, broadly divisible into semantic security and ciphertext indistinguishability, which are proven equivalent, in analogy to the foundational …
-
Provable security support for kerberos (and beyond)
… are three-fold: We first look at the symmetric encryption schemes employed in the current version 5 of Kerberos. Several recent results have analyzed a significant part of Kerberos v.5 using formal-methods-based approaches, which are meaningful only if the underlying encryption schemes satisfy …
-
EFFICIENT PRIVACY-PRESERVING COMPUTATION WITH TRUSTED HARDWARE
… that converts between 3 partially-homomorphic encryption schemes. This enables the capabilities of fully homomorphic encryption schemes while maintaining an acceptable performance overhead. Next, we study existing defenses and understand their limits in hiding side-channel leakages. We …
-
Privacy Preserving Machine Learning as a Service
… the practical limitation of current homomorphic encryption schemes. We focus on training and classification of the well-known neural networks and convolutional neural networks. First, we design methods for approximation of the activation functions commonly used in CNNs (i.e. ReLU, Sigmoid, and …
-
Hardware accelerators for post-quantum cryptography and fully homomorphic encryption
… critical. Over the years, various data encryption schemes including RSA, ECC, and AES are being used to enable data security and privacy. However, these schemes are deemed vulnerable to quantum computers with their enormous processing power. As quantum computers are expected to become …
Page 1 of 5