Publications associées à X.509

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.

Reconstruction of Finite Rate of Innovation Signals with Model-Fitting Approach

Dimitri Nestor Alice Van De Ville, Thierry Blu, Zafer Dogan

Finite rate of innovation (FRI) is a recent framework for sampling and reconstruction of a large class of parametric signals that are characterized by finite number of innovations (parameters) per unit interval. In the absence of noise, exact recovery of F ...

Institute of Electrical and Electronics Engineers2015

The Chaining Lemma and Its Application

Sebastian Faust

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...

Springer-Verlag Berlin2015

Capacity and Data Complexity in Multidimensional Linear Attack

Serge Vaudenay, Jialin Huang

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Springer2015

The Inconvenient Truth about Web Certificates

Jean-Pierre Hubaux, Julien Freudiger, Nevena Vratonjic, Vincent Bindschaedler

HTTPS is the de facto standard for securing Internet communications. Although it is widely deployed, the security provided with HTTPS in practice is dubious. HTTPS may fail to provide security for multiple reasons, mostly due to certificate-based authentic ...

2011

Interpreting Hash Function Security Proofs

Juraj Sarinay

We provide a concrete security treatment of several "provably secure" hash functions. Interpreting arguments behind MQ-HASH, FSB, SWIFFTX and VSH we identify similar lines of reasoning. We aim to formulate the main security claims in a language closer to t ...

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

Methods for efficient certificate revocation list compression

Serge Vaudenay, Imad Aad, Valtteri Niemi, Rafik Chaabouni, Atefeh Mashatan

A method for providing efficient management of certificate revocation may comprise storing a list of identifiers of digital certificates including a revocation list defining a list of revoked certificates in an accumulator, storing a witness value in assoc ...

2010

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Arjen Lenstra, Dag Arne Osvik

We present a refined chosen-prefix collision construction for MD5 that allowed creation of a rogue Certification Authority (CA) certificate, based on a collision with a regular end-user website certificate provided by a commercial CA. Compared to the previ ...

Springer Verlag2009

Certificate Revocation List Distribution in Vehicular Communication Systems

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Ghita Mezzour

The need to evict compromised, faulty, or illegitimate nodes is well understood in prominent projects designing security architectures for Vehicular Communication (VC) systems. The basic approach envisioned to achieve this is via distri- bution of Certific ...

2008

X.509

Graph Chatbot

Chattez avec Graph Search

Reconstruction of Finite Rate of Innovation Signals with Model-Fitting Approach

The Chaining Lemma and Its Application

Capacity and Data Complexity in Multidimensional Linear Attack

The Inconvenient Truth about Web Certificates

Interpreting Hash Function Security Proofs

Methods for efficient certificate revocation list compression

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Revocation Games in Ephemeral Networks

Secure communication using authenticated channels

Certificate Revocation List Distribution in Vehicular Communication Systems

Interpreting Hash Function Security Proofs

The Chaining Lemma and Its Application

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Capacity and Data Complexity in Multidimensional Linear Attack

Revocation Games in Ephemeral Networks

Secure communication using authenticated channels

Reconstruction of Finite Rate of Innovation Signals with Model-Fitting Approach

The Inconvenient Truth about Web Certificates

Certificate Revocation List Distribution in Vehicular Communication Systems

Methods for efficient certificate revocation list compression