Homomorphic encryption based on the ring learning with errors (RLWE) problem

Download

index.pdf

Date

2017

Author

Keskinkurt, İrem

Metadata

Show full item record

Item Usage Stats

229
views

121
downloads

The encryption techniques used to ensure data secrecy have been evolving in compliance with the developments in technology and reforming according to need. Nowadays, the increase in the amount of data that should be stored in encrypted form, has led to the need for encryption schemes that provide both the safety and the efficient usability of data. Homomorphic encryption, which enables the ability to make computations on encrypted data, is seen as one of the solutions that can meet this need. In this thesis, the definitions and the properties of homomorphic encryption, some possible practical applications of homomorphic encryption, the Ring Learning with Errors problem and a somewhat homomorphic encryption scheme based on this problem has been examined. The computational complexity and efficiency of the algorithm have been studied by adapting some techniques in the literature to the algorithm.

Subject Keywords

Cryptography., Computer algorithms., Homomorphisms (Mathematics)., Data encryption (Computer science).

URI

http://etd.lib.metu.edu.tr/upload/12621499/index.pdf
https://hdl.handle.net/11511/26782

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

On provable security of some public key encryption schemes Hanoymak, Turgut; Akyıldız, Ersan; Selçuk, Ali Aydın; Department of Cryptography (2012) In this thesis, we analyse the security criteria of some public key encryption schemes. In this respect, we present the notion of adversarial goals and adversarial capabilities. We give the definition of provably security by means of several games between the challenger and the adversary in some security models, namely the standard model and the random oracle model. We state the main differences between these two models and observe the advantage of the success probability of the adversary in breaking the cr...
A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes Ayar, Emre; Doğanaksoy, Ali; Koçak, Onur; Department of Cryptography (2018) For an encryption scheme, instead of Shannon's perfect security definition, Goldwasser and Micali defined a realistic provable security called semantic security. Using indistinguishability notion, one can define security levels according to the polynomial time adversaries' capabilities such as chosen plaintext attacks (CPA) and chosen ciphertext attacks (CCA) for both symmetric and asymmetric encryption schemes in addition to the hard mathematical problems the algorithms based on. Precautions to prevent the...
PLGAKD: A PUF-based Lightweight Group Authentication and Key Distribution Protocol Yıldız, Hüsnü; Cenk, Murat; Onur, Ertan (Institute of Electrical and Electronics Engineers (IEEE), 2020-11-01) Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature per...
Efficient implementation of TMVP-based prime field multiplication and its applications to ECC Taşkın, Halil Kemal; Cenk, Murat; Department of Cryptography (2019) The need for faster and practical cryptography is a research topic for decades. For elliptic curve cryptography, which is proposed independently by Koblitz and Miller in 1985 as a more efficient alternative to RSA, the applications of it in real life started after 2000s. Today, most of the popular applications and protocols like Whatsapp, Signal, iOS, Android, TLS, SSH, Bitcoin etc. make use of elliptic curve cryptography. In this thesis, we present a new representation of finite field multiplication which ...
SIMULATION CONCEPTS FOR INFORMATION-SYSTEM MOURANT, RR; Tarı, Zehra Sibel (Elsevier BV, 1993-09-01) Recent Improvements in document image systems and their low-cost implementation on networks of microcomputers is leading to the reengineering of many information systems. We describe how document image systems can be applied to information systems. In order to compare the performance of a conventional information system with one implemented with document imaging processing capability we conducted a discrete event simulation. We modeled the conventional information system for processing graduate student ...

Citation Formats

İ. Keskinkurt, “Homomorphic encryption based on the ring learning with errors (RLWE) problem,” M.S. - Master of Science, Middle East Technical University, 2017.