Contemporary Cryptology

verfasst von: Dario Catalano, Ronald Cramer, Giovanni Di Crescenzo, Ivan Darmgård, David Pointcheval, Tsuyoshi Takagi

Verlag: Birkhäuser Basel

Buchreihe : Advanced Courses in Mathematics - CRM Barcelona

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten

Über dieses Buch

The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes:
- efficient distributed computation modulo a shared secret
- multiparty computation
- foundations of modern cryptography
- provable security for public key schemes
- efficient and secure public-key cryptosystems.

Inhaltsverzeichnis

Frontmatter

Efficient Distributed Computation Modulo a Shared Secret

Dario Catalano

Multiparty Computation, an Introduction

Ronald Cramer, Ivan Damgård

Foundations of Modern Cryptography

Giovanni Di Crescenzo

Provable Security for Public Key Schemes

Abstract

Since the appearance of public-key cryptography in the Diffie-Hellman seminal paper, many schemes have been proposed, but many have been broken. Indeed, for a long time, the simple fact that a cryptographic algorithm had withstood cryptanalytic attacks for several years was 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, this initially was a purely theoretical work: very few practical schemes could be proven in this so-called “standard model” because such a security level rarely meets with efficiency. Ten years ago, Bellare and Rogaway proposed a trade-off to achieve some kind of validation of efficient schemes, by identifying some concrete cryptographic objects with ideal random ones. The most famous identification appeared in the so-called “random-oracle model”. More recently, another direction has been taken to prove the security of efficient schemes in the standard model (without any ideal assumption) by using stronger computational assumptions.

In these lectures, we focus on practical asymmetric protocols together with their “reductionist” security proofs, mainly in the random-oracle model. 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.

David Pointcheval

Efficient and Secure Public-Key Cryptosystems

Abstract

Nowadays, RSA cryptosystem is used for practical security applications, e.g., SSL, IPSEC, PKI, etc. Elliptic curve cryptosystem has focused on the implementation on memory constraint environments due to its small key size. In this chapter we describe an overview of efficient algorithms applied to RSA cryptosystem and EC cryptosystem. On the other hand, novel attacks on the efficient implementation have been proposed, namely timing attack, side channel attacks, fault attack, etc. These attacks can break the secret key of the underlying cryptosystem, if the implementation method is not carefully considered. We also explain several attacks related to efficient implementation, and present countermeasures against them.

Tsuyoshi Takagi

Titel: Contemporary Cryptology
verfasst von: Dario Catalano
Ronald Cramer
Giovanni Di Crescenzo
Ivan Darmgård
David Pointcheval
Tsuyoshi Takagi
Verlag: Birkhäuser Basel
Electronic ISBN: 978-3-7643-7394-8
Print ISBN: 978-3-7643-7294-1
DOI: https://doi.org/10.1007/3-7643-7394-6