Concept

Secure copy

Publications associées (54)

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

Self-Policing Mobile Ad-Hoc Networks by Reputation

Jean-Yves Le Boudec, Sonja Buchegger

Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...

2005

Collaborative TeleNeurology for Remote Diagnosis

Jean-Philippe Thiran, Leila Cammoun

This paper presents the TENECI (Collaborative tele- neurology) project which allows practitioners to use telecommunication technologies to provide medical information and services for neurological diseases. Specificities of remote neurology are described a ...

2005

Self-Policing Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty ...

CRC Press2004

Location verification and key management in wireless networks

Srdan Capkun

This thesis is primarily concerned with two security mechanisms for wireless networks: location verification and key management. These mechanisms are potential building blocks in the security architectures of a range of applications. Under location verific ...

EPFL2004

On Cheating in CSMA/CA Ad Hoc Networks

Jean-Pierre Hubaux, Imad Aad, Mario Cagalj

CSMA/CA protocols rely on the random deferment of packet transmissions. Like most other protocols, CSMA/CA was designed with the assumption that the nodes would play by the rules. This is important, since the nodes themselves control their random deferment ...

2004

SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchroni ...

2003

Secure message transmission in mobile ad hoc networks

Panagiotis Papadimitratos

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the ...

Elsevier2003

Secure Message Transmission in Mobile Ad Hoc Networks

Panagiotis Papadimitratos

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the ...

2003

Secure Routing for Mobile Ad hoc Networks

Panagiotis Papadimitratos

The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the wired networking infrastructure or, possibly, evolve to auto ...

SCS2002

On the security of Lenstra's variant of DSA without long inversions

Arjen Lenstra

We use bounds of exponential sums to show that, for a wide class of parameters, the modification of the digital signature algorithm (DSA) scheme proposed by A.K. Lenstra (see Proc. Asiacrypt'96, Lect. Notes in Comp. Sci., vol.1163, p.57-64, 1996) is as sec ...

2001