Skip to Main content Skip to Navigation
Theses

Sécurité et efficacité des schémas cryptographiques.

Abstract : Provable security is nowadays one of the major lines of research in Cryptography. It aims at providing security proofs of cryptographic schemes in a complexity–theoretical sense: if one can break the scheme, one can solve the underlying problem. Provable security is strongly related to three main trends in the development of Cryptology: formalization of security notions, design of cryptographic systems, and development of new cryptographic features. In this thesis, we first deal with notions of security in both asymmetric and symmetric encryption. We study more in detail the relation between different attack models in asymmetric encryption. We also establish the relation between the notion of (super) pseudo–random permutation and that of semantic security in symmetric encryption. Secondly, we propose new efficient constructions for asymmetric encryption in the random oracle model (new paddings for encryption, and universal paddings for both encryption and signature). Furthermore, we introduce a new class of public–key encryption schemes: chosen ciphertext secure schemes without redundancy. Up to now, redundancy used to be required for proofs of security in public–key encryption schemes. Finally, we consider the traitor tracing problem in broadcast encryption and we introduce a new feature: public traceability. We construct a basic scheme with such feature, and then generalize it to achieve almost optimal transmission rates.
Document type :
Theses
Complete list of metadatas

Cited literature [113 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/pastel-00001442
Contributor : Ecole Polytechnique <>
Submitted on : Thursday, July 29, 2010 - 4:30:59 PM
Last modification on : Thursday, October 29, 2020 - 3:01:26 PM
Long-term archiving on: : Thursday, November 4, 2010 - 10:06:59 AM

File

Identifiers

  • HAL Id : pastel-00001442, version 1

Collections

Citation

Duong Hieu Phan. Sécurité et efficacité des schémas cryptographiques.. Informatique [cs]. Ecole Polytechnique X, 2005. Français. ⟨pastel-00001442⟩

Share

Metrics

Record views

589

Files downloads

1962