Concept

Chosen-ciphertext attack

Publications associées (76)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the pseudorandomness of top-level schemes of block ciphers

Serge Vaudenay

Block ciphers are usually based on one top-level scheme into which we plug Âround functionsÂ. To analyze security, it is important to study the intrinsic security provided by the top-level scheme from the viewpoint of randomness: given a block cipher in ...

2000

Design Validations for Discrete Logarithm Based Signature Schemes

Serge Vaudenay

A number of signature schemes and standards have been recently designed, based on the discrete logarithm problem. Examples of standards are the DSA and the KCDSA. Very few formal design/security validations have already been conducted for both the KCDSA an ...

2000

Dynamic overview techniques for image retrieval

Pearl Pu Faltings

One difficulty often overlooked in information retrieval systems is that search criteria themselves are often poorly defined. People describe their information needs in many different ways and frequently change their goals depending on the current results ...

Springer-Verlag/Wien2000

Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness

Serge Vaudenay

In previous work, security results of decorrelation theory was based on the infinity-associated matrix norm. This enables to prove that decorrelation provides security against non-adaptive iterated attacks. In this paper we define a new matrix norm dedicat ...

1999

Comparison of the Randomness Provided by Some AES Candidates

Serge Vaudenay

Using the decorrelation techniques we compare the randomness of three schemes used in the AES candidates. The target schemes are the original Feistel scheme and two modified Feistel schemes: the MARS-like structure and the CAST256-like structure. As a resu ...

1999

On Provable Security for Digital Signature Algorithms

Serge Vaudenay

In this paper we consider provable security for ElGamal-like digital signature schemes. We point out that the good the security criterion on the underlying hash function is pseudorandomness. We extend Pointcheval-Stern's results about the use of the random ...

1996