Reference : Provable Security and Indifferentiability
Dissertations and theses : Doctoral thesis
Engineering, computing & technology : Computer science
Provable Security and Indifferentiability
Mandal, Avradip [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
University of Luxembourg, ​Luxembourg, ​​Luxembourg
Docteur en Informatique
Coron, Jean-Sébastien mailto
[en] Cryptography ; Provable Security ; Indifferentiability ; Random Oracle Model ; Ideal Cipher Model ; PSS ; Black Box Impossibility
[en] In this thesis we consider different problems related to provable security and indifferentiability framework. Ideal primitives such as random oracles, ideal ciphers are theoretical abstractions of cryptographic hash functions and block ciphers respectively. These idealized models help us to argue security guarantee for various cryptographic schemes, for which standard model security proofs are not known. In the first part of this thesis we consider the problems related to ideal primitive construction starting from a different ideal primitive. We adopt the indifferentiability framework proposed by Maurer et. al. in TCC’04 for this purpose. The indifferentiability framework helps us to preserve the security guarantee of cryptographic schemes when the ideal primitives are replaced by indifferentiable constructions, even when the ideal primitives are used in a public manner.
At first, we consider the problem of ideal cipher domain extension. We show the 3-round Feistel construction, built using n-bit ideal ciphers are actually indifferentiable from a 2n-bit ideal cipher. We also consider other related issues such as,
why 2-round Feistel is not sufficient, security analysis in standard indistinguishability model for both 2 and 3 round constructions, etc.
Afterwards, we consider the open problem: whether 6-round Feistel construction using random round functions is indifferentiable from a random invertible permutation or not.
We give a partial positive answer to this question. We show the construction is actually publicly-indifferentiable (which is a restricted version of full indifferentiability) from an in- vertible random permutation.
In the later part of the thesis, we concentrate on some issues related to the security of Probabilistic Signature Scheme (PSS). PSS with RSA trapdoor is a widely deployed randomized signature scheme. It is known to be secure in Random Oracle model. However, recently randomized signature scheme such as iso/iec 9796-2 is shown to be susceptible to hardware fault attacks. In this work we show, PSS is actually secure against random fault attacks in random oracle model.
Afterwards, we consider the openproblem related to standard model security of PSS. We give a general negative result in this direction. We rule out existence of any black box proof technique showing security of PSS in standard model.

File(s) associated to this reference

Fulltext file(s):

Open access
Mandal - Thesis.pdfAuthor postprint1.42 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.