Asymmetric cryptography and practical security
Journal of Telecommunications and Information Technology · 30.12.2002 · (4) · 41-56
DOI: 10.26636/jtit.2002.4.146 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Telecommunications and Information Technology, online erschienen am 30.12.2002. Verfasst von David Pointcheval. Die Arbeit wurde bisher 7-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Since the appearance of public-key cryptography in Diffie-Hellman seminal paper, many schemes have been proposed, but many have been broken. Indeed, for many people, the simple fact that a cryptographic algorithm withstands cryptanalytic attacks for several years is considered as a kind of validation. But some schemes took a long time before being widely studied, and maybe thereafter being broken. A~much more convincing line of research has tried to provide ``provable`` security for cryptographic protocols, in a complexity theory sense: if one can break the cryptographic protocol, one can efficiently solve the underlying problem. Unfortunately, very few practical schemes can be proven in this so-called ``standard model`` because such a security level rarely meets with efficiency. A convenient but recent way to achieve some kind of validation of efficient schemes has been to identify some concrete cryptographic objects with ideal random ones: hash functions are considered as behaving like random functions, in the so-called ``random oracle model``, block ciphers are assumed to provide perfectly independent and random permutations for each key in the ``ideal cipher model``, and groups are used as black-box groups in the ``generic model``. In this paper, we focus on practical asymmetric protocols together with their ``reductionist`` security proofs. We cover the two main goals that public-key cryptography is devoted to solve: authentication with digital signatures, and confidentiality with public-key encryption schemes.
Zitieren
APA
Pointcheval, D. (2002). Asymmetric cryptography and practical security. Journal of Telecommunications and Information Technology, 41-56. https://doi.org/10.26636/jtit.2002.4.146
Vancouver
Pointcheval D. Asymmetric cryptography and practical security. Journal of Telecommunications and Information Technology. 2002:41-56. doi:10.26636/jtit.2002.4.146
BibTeX
@article{Pointcheval2002,
author = {Pointcheval, David},
title = {Asymmetric cryptography and practical security},
journal = {Journal of Telecommunications and Information Technology},
year = {2002},
number = {4},
pages = {41--56},
doi = {10.26636/jtit.2002.4.146}
}
EUVIMED