A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes

Download

index.pdf

Date

2018

Author

Ayar, Emre

Metadata

Show full item record

Item Usage Stats

230
views

147
downloads

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 these attacks, however, differ for symmetric and asymmetric schemes in some aspects. In a symmetric encryption scheme, designer needs to impose a secure mode of operation to the cipher whereas in asymmetric encryption schemes padding and hash- based structures are used to provide security. In this thesis, we first give the descriptions of CPA and CCA security under indistinguishability notion for both symmetric and asymmetric encryption schemes. Then we analyse the security of widely used algorithms with respect to these security models. .

Subject Keywords

Cryptography., Data encryption (Computer science).

URI

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

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

A Randomness test based on postulate r-2 on the number of runs Şeker, Okan; Doğanaksoy, Ali; Department of Cryptography (2014) Random values are considered as an indispensable part of cryptography, since they are necessary for almost all cryptographic protocols. Most importantly, key generation is done by random values and key itself should behave like a random value. Randomness is tested by statistical tests and hence, security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this thesis we focus on randomness postulates of Solomon W. Golomb in particular, second postulate which is about r...
Analysis of recent attacks on SSL/TLS protocols Özden, Duygu; Cenk, Murat; Department of Cryptography (2016) Transport Layer Security(TLS) and its predecessor Secure Socket Layer(SSL) are two important cryptographic, certificate based protocols that satisfy secure communication in a network channel. They are widely used in many areas such as online banking systems, online shopping, e-mailing, military systems or governmental systems. Being at the center of secure communication makes SSL and TLS become the target of attackers and an important field of study for researchers. So many vulnerabilities and attacks towar...
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...
Homomorphic encryption based on the ring learning with errors (RLWE) problem Keskinkurt, İrem; Cenk, Murat; Department of Cryptography (2017) 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...
Combined attacks on block ciphers Öztop, Neşe; Doğanaksoy, Ali; Department of Cryptography (2009) Cryptanalytic methods are very important tools in terms of evaluating the security of block ciphers in a more accurate and reliable way. Differential and linear attacks have been the most effective cryptanalysis methods since the early 1990s. However, as the technology developed and more secure ciphers are designed, these fundamental methods started to be not so efficient. In order to analyze the ciphers, new methods should be introduced. One approach is inventing new techniques that are different from the ...

Citation Formats

E. Ayar, “A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes,” M.S. - Master of Science, Middle East Technical University, 2018.