Publications related to Scalable and Secure Polling in Dynamic Distributed Networks

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Jean-Pierre Hubaux, Bryan Alexander Ford, Christian Vincent Mouchet, Jean Louis Raisaro, Zhicong Huang, David Jules Froelicher, Joao André Gomes de Sá e Sousa, Patricia Egger

Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverag ...

2017

Experimental Comparison of Multicast Authentication for Wide Area Monitoring Systems

Jean-Yves Le Boudec, Teklemariam Tsegay Tesfay

Multicast is proposed as a preferred communication mechanism for many power grid applications. One of the biggest challenges for multicast in smart grid is ensuring source authentication without violating the stringent time requirement. The research commun ...

2017

Axiom: DTLS-Based Secure IoT Group Communication

Kirill Nikitin

This article presents Axiom, a DTLS-based approach to efficiently secure multicast group communication among IoT-constrained devices. Axiom provides an adaptation of the DTLS record layer, relies on key material commonly shared among the group members, and ...

Assoc Computing Machinery2017

Building Privacy-Preserving Cryptographic Credentials from Federated Online Identities

Bryan Alexander Ford, Ennan Zhai

Federated identity providers, e.g., Facebook and PayPal, offer a convenient means for authenticating users to third-party applications. Unfortunately such cross-site authentications carry privacy and tracking risks. For example, federated identity provider ...

Association for Computing Machinery2016

A Composition Theorem for Conical Juntas

Mika Tapani Göös

We describe a general method of proving degree lower bounds for conical juntas (nonnegative combinations of conjunctions) that compute recursively defined boolean functions. Such lower bounds are known to carry over to communication complexity. We give two ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2016

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

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

Deniable RSA Signature: The Raise and Fall of Ali Baba

Serge Vaudenay

The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evidence to get justice from the Caliph. On the other hand, Ali Baba wants to be ...

Springer2012

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

Scalable and Secure Polling in Dynamic Distributed Networks

Graph Chatbot

Chat with Graph Search

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Experimental Comparison of Multicast Authentication for Wide Area Monitoring Systems

Axiom: DTLS-Based Secure IoT Group Communication

Building Privacy-Preserving Cryptographic Credentials from Federated Online Identities

A Composition Theorem for Conical Juntas

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

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Secure Communication in Erasure Networks with State-feedback

Deniable RSA Signature: The Raise and Fall of Ali Baba

Scalable and Secure Aggregation in Distributed Networks

Scalable and Secure Aggregation in Distributed Networks

A Composition Theorem for Conical Juntas

Secure Communication in Erasure Networks with State-feedback

Experimental Comparison of Multicast Authentication for Wide Area Monitoring Systems

Axiom: DTLS-Based Secure IoT Group Communication

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Building Privacy-Preserving Cryptographic Credentials from Federated Online Identities

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

Deniable RSA Signature: The Raise and Fall of Ali Baba