Publications associées à Chosen-plaintext attack

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.

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

Serge Vaudenay, Atefeh Mashatan, Asli Bay

Decorrelation Theory deals with general adversaries who are mounting iterated attacks, i.e., attacks in which an adversary is allowed to make d queries in each iteration with the aim of distinguishing a random cipher C from the ideal random cipher C^*. A b ...

2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...

2012

Piezoelectric Actuators Characterization

Pierre-André Farine, Alexis Boegli, Christian Robert, Patrick Stadelmann

This paper describes a system to drive piezoelectric actuators over more than one decade of voltages and one octave of frequencies, in order to perform high-speed complex impedance characterization at a user chosen voltage excitation level. This characteri ...

Ieee Computer Soc2012

On Hiding a Plaintext Length by Preencryption

Serge Vaudenay, Cihangir Tezcan

It is a well known fact that encryption schemes can not hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its precise value. Some standards such as TLS or SSH offer to do it by applying ...

Springer2011

Fast Key Recovery Attack on ARMADILLO1 and Variants

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The ARMADILLO cryptographic primitive is a multi-purpose cryptographic primitive for RFID devices proposed at CHES’10. The main purpose of the primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMA ...

Springer2011

Discovery and Exploitation of New Biases in RC4

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad

In this paper, we present several weaknesses in the stream cipher RC4. First, we present a technique to automatically reveal linear correlations in the PRGA of RC4. With this method, 48 new exploitable correlations have been discovered. Then we bind these ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Dissent: Accountable Group Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group. Messaging protocols such as Mix-nets and DC-nets leave online groups vulnerable to denial-of-service and Sybil attacks, while ...

2010

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Pouyan Sepehrdad, Jorge Nakahara

The contributions of this paper include the first linear hull and a revisit of the algebraic cryptanalysis of reduced-round variants of the block cipher PRESENT, under known-plaintext and ciphertext- only settings. We introduce a pure algebraic cryptanalys ...

Springer Berlin / Heidelberg2009

Chosen-plaintext attack

Graph Chatbot

Chattez avec Graph Search

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

How to Allocate Tasks Asynchronously

Piezoelectric Actuators Characterization

On Hiding a Plaintext Length by Preencryption

Fast Key Recovery Attack on ARMADILLO1 and Variants

N° 1 Gravity 2e éd.

Discovery and Exploitation of New Biases in RC4

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Dissent: Accountable Group Anonymity

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Fast Key Recovery Attack on ARMADILLO1 and Variants

On Hiding a Plaintext Length by Preencryption

Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers

Piezoelectric Actuators Characterization

N° 1 Gravity 2e éd.

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Dissent: Accountable Group Anonymity

How to Allocate Tasks Asynchronously

Discovery and Exploitation of New Biases in RC4