Achieving energy efficient and secure communication in wireless sensor networks

2006 IFIP International Conference on Wireless and Optical Communications Networks

Volumn , Issue , 2006, Pages

  Praveena, A ^a   Devasena, S ^a   Chelvan, K M Arivu ^b  

^a SRI RAMAKRISHNA ENGINEERING COLLEGE   (India)

^b SIET   (Italy)

Author keywords

Cryptography; Energy efficient; Identity based encryption; Wireless sensor networks

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DATA COMPRESSION; ELECTRIC POWER UTILIZATION; OPTIMIZATION; SECURITY OF DATA;

IDENTITY BASED ENCRYPTION (IBE); SECURE COMMUNICATION; SENSOR NODES;

WIRELESS SENSOR NETWORKS;

EID: 85088053939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/wocn.2006.1666571     Document Type: Conference Paper

References (17)

1. N. Gura, A. Patel, A. Wander, H. Eberle, and S. Shantz. Comparing elliptic curve cryptography and RSA on 8-bit cpus. In 2004 workshop on Cryptographic Hardware and Embedded Systems, Aug. 2004.
2. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. E. Culler, and K. Pister. System architecture directions for networked sensors. Architectural Support for Programming Languages and Operating Systems, pp. 93-104, 2000, http://webs.cs.berkeley.Edu/tos/papers/tos.pdf.
3. R. Watro, D. Kong, S. Cuti, C. Gardiner, C. Lynn, and P. Kruus. Tinypk: securing sensor networks with public key technology. Proceedings of the 2nd ACM workshop on Security of Ad hoc and Sensor Networks (SASN '04), pp. 59-64. ACM Press, 2004.
4. D. Coppersmith, "Fast evolution of algorithms in fields of characteristic rwo", IEEE Transactions on Information Theory, 30 (1984), 587-594.
5. W. Dillie and V.Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theory, 22 (1976), 644-654.
6. J. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32:918-924, 1978.
7. D. Shanks. A Theory of Factorization and Genera. In Proc. Symp. Pure Math., 20:415-440, 1971.
8. M. Hindry and J. Silverman. Diophantine geometry. An introduction, volume 201 of Graduate Texts in Mathematics. Springer-Verlag, 2000.
9. D. G. Cantor. On the analogue of the division polynomials for hyperelliptic curves. J. Reine Angew. Math., 447:91-145, 1994.
10. P. Gaudry. NTLJac2, Tools for genus 2 Jacobians in NTL. http://www.lix.polytechnique.frLabo/Pierrick.Gaudry/NTLJac2/.
11. A. Perrig, J. Stankovic, and D. Wagner. Security in wireless sensor networks. Commun. ACM47(6):53-57, 2004.
12. Menezes, A., Okamoto, T., and Vanstone, S. "Reducing elliptic curve logarithms to logarithms in a finite field". Proceedings of the twenty-third annual ACM symposium on Theory of computing. Annual ACM Symposium on Theory of Computing. ACM Press, 1991: p 80-89.
13. S. AlRiyami and K.G. Paterson. Certificateless public key cryptography. In Advances in Cryptology - ASIACRYPT 2003, vol. 2894 of LNCS, pp. 452-473, 2003. Full version available at http://eprint.iacr.org/.
14. D. Boneh and M. Franklin. Identity-Based encryption from theWeil pairing. SIAM Journal of Computing, 32(3):586-615, 2003. This is the full version of an extended abstract of the same title presented at Crypto'01.
15. C. Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, Proceedings of the 8th IMA International Conference on Cryptography and Coding, LNCS 2260, pages 360-363, Springer-Verlag, 2001.
16. D. Boneh and X. Boyen, Secure Identity Based Encryption Without Random Oracles, extended abstract in Proceedings of CRYPTO '04, LNCS 3152, Springer-Verlag, 2004. Full paper available in the IACR eprint archives, 〈http://eprint.iacr.org/2004/173/〉.
17. Stallings, W. Cryptography and Network Security. Prentice Hall, 2003.