Publications associées à Secret réparti

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.

Depth-based multiview distributed video coding

Thomas Maugey

Multiview distributed video coding (DVC) has gained much attention in the last few years because of its potential in avoiding communication between cameras without decreasing the coding performance. However, the current results are not matching the expecta ...

Ieee-Inst Electrical Electronics Engineers Inc2014

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge–response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

A Distributed Polling with Probabilistic Privacy

Rachid Guerraoui, Florian Huc, Yahya Benkaouz

In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptograp ...

2013

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Practical & Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. At FSE 2013, we presented SKI as the first family of provably sec ...

2013

A decision support system assessing the trust level in supply chains based on information sharing dimensions

Naoufel Cheikhrouhou, Omar Ayadi

Assessing customer trust in suppliers with regards to its influencing factors is an important open issue in supply chain management literature. In this paper, a customer trust index is designed as the trust level arising from the information sharing degree ...

Pergamon-Elsevier Science Ltd2013

Secret réparti

Graph Chatbot

Chattez avec Graph Search

Automated Side-Channel Vulnerability Discovery and Hardening

Depth-based multiview distributed video coding

On Selecting the Nonce Length in Distance-Bounding Protocols

On Selecting the Nonce Length in Distance-Bounding Protocols

Exchanging Pairwise Secrets Efficiently

A Distributed Polling with Probabilistic Privacy

Creating Secrets out of Erasures

Practical & Provably Secure Distance-Bounding

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

A decision support system assessing the trust level in supply chains based on information sharing dimensions

A Distributed Polling with Probabilistic Privacy

Practical & Provably Secure Distance-Bounding

Creating Secrets out of Erasures

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Automated Side-Channel Vulnerability Discovery and Hardening

Exchanging Pairwise Secrets Efficiently

Depth-based multiview distributed video coding

On Selecting the Nonce Length in Distance-Bounding Protocols

On Selecting the Nonce Length in Distance-Bounding Protocols

A decision support system assessing the trust level in supply chains based on information sharing dimensions