TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Authors:
- 1 June 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 173-180
Abstract
Key distribution in wireless sensor networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience and storage. Further, even though conventional public key and elliptic curve cryptosystem are computationally feasible on sensor nodes, protocols based on them are not. They require exchange and storage of large keys and certificates, which is expensive. Using pairing-based cryptography (PBC) protocols, conversely, parties can agree on keys without any interaction. In this work, we (i) show how security in WSNs can be bootstrapped using an authenticated identity based non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for an 8-bit processor. TinyPBC is able to compute pairings in about 5.5s on an ATmega128L clocked at 7.3828-MHz (the MICA2 and MICAZ node microcontroller).Keywords
This publication has 31 references indexed in Scilit:
- Pairings for cryptographersDiscrete Applied Mathematics, 2008
- Efficient pairing computation on supersingular Abelian varietiesDesigns, Codes and Cryptography, 2007
- Software multiplication using Gaussian normal basesIEEE Transactions on Computers, 2006
- A pairwise key predistribution scheme for wireless sensor networksACM Transactions on Information and System Security, 2005
- Revisiting random key pre-distribution schemes for wireless sensor networks2004
- Random key-assignment for secure Wireless Sensor Networks2003
- Analyzing and modeling encryption overhead for sensor network nodes2003
- LEAP2003
- SPINS: Security Protocols for Sensor NetworksWireless Networks, 2002
- A key-management scheme for distributed sensor networks2002