This paper deals with Epi.q, a family of mobile robots whose main characteristic is a wheel-legged hybrid locomotion. These multi-purpose robots can be successfully exploited for security and surveillance tasks. The document presents state of the art security robotics, the Epi.q mechanical architecture, the concept behind the robot driving unit, three prototypes and the design of a new one.

Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously deened and satissed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.

This document defines protocols, procedures, and conventions to be employed by peers implementing the Generic Security Service Application Program Interface (GSS-API) when using the Extensible Authentication Protocol mechanism. Through the GS2 family of mechanisms defined in RFC 5801, these protocols also define how Simple Authentication and Security Layer (SASL) applications use the Extensible...

In this paper we discuss some fundamental security issues of distributed systems of weak devices. We briefly describe two extreme kinds of such systems the sensor network and theRadio Frequency IDentification (RFID) system from the point of view of security mechanisms designer. We describe some most important particularities and issues (including unsolved problems) that have to be taken into ac...

As wireless technology is becoming more and more prevalent; security in such networks is becoming a challenging issue and is in great demand. One of the most powerful tools in this area which helps to simulate and evaluate the behaviour of networks and protocols is OPtimised Network Engineering Tool (OPNET). Although OPNET has covered a wide range of models and a variety of protocols, there is ...

Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously de ned and satis ed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.

Groups with pairing are now considered as standard building blocks for cryptographic primitives. The security of schemes based on such groups relies on hypotheses related to the discrete logarithm problem. As these hypotheses are not proved, one would like to have some positive security argument for them. It is usual to assess their security in the so called generic group model introduced by Ne...

The Rijndael cipher was chosen as the Advanced Encryption Standard (AES) in August 1999. Its internal structure exhibits unusual properties such as a clean and simple algebraic description for the S-box. In this research, we construct a scalable family of ciphers which behave very much like the original Rijndael. This approach gives us the opportunity to use computational complexity theory. In ...

Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously defined and satisfied in the common reference string model, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the first complexity-based proof of security for blind signatures.

We will present some ideas about sharing a secret in a monotonic access structure. We show the relations which occur between the method of encrypting a monotonic access structure with the use of basis sets or maximal unprivileged sets, and that based on a logical formula (used by Benaloh and Leichter in [1]). We will also give some facts connected with the problem of security, including the asp...