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 124 for “"Encryption scheme"”.

  1. An End-to-End Identity-Based Email Encryption Scheme

    … with, and it provides bidirectional encryption of communications between a client computer and the gmail server. In practice, this is a reasonable guarantee that one is communicating with precisely the gmail server that one is intended to communicate with, as well as ensuring that the …

    boise Repository record for An End-to-End Identity-Based Email Encryption Scheme (opens in a new tab)

  2. Differentially Private Searchable Symmetric Encryption Scheme with Configurable Pattern Leakage

    Searchable symmetric encryption (SSE) allows a data owner to outsource its data to a cloud server while maintaining the ability to search over it. Most existing SSE schemes leak access-pattern leakage, and thus are vulnerable to attacks like the IKK attack. Oblivious RAM and PIR can be used to …

    waterloo Repository record for Differentially Private Searchable Symmetric Encryption Scheme with Configurable Pattern Leakage (opens in a new tab)

  3. Public key encryption scheme and algorithm based on chaotic system

    Com o advento da computação em nuvem, da Internet das Coisas, da internet móvel e da era do big data, as ameaças à segurança decorrentes de novas aplicações tecnológicas continuam a expandir-se. Projetar soluções criptográficas de alto desempenho tornou-se uma questão crítica que requer resolução …

    minho-thes Repository record for Public key encryption scheme and algorithm based on chaotic system (opens in a new tab)

  4. Side-Channel Attacks and Countermeasures for the MK-3 Authenticated Encryption Scheme

    … of the key. However, once these cryptographic schemes are implemented in electronic devices, another class of attack presents itself. Side-channel attacks take advantage of the side effects of performing a computation, such as power consumption or electromagnetic emissions, to extract …

    rit Repository record for Side-Channel Attacks and Countermeasures for the MK-3 Authenticated Encryption Scheme (opens in a new tab)

  5. On Decentralized Cloud Storage Security and an Efficient Post-Quantum Encryption Scheme

    … challenge posed by a quantum computer, we needencryption that is resistant to quantum computers. This category of cryptographyis called post-quantum cryptography. In the first paper, we solve a challengein one of the lattice-based cryptographic protocols called Nth-degree Truncatedpolynomial …

    lund Repository record for On Decentralized Cloud Storage Security and an Efficient Post-Quantum Encryption Scheme (opens in a new tab) Download PDF for On Decentralized Cloud Storage Security and an Efficient Post-Quantum Encryption Scheme (opens in a new tab)

  6. Somewhat homomorphic encryption scheme for secure range query process in a cloud environment

    … process which is based on a somewhat homomorphic encryption scheme to improve secure database functionalities. There is no sensitive information leakage in the secure range query process. The data that are stored in the cloud database are the integers which are encrypted with their binary forms by …

    laurentian Repository record for Somewhat homomorphic encryption scheme for secure range query process in a cloud environment (opens in a new tab)

  7. A Summary of the FV Homomorphic Encryption Scheme and the Average-Case Noise Growth

    Homomorphic encryption is a method of encryption that allows for secure computation of data. Many industries are moving away from owning expensive high-powered computers and instead delegating costly computations to the cloud. In an age of data breaches, there is an inherent risk when putting …

    sask Repository record for A Summary of the FV Homomorphic Encryption Scheme and the Average-Case Noise Growth (opens in a new tab)

  8. Homomorphic Encryption

    … 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 his …

    waterloo Repository record for Homomorphic Encryption (opens in a new tab)

  9. 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 …

    nus Repository record for NOVEL QUANTUM ENCRYPTION SCHEMES FOR SECURE DATA TRANSMISSION AND STORAGE (opens in a new tab) Download file for NOVEL QUANTUM ENCRYPTION SCHEMES FOR SECURE DATA TRANSMISSION AND STORAGE (opens in a new tab)

  10. Efficient Multiparty Computation from Lossy Threshold Encryption

    … The first contribution is a new lossy threshold encryption scheme. This is the first encryption scheme that is both a lossy and a threshold encryption scheme. The second contribution is a new oblivious transfer protocol secure against erasure-free one-sided active adaptive adversaries. The third …

    calgary Repository record for Efficient Multiparty Computation from Lossy Threshold Encryption (opens in a new tab)

  11. 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 …

    chalmers Repository record for Homomorphic Encryption: Computing on encrypted data (opens in a new tab)

  12. 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 …

    nps Repository record for Short Message Service (SMS) security solution for mobile devices (opens in a new tab)

  13. 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 …

    uvic Repository record for Encryption security against key-dependent-message attacks: applications, realizations and separations (opens in a new tab)

  14. Frontiers in Lattice Cryptography and Program Obfuscation

    … the construction of a deniable attribute-based encryption scheme from lattices. A deniable encryption scheme is secure against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. An attribute-based encryption scheme allows …

    maryland Repository record for Frontiers in Lattice Cryptography and Program Obfuscation (opens in a new tab)

  15. Trade-offs among data security, usability and complexity in mobile cloud computing

    … generally exist among these issues. While data encryption is a primary mechanism to ensure data security, it will inevitably introduce some computational overhead to the data owners. Also, data encryption will reduce data usability since typically it is hard to conduct computations over …

    msu Repository record for Trade-offs among data security, usability and complexity in mobile cloud computing (opens in a new tab)

  16. Lattice-based cryptosystems

    … integers, implies one may extend the NTRU encryption scheme over integral domains up to some constraints. We give details for realizing such extensions over Euclidean domains and denote by ETRU the corresponding class of cryptosystems.

    ottawa-retro Repository record for Lattice-based cryptosystems (opens in a new tab)

  17. Fast Bootstrapping in Z_q

    … turns this cryptosystem into a fully-homomorphic encryption scheme that allows a very short and fast implementation. We present an extension of their bootstrapping technique that allows refreshing encryptions of elements in Z_p and the homomorphic computation of arbitrary gates, alongside with an …

    waterloo Repository record for Fast Bootstrapping in Z_q (opens in a new tab)

  18. HEIDE: An IDE for the Homomorphic Encryption Library HElib

    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 …

    calpoly Repository record for HEIDE: An IDE for the Homomorphic Encryption Library HElib (opens in a new tab)

  19. A pseudo one-time-pad based security system

    … telecommunications industry. The cryptographic schemes currently employed, however, are theoretically breakable given enough time and/or computing resources. Nevertheless, there exists one scheme, the One-Time-Pad, that is theoretically unbreakable given that it satisfies certain requirements. …

    concordia Download PDF for A pseudo one-time-pad based security system (opens in a new tab)

Page 1 of 7