Concept

Secret partagé

Publications associées (67)

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

Pollution Attack Defense for Coding Based Sensor Storage

László Czap, Levente Buttyan

We present a novel information theoretic approach to make network coding based storage secure against pollution attacks in sensor networks. The approach is based on a new decoding algorithm which makes it possible to ﬁnd adversarial blocks using one more e ...

2010

Signatures for Multisource Network Coding

László Czap

We consider the problem of securing inter-ﬂow network coding with multiple sources. We present a practical homomorphic signature scheme that makes possible to verify network coded packets composed of data originating from diﬀerent sources. The multi-source ...

ArXiv2010

Group Secret Key Generation over Broadcast Erasure Channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the t ...

2010

Erased Secrets: Practical Information-Theoretic Group Secrecy

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

2010

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009

Secure Communication using an Untrusted Relay via Sources and Channels

Michael Christoph Gastpar

Confidential communication aided by a relay without security clearance is studied. General strategies and outer bounds are derived for the problem of secret communication and secret key generation when correlated observations at all terminals are available ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Enabling Privacy For Distributed Video Coding by Transform Domain Scrambling

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret

In this paper, a novel scheme for video scrambling is introduced for Distributed Video Coding. The goal is to conceal video information in several applications such as video surveillance and anonymous video communications to preserve privacy. This is achie ...

2008

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