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

Download
2018
Ayar, Emre
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. . 

Suggestions

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 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...
On the efficient implementation of RSA
Güner, Hatice Kübra; Cenk, Murat; Department of Cryptography (2015)
Modular exponentiation is an essential operation for many asymmetric key cryptosystems such as RSA in which encryption and decryption are based on modular exponentiation. Therefore, efficiency of the system is effected with running time of the modular exponentiation algorithm. At the same time, key sizes also influence the efficiency of the algorithm. Over the years key sizes had to be increased to provide security. To make RSA practical, one of usable choices is acceleration of the modular exponentiation a...
Some characterizations of generalized s-plateaued functions
Çelik, Emircan; Özbudak, Ferruh; Department of Cryptography (2017)
Plateaued functions play important role in cryptography because of their various desirable cryptographic features. Due to this characteristics they have been widely studied in the literature. This studies include p-ary functions and some generalizations of the boolean functions. In this thesis, we present some of this important work and show that plateaued functions can be generalized much more general framework naturally. Characterizations of generalized plateaued functions using Walsh power moments are al...
A Study on countermeasures on AES against side channel attacks
Çenesiz, Damla; Özbudak, Ferruh; Department of Cryptography (2019)
Side Channel Attacks have a important role for security of cryptographic algorithm. There are different method which include Threshold Implementation to protect against these kind of attacks. In this thesis, we study certain countermeasures to side channel attacks for AES. We start with a survey on Side Channel Attacks for block ciphers and we mentioned attack models for AES.We give also partical attention Treshold Implementation properties and construction methods. We also give some details of subfield con...
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.