-
[show abstract]
[hide abstract]
ABSTRACT: The family of WG stream ciphers has good randomness properties. In this paper, we parameterize WG-7 stream cipher for RFID tags, where the modest computation/storage capabilities and the necessity to keep their prices low present a challenging problem that goes beyond the well-studied cryptography. The rigorous security analysis of WG-7 indicates that it is secure against time/memory/data trade off attack, differential attack, algebraic attack, correlation attack and Discrete Fourier Transform (DFT) attack. Furthermore, we offer efficient implementation of WG-7 on the 4-bit microcontroller ATAM893-D and the 8-bit microcontroller ATmega8 from ATmel. The experimental results show that WG-7 outperforms most of previous proposals in terms of throughput and implementation complexity. Moreover, we propose a mutual authentication protocol based on WG-7, which provides the untraceability, resistance of tag impersonation and reader impersonation. With its verified cryptographic properties, low implementation complexity and ideal throughput, WG-7 is a promising candidate for RFID applications.
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE; 01/2011
-
RFID. Security and Privacy - 7th International Workshop, RFIDSec 2011, Amherst, USA, June 26-28, 2011, Revised Selected Papers; 01/2011
-
Proceedings of the Global Communications Conference, GLOBECOM 2011, 5-9 December 2011, Houston, Texas, USA; 01/2011
-
IACR Cryptology ePrint Archive. 01/2011; 2011:247.
-
[show abstract]
[hide abstract]
ABSTRACT: Electronic Product Code (EPC) Radio Frequency IDentification (RFID) tags support a cost-effective anti-counterfeiting mechanism through the tag-specific and globally unique Transponder ID (TID). However, with the existence of customizable tags, this countermeasure could easily be bypassed as long as the TID codes are leaked through either physically opening genuine tags or unauthorizedly breaching the backend database. To the best of our knowledge, physical protection technologies are exploited to guarantee the confidentiality of the on-tag TIDs, but cryptographic protections targeting the security of database-side TIDs does not receive much attention to date. In this paper, we investigate a new encryption mechanism for the confidentiality of database-side information, yet let it be used in real time without decryption during tag identification/authentication. To this end, a lightweight on-tag cryptographic primitive Verifiable Cipher is constructed to achieve a new security property called Unauthorized Access the backend DataBase (UADB) resistance. Based on this primitive, we propose a multifunctional protocol to robust the existed TID-based anti-counterfeiting mechanism. The advantages of this protocol, in terms of security properties offered, is then presented. At last, the proof-of-concept implementation on the 4-bit, low-cost and low-power-consumption microcontroller indicates our scheme is feasible for any low-cost passive tags. Besides, the database-side implementation justifies that encryption through Verifiable Cipher nearly has no impact on the performance of the database.
04/2010;
-
Ad Hoc Networks - Second International Conference, ADHOCNETS 2010, Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers; 01/2010
-
Financial Cryptography and Data Security, FC 2010 Workshops, RLCPS, WECSR, and WLC 2010, Tenerife, Canary Islands, Spain, January 25-28, 2010, Revised Selected Papers; 01/2010
-
HOST 2010, Proceedings of the 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), 13-14 June 2010, Anaheim Convention Center, California, USA; 01/2010
-
IACR Cryptology ePrint Archive. 01/2009; 2009:627.
-
[show abstract]
[hide abstract]
ABSTRACT: The radiofrequency identification (RFID) technology provides an extensible, flexible and secure measure against product counterfeiting. However, due to the harsh cost and power constraints of RFID tags only dedicated cryptographic engines or low-power consumption microcontrollers can be integrated into tags to implement various security mechanisms. In this contribution, we investigate efficient implementation of an ultra-lightweight cryptographic algorithm Hummingbird on a zero-power 4-bit MARC4 microcontroller from Atmel and compare the performance of Hummingbird to another ultra-lightweight block cipher PRESENT on the same platform. Our experimental results show that after a system initialization phase Hummingbird can achieve about 58% faster throughput than the block cipher PRESENT on a 4-bit ATAM893-D microcontroller running at 16 KHz, 500 KHz and 2 MHz, respectively. In particular, Hummingbird can process one data block with less than 12 ms under a typical low power configuration of 4-bit microcontrollers such as an 1.8 V supply voltage and a 500 kHz clock frequency.
Proceedings of the 4th International Conference for Internet Technology and Secured Transactions, ICITST 2009, London, UK, November 9-12, 2009; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: The absence of an online trusted authority makes the issue of key revocation in mobile ad hoc networks (MANETs) particularly challenging. In this paper, we present a novel self-organized key revocation scheme based on the Dirichlet multinomial model and identity-based cryptography (IBC). Our key revocation scheme offers a theoretically sound basis for a node in MANETs to predict the behavior of other nodes based on its own observations and reports from peers. In our scheme, each node keeps track of three categories of behavior defined and classified by an external trusted authority, and updates its knowledge about other nodespsila behavior with 3-dimension Dirichlet distribution. Differentiating between suspicious behavior and malicious behavior enables nodes to make multilevel response by either revoking keys of malicious nodes or ceasing the communication with suspicious nodes for some time to gather more information for making further decision. Furthermore, we also analyze the attack-resistant properties of our key revocation scheme through extensive simulations in the presence of adversaries.
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on; 11/2008
-
Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings; 01/2008
-
Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers; 01/2008
-
Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, Canada, August 16-17, 2007, Revised Selected Papers; 01/2007
-
[show abstract]
[hide abstract]
ABSTRACT: The ideal class groups of hyperelliptic curves (HECs) can be used in cryptosystems based on the discrete loga-rithm problem. Recent developments of computational technolo-gies for scalar multiplications of divisor classes have shown that the performance of hyperelliptic curve cryptosystems (HECC) is compatible to that of elliptic curve cryptosystems (ECC). Espe-cially, genus 3 HECC are well suited for all kinds of embedded processor architectures, where resources such as storage, time or power are constrained, because of their short operand sizes. In this paper, we investigate the efficient explicit formulae for genus 3 HECs over both prime fields and binary fields, and analyze how many field operations are needed. First, we improve the explicit formulae for genus 3 HECs over binary fields using the theta divisors which can save about 20% ∼ 50% multiplications for four cases, and extend the method to genus 3 HECs over prime fields. We then discuss acceleration of the divisor class doubling for genus 3 HECs over binary fields. By constructing birational transformations of variables, we find four types of curves which can lead to much faster divisor class doubling and give the corresponding explicit formulae. Especially, for special genus 3 HECs over binary fields with h(X) = 1, we obtain the fastest explicit doubling formula which only requires 1I + 10M + 11S. Thirdly, we propose the inversion-free explicit formulae for genus 3 HEC over both prime fields and binary fields by introducing one more coordinate to collect the common denominator of the usual six coordinates. Finally, comparisons with the known results in terms of field operations and an implementation of genus 3 HECC over three binary fields on a Pentium-4 processor are provided.
-
[show abstract]
[hide abstract]
ABSTRACT: Motivated by the design of the well-known Enigma machine, we present a novel ultra-lightweight encryption scheme, referred to as Hummingbird, and its applications to a privacy-preserving identification and mutual authentication protocol for RFID applications. Hummingbird can provide the designed security with a small block size and is therefore ex-pected to meet the stringent response time and power consumption requirements described in the ISO protocol without any modification of the current standard. We show that Hum-mingbird is resistant to the most common attacks such as linear and differential cryptanalysis. Furthermore, we investigate some properties for integrating the Hummingbird into a privacy-preserving identification and mutual authentication protocol.
