Publication

COMBINE: An Improved Directory-Based Consistency Protocol

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.

Low cost security for sensor networks

Christina Fragouli, Lorenzo Keller, Iris Safaka, Emre Atsan

We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by a ...

Institute of Electrical and Electronics Engineers Inc.2013

Input-Aware Equivocable Commitments and UC-secure Commitments With Atomic Exchanges

Serge Vaudenay

We define a new primitive, input-aware equivocable commitment, baring similar hardness assumptions as plaintext-aware encryption and featuring equivocability. We construct an actual input-aware equivocable commitment protocol, based on a flavor of Diffie-H ...

Springer2013

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

2011

A Provably Starvation-Free Distributed Directory Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests, allowing to write the object locally, as well as lookup requests, providing a read-on ...

Springer-Verlag2010

Joint Identity-Message Coding for Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect ...

Institute of Electrical and Electronics Engineers2010

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2010

We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, which was proposed by Lucks et al., more closely and note its inability to recover in case ...

Springer2009

At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol, which we call SQUASH-0, was using a linear mixing function which was subse ...

Springer2009

Decentralized Polling with Respectable Participants

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

We consider the polling problem in a social network where participants care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we show that a simple s ...

2009