• Publications
  • Influence
A Secure and Efficient Conference Key Distribution System (Extended Abstract)
TLDR
We present practical conference key distribution systems based on public keys, which authenticate the users and which are ‘proven’ secure against any type of attack, provided the Diffie-Hellman problem is intractable. Expand
  • 649
  • 73
  • PDF
Universally composable and forward-secure RFID authentication and authenticated key exchange
TLDR
We also introduce new, provably secure protocols for anonymous authentication and key-exchange by RFID devices. Expand
  • 156
  • 20
  • PDF
Provably Secure Grouping-proofs for RFID tags
TLDR
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Expand
  • 102
  • 13
  • PDF
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
TLDR
We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. Expand
  • 73
  • 12
  • PDF
A secure and scalable Group Key Exchange system
TLDR
We present a Group Key Exchange protocol which extends in a natural way the Diffie-Hellman protocol. Expand
  • 121
  • 10
Secure Transactions with Mobile Agents in Hostile Environments
TLDR
We present an RSA implementation which answers affirmatively the open problem on undetachable signatures of Sander and Tschudin. Expand
  • 111
  • 9
  • PDF
LARS: a locally aware reputation system for mobile ad hoc networks
TLDR
We propose a simple and efficient Locally Aware Reputation System (LARS) for which the reputation of the nodes is derived by using direct observation. Expand
  • 76
  • 9
Efficient and Secure Conference-Key Distribution
TLDR
We use a two-party key distribution system as an underlying cryptographic primitive and extend it to a conference system. Expand
  • 107
  • 8
Provably Secure Ubiquitous Systems: Universally Composable RFID Authentication Protocols
TLDR
This paper examines two unlinkably anonymous, simple RFID identification protocols that require only the ability to evaluate hash functions and generate random values, and are provably secure against Byzantine adversaries. Expand
  • 130
  • 7
  • PDF
Secure multipath communication in mobile ad hoc networks
  • M. Burmester, T. Le
  • Computer Science
  • International Conference on Information…
  • 5 April 2004
TLDR
We first propose a general Bayesian model that satisfies the basic mobility requirements of a MANET and define the requirements for secure communication in this model. Expand
  • 72
  • 7
  • PDF
...
1
2
3
4
5
...