Publications associées à Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we ...

2011

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Dan Alistarh

A randomized implementation is given of a test-and-set register with O(log log it) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complex ...

Springer-Verlag Berlin2011

Le coût attentionnel associé aux fonctions exécutives impliquées dans le contrôle postural

Estelle Palluel, Jean-Baptiste Mignardot

The present paper tried to provide a review of the different works investigating the attentional cost of postural control. Within the context of a dual-task, the attentional demand associated with postural control depends on various factors such as (1) the ...

2011

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

2010

Repeater Insertion Techniques for 3D Interconnects

Giovanni De Micheli, Vasileios Pavlidis

A new approach for inserting repeaters in 3-D interconnects is proposed. The allocation of repeaters along an interplane interconnect is iteratively determined. The proposed approach is compared with two other techniques based on conventional methods used ...

2010

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Distributed Agreement with Optimal Communication Complexity

Seth Gilbert

We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication efficiency, using only O(n) bits of communication, and terminates in (almost optima ...

Siam, 3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa2010

An Information Theoretic Approach to Speaker Diarization of Meeting Recordings

Deepu Vijayasenan

In this thesis we investigate a non parametric approach to speaker diarization for meeting recordings based on an information theoretic framework. The problem is formulated using the Information Bottleneck (IB) principle. Unlike other approaches where the ...

EPFL2010

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Graph Chatbot

Chattez avec Graph Search

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Le coût attentionnel associé aux fonctions exécutives impliquées dans le contrôle postural

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Fast Randomized Test-and-Set and Renaming

Repeater Insertion Techniques for 3D Interconnects

Fast Randomized Test-and-Set and Renaming

Distributed Agreement with Optimal Communication Complexity

An Information Theoretic Approach to Speaker Diarization of Meeting Recordings

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

Distributed Agreement with Optimal Communication Complexity

Fast Randomized Test-and-Set and Renaming

Le coût attentionnel associé aux fonctions exécutives impliquées dans le contrôle postural

Repeater Insertion Techniques for 3D Interconnects

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Fast Randomized Test-and-Set and Renaming

An Information Theoretic Approach to Speaker Diarization of Meeting Recordings

Sub-Logarithmic Test-and-Set Against a Weak Adversary