Concept

HTTPS

Related publications (56)

Sampling Spherical Finite Rate of Innovation Signals

Sampling schemes on the sphere require O(L^2) samples to perfectly sample and reconstruct a signal with bandwidth L. If the signal in question is a low-pass observation of a finite collection of spikes or rotations of a known function, we can use less samp ...

2015

Private and Secure Public-Key Distance Bounding: Application to NFC Payment

Serge Vaudenay

Distance-Bounding is used to defeat relay attacks. For wireless payment systems, the payment terminal is not always online. So, the protocol must rely on a public key for the prover (payer). We propose a generic transformation of a (weakly secure) symmetri ...

Springer2015

The Limits of Composable Crypto with Transferable Setup Devices

Serge Vaudenay, Miyako Ohkubo

UC security realized with setup devices imposes that single instances of these setups are used. In most cases, UC-realization relies further on other properties of the setups devices, like tamper-resistance. But what happens in stronger versions of the UC ...

ACM2015

User-side adaptive protection of location privacy in participatory sensing

Karl Aberer, Jean-Pierre Hubaux, Rammohan Narendula, Berker Agir

The participatory sensing paradigm, through the growing availability of cheap sensors in mobile devices, enables applications of great social and business interest, e.g., electrosmog exposure measurement and early earthquake detection. However, users' priv ...

Springer Verlag2014

On Modeling Terrorist Frauds

Serge Vaudenay

Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks. Their security models at still unstable, especially when considering terrorist fraud. This considers the case where a malicious p ...

Springer2013

Convergent Message-Passing Algorithms in the Presence of Erasures

Nicholas Ruozzi

We examine how to design convergent and correct message-passing schemes, similar to the min-sum algorithm, for maximum a posteriori (MAP) estimation in the case that the messages passed between two nodes of the network may never be delivered. The proposed ...

Ieee2013

Scalable and Secure Polling in Dynamic Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n^2) in an n nodes system, we present SPP (Secure an ...

2012

Adaptive Personalized Privacy in Participatory Sensing

Karl Aberer, Jean-Pierre Hubaux, Rammohan Narendula, Berker Agir

The participatory sensing paradigm has interesting applications, e.g. electrosmog/air-pollution monitoring, carbon footprint estimation, etc., but raises serious privacy concerns. Existing static privacy-enabling approaches offer no privacy guarantees, whi ...

2012

Scalable and Secure Aggregation in Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of

O(n^3)

, we present a distributed protocol that r ...

CoRR2011

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

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Scalable and Secure Aggregation in Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

O(n^3)

, we present a distributed protocol that r ...

CoRR2011