TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

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 identitybased non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for an 8-bit processor. TinyPBC is an open source code able to compute pairings as well as binary multiplication in about 5.5s and 4019.46µs, respectively, on the ATmega128L 7.3828-MHz/4KB SRAM/128KB ROM processor ...

• Type: Journal
• Year: 2011
• Where: COMCOM
• Authors: Leonardo B. Oliveira, Diego F. Aranha, Conrado Porto Lopes Gouvêa, Michael Scott, Danilo F. Câmara, Julio López, Ricardo Dahab
• Keywords: COMCOM 2011, Computational Linguistics, Conventional Public Key, Elliptic Curve Cryptosystem, Wireless Sensor Networks