| Texto completo | |
| Autor(es): |
Oliveira, Leonardo B.
;
Aranha, Diego F.
;
Gouvea, Conrado P. L.
;
Scott, Michael
;
Camara, Danilo F.
;
Lopez, Julio
;
Dahab, Ricardo
Número total de Autores: 7
|
| Tipo de documento: | Artigo Científico |
| Fonte: | COMPUTER COMMUNICATIONS; v. 34, n. 3, p. 9-pg., 2011-03-15. |
| Resumo | |
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 cryptosystems are computationally feasible on sensor nodes, protocols based on them are not, as they require the exchange and storage of large keys and certificates, which is expensive. Using Pairing-Based Cryptography (PBC) protocols 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 8, 16 and 32-bit processors commonly found in sensor nodes. TinyPBC is able to compute pairings, the most expensive primitive of PBC, in 1.90 s on ATmega128L, 1.27 s on MSP430 and 0.14 s on PXA27x. (C) 2010 Elsevier B.V. All rights reserved. (AU) | |
| Processo FAPESP: | 05/00557-9 - Soluções de segurança para redes de sensores sem fio hierárquicas |
| Beneficiário: | Leonardo Barbosa e Oliveira |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |
| Processo FAPESP: | 07/06950-0 - Implementação Eficiente de Algoritmos Criptográficos em Arquiteturas Modernas |
| Beneficiário: | Diego de Freitas Aranha |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |