Self-Organized Public-Key Management for Mobile Ad Hoc Networks
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.
Security is at the core of any communication system and, in particular, of wireless (radio) networks. In this thesis, we focus on three important security aspects in the framework of wireless networks: selfish (noncooperative) behavior at the Medium Access ...
We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g. 15 bits. We call this SAS-based authentication as for authentication based on short a ...
It is sometimes argued that finding meaningful hash collisions might prove difficult. We show that for several common public key systems it is easy to construct pairs of meaningful and secure public key data that either collide or share other characteristi ...
A secure communication over an insecure channel without any prior exchanged key can be established with the help of an authentication step to exchange a public key and then using public-key cryptography such as RSA. In this work, we concentrate on message ...
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 ...
Securing ad hoc networks is notoriously challenging, notably due to the lack of an on-line infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case ...
In contrast with conventional networks, mobile ad hoc networks usually do not provide on-line access to trusted authorities or to centralized servers and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reaso ...
This PhD thesis focuses on fair exchange protocols and radio frequency identification protocols. Fair exchange stems from a daily life problem: how can two people exchange objects (material or immaterial) fairly, that is, without anyone being hurt in the e ...
Securing ad hoc networks is notoriously challenging, notably due to the lack of an on-line infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case ...
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bit “1”, but not the contrary), we propose integrity codes (I-codes) for a radio co ...
