loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes
Cambridge, Massachusetts
July 12-July 14
ISBN: 0-7695-2922-4
ASCII Text
x 
 
Leonardo B. Oliveira, Diego F. Aranha, Eduardo Morais, Felipe Daguano, Julio L?pez, Ricardo Dahab, "TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes," Network Computing and Applications, IEEE International Symposium on, pp. 318-323, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/NCA.2007.48,
author = {Leonardo B. Oliveira and Diego F. Aranha and Eduardo Morais and Felipe Daguano and Julio L?pez and Ricardo Dahab},
title = {TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes},
journal ={Network Computing and Applications, IEEE International Symposium on},
volume = {0},
year = {2007},
isbn = {0-7695-2922-4},
pages = {318-323},
doi = {http://doi.ieeecomputersociety.org/10.1109/NCA.2007.48},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Network Computing and Applications, IEEE International Symposium on
TI - TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes
SN - 0-7695-2922-4
SP318
EP323
A1 - Leonardo B. Oliveira,
A1 - Diego F. Aranha,
A1 - Eduardo Morais,
A1 - Felipe Daguano,
A1 - Julio L?pez,
A1 - Ricardo Dahab,
PY - 2007
KW - sensor networks; security; cryptography; bilinear pairings; Tate pairing implementation
VL - 0
JA - Network Computing and Applications, IEEE International Symposium on
ER -
 
Leonardo B. Oliveira, UNICAMP, Brazil
Diego F. Aranha, UNICAMP, Brazil
Eduardo Morais, UNICAMP, Brazil
Felipe Daguano, UNICAMP, Brazil
Julio L?pez, UNICAMP, Brazil
Ricardo Dahab, UNICAMP, Brazil
After a few years of intense research, Wireless Sensor Networks (WSNs) still demand new secure and cryptographic schemes. On the other hand, the advent of cryptography from pairings has enabled a wide range of novel cryptosystems. In this work we present TinyTate, the first known implementation of pairings for sensor nodes based on the 8- bit/7.3828-MHz ATmega128L microcontroller (e.g., MICA2 and MICAz motes). We then conclude that cryptography from pairings is indeed viable in resource-constrained nodes.
Index Terms:
sensor networks; security; cryptography; bilinear pairings; Tate pairing implementation
Citation:
Leonardo B. Oliveira, Diego F. Aranha, Eduardo Morais, Felipe Daguano, Julio L?pez, Ricardo Dahab, "TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes," nca, pp.318-323, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.