Smart dust motes are miniature self-contained systems that may be deployed in very large numbers. In military applications these devices are subject to different threats than conventionally deployed systems, for example, attackers may deploy counterfeit devices to subvert the integrity of a system, and this may be a greater concern that confidentiality. The possibility of identity theft reduces...

Many organizations show a strong interest in digital signature technology as a mean for secure and authenticated document exchange, hoping it will help reducing paper-based transactions. The main problem posed by this technology is with the necessary public-key infrastructure, and in particular with certificate status handling. Rather than addressing the revocation problem in general, a specifi...

This paper describes a novel solution for authenticated key agreement for wireless sensor networks (WSN) in logistics. The retrieved data may not be spoofed as it is used to generate information about the quality of the freight, especially for sensitive freight like food. Instead of relying on pre-configuration, every sensor node is authenticated immediately before deployment (e.g. loading into...

Proper privacy protection in RFID systems is important. However, many of the schemes known are impractical. Some use hash functions instead of the more hardware efficient symmetric encryption schemes as a cryptographic primitive. Others incur a rather large time penalty at the reader side, because the reader has to perform a key search over large tag key space. Moreover, they do not allow for d...

In this paper, we propose a new variant of indistinguishabilitybased security model for the RFID authentication protocol, which allows an adversary to obtain an authentication result and secret key of a target tag. Ng et al. showed that symmetric-key based RFID authentication protocols cannot be resilient to the above information leakage simultaneously in the Paise-Vaudenay security model. We r...

This paper studies the relationship between unpredictable functions (which formalize the concept of a MAC) and pseudo-random functions. We show an efficient transformation of the former to the latter using a unique application of the Goldreich-Levin hard-core bit (taking the inner-product with a random vector r): While in most applications of the GL-bit the random vector r may be public, in our...

Virtually all applications which provide or require a security service need a secret key. In an ambient world, where (potentially) sensitive information is continually being gathered about us, it is critical that those keys be both securely deployed and safeguarded from compromise. In this paper, we provide solutions for secure key deployment and storage of keys in sensor networks and RFID syst...

We describe and prove (in the random-oracle model) the security of a simple but efficient zero-knowledge identification scheme, whose security is based on the computational Diffie-Hellman problem. Unlike other recent proposals for efficient identification protocols, we don’t need any additional assumptions, such as the Knowledge of Exponent assumption. From this beginning, we build a simple key...

Anshel, Anshel, Goldfeld and Lemieaux introduced the Colored Burau Key Agreement Protocol (CBKAP) as the concrete instantiation of their Algebraic Eraser scheme. This scheme, based on techniques from permutation groups, matrix groups and braid groups, is designed for lightweight environments such as RFID tags and other IoT applications. It is proposed as an underlying technology for ISO/IEC 291...