Publication

Erased Secrets: Practical Information-Theoretic Group Secrecy

Publications associées (164)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks

André Schiper, David Cavin, Yoav Sasson

Although far from optimal, flooding is an in- dispensable message dissemination technique for network- wide broadcast within mobile ad hoc networks (MANETs). As such, the plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, c ...

2002

Connectivity in ad-hoc and hybrid networks

Martin Hasler

We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where f ...

2002

Connectivity in ad-hoc and hybrid networks

Patrick Thiran, Martin Hasler, Olivier Dousse

2002

Revisiting Liveness Properties in the Context of Secure Systems

Felix Gaertner

Distinguishing trace-based system properties into safety properties on the one hand and liveness properties on the other has proven very useful for specifying and validating concurrent and fault-tolerant systems. We study the adequacy of these abstractions ...

2002

GPS-free Positioning in Mobile Ad-Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

In this paper we consider the problem of node positioning in ad-hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on Global Positioning System (GPS). The algorithm uses the distances between the nodes to b ...

2001

Cryptanalysis of the Chor-Rivest cryptosystem

Serge Vaudenay

Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before all but the Chor-Rivest cryptosystem (B. Chor and R.L. Rivest, 1985) was broken. The article demonstrates how to break this one with its suggested parameters ...

2001

Method for transmitting payment information between a terminal and a third equipment

Levente Buttyan

NOVELTY - Secret data is generated in one terminal or user equipment. Secret or hash value of secret is displayed on display terminal (11) or user equipment and is entered on input element of other terminal or user equipment. Shared secret data is used to ...

2001

Towards Mobile Ad-Hoc WANs: Terminodes

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Ljubica Blazevic, Levente Buttyan, Milan Vojnovic

Terminodes are personal devices that provide functionality of both the terminals and the nodes of the network. A network of terminodes is an autonomous, fully self-organized, wireless network, independent of any infrastructure. It must be able to scale up ...

2000

Issues on Mobile Ad-Hoc WANs

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Ljubica Blazevic

In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, s ...

2000

Issues on Mobile Ad-Hoc WANs

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Ljubica Blazevic

2000