Publications associées à Whois

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, Iosif-Daniel Spulber

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, even ...

Springer,2012

Dissent in Numbers: Making Strong Anonymity Scale

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Current anonymous communication systems make a trade-off between weak anonymity among many nodes, via onion routing, and strong anonymity among few nodes, via DC-nets. We develop novel techniques in Dissent, a practical group anonymity system, to increase ...

2012

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

André Schiper, Zarko Milosevic, Nuno Filipe de Sousa Santos, Martin Biely

Implementations of state machine replication are prevalently using variants of Paxos or other leader-based protocols. Typically these protocols are also leader-centric, in the sense that the leader performs more work than the non-leader replicas. Such prot ...

2012

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Martin Vetterli, Yue Lu, Ivan Dokmanic

We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RIRs. In contrast, we are interested in reconstructing the room geometry from a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Multiversion concurrency control for the generalized search tree

Boi Faltings, Ion Constantinescu, Samuel Spycher

Many read-intensive systems where fast access to data is more important than the rate at which data can change make use of multidimensional index structures, like the generalized search tree (GiST). Although in these systems the indexed data are rarely upd ...

2009

Knowing When to Slide :: Efficient Scheduling for Sliding Window Processing

Karl Aberer, Sebastian Michel, Ali Salehi, Mehdi Riahi

We consider sliding window query execution scheduling in stream processing engines. Sliding windows are an essential building block to limit the query focus at a particular part of the stream, based either on value count or time ranges. These so called sli ...

IEEE Computer Society2009

Congestion Control for Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, ...

IEEE2006

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.

Whois

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Dissent in Numbers: Making Strong Anonymity Scale

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Multiversion concurrency control for the generalized search tree

Knowing When to Slide :: Efficient Scheduling for Sliding Window Processing

Security-Preserving Asymmetric Protocol Encapsulation

Congestion Control for Distributed Hash Tables

Dynamic Update of Distributed Agreement Protocols

Graph Chatbot

Chattez avec Graph Search

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Dissent in Numbers: Making Strong Anonymity Scale

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Dynamic Update of Distributed Agreement Protocols

Congestion Control for Distributed Hash Tables

Multiversion concurrency control for the generalized search tree

Knowing When to Slide :: Efficient Scheduling for Sliding Window Processing

Security-Preserving Asymmetric Protocol Encapsulation