Elliptic curve and password based dynamic key agreement in wireless ad-hoc networks

Proceedings of the Third IASTED International Conference on Communication, Network, and Information Security, CNIS 2006

Volumn , Issue , 2006, Pages 50-60

  Askoxylakis, Ioannis G ^a   Kastanis, Diomedes D ^a   Traganitis, Apostolos P ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

Disaster management; Elliptic curves; MANET security

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DATA INTERCHANGE; INTERCONNECTION NETWORKS; INTRUSION DETECTION; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK SECURITY;

DISASTER MANAGEMENT; ELLIPTIC CURVES; MANET SECURITY; MOBILE HOST INTERCONNECTION;

AD HOC NETWORKS;

EID: 38049127352     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Arvind Narayanan, Vitaly Shmatikov, Fast dictionary attacks on passwords using time-space trade-off Conference on Computer and Communications Security, Proceedings of the 12th ACM conference on Computer and communications security, Alexandria VA USA, 2005
2. Steven M. Bellovin and Michael Merrit, Encrypted key exchange: Password based protocols secure against dictionary attacks, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland USA May 1992.
3. N. Asokan, P Ginzboorg, Key agreement in ad hoc networks In Computer Communications, 23: 1627-1637, 2000
4. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 644-654 1976.
5. F. Cucker and S. Smale. Complexity estimates depending on condition and round off error. Journal of the Association for Computing Machinery, 46(1): 113-184, 2000.
6. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, volume 4 8, pages 203-209, 1987.
7. R. Rivest, A. Shamir, and L. M. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21, 2, 120-126, Feb 1978.
8. A. Menezes, T. Okamoto and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory 39 1639-1646 1993.
9. A. Menezes, E. Teske, and A. Weng. Weak Fields for ECC In T. Okamoto, editor, Topics in Cryptology CTRSA 2004, volume LNCS 2964, pages 366{386. Springer, 2004.
10. D. Johnson and S. Vanstone, The elliptic curve digital signature algorithm (ECDSA) (with D. Johnson and S. Vanstone) International Journal on Information Security, 1 (2001), 36-63
11. A. A. Kalele, V. R. Sule, Weak keys of pairing based Diffie Hellman schemes on elliptic curves, Cryptology ePrint Archive 2005/30, 2005
12. Dong Zheng, Kefei Chen, Jinyuan You, Multiparty authentication services and key agreement protocols with semi-trusted third party, Journal of Computer Science and Technology archive, Volume 17, Issue 6 (November 2002) table of contents Pages: 749-756, 2002
13. Giuseppe Ateniese, Michael Steiner, and Gene Tsudik, New Multiparty Authentication Services and Key Agreement Protocols, IEEE Journal of Selected Areas in Communications, VOL 18, NO. 4, April 2000
14. Claus Becker and Uta Wille, Communication complexity of group key distribution, in 5th ACM Conference on Computer and Communications Security, San Francisco, California, Nov. 1998.
15. Daniel Brown Conjectured Security of the ANSINIST Elliptic Curve RNG, CACR 2006-11, 2006