Paper 2007/482
TinyPBC: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks
Leonardo B. Oliveira, Michael Scott, Julio López, and Ricardo Dahab
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 an open source code able to compute pairings as well
as binary multiplication in about 5.5s and 4019.46
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- sensor networkskey agreementidentity-basedcryptographypairing-based cryptographyimplementation
- Contact author(s)
- barbosa leonardo @ gmail com
- History
- 2008-01-07: revised
- 2007-12-28: received
- See all versions
- Short URL
- https://ia.cr/2007/482
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/482,
author = {Leonardo B. Oliveira and Michael Scott and Julio López and Ricardo Dahab},
title = {{TinyPBC}: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/482},
year = {2007},
url = {https://eprint.iacr.org/2007/482}
}
