ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 51, Issue 18, 19 December 2007, Pages 4938-4950
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (291 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2007.08.002    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Cryptographic techniques for mobile ad-hoc networks

Vanesa Dazaa, E-mail The Corresponding Author, Javier Herranzb, E-mail The Corresponding Author, Paz Morilloc, Corresponding Author Contact Information, E-mail The Corresponding Author and Carla Ràfolsc, E-mail The Corresponding Author

aDept. d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili (URV), Av. Països Catalans, 26, 43007 Tarragona, Spain bIIIA, Artificial Intelligence Research Institute; CSIC, Spanish National Research Council Campus UAB s/n, 08193 Bellaterra, Spain cDept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya (UPC), C/Jordi Girona, 1-3, Campus Nord, Mòdul C-3, 08034 Barcelona, Spain

Received 15 January 2007; 
revised 11 June 2007; 
accepted 16 August 2007. 
Responsible Editor: X.S. Shen. 
Available online 26 August 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New nodes can join the network and are able to obtain the same capabilities as initial nodes; further, each node can obtain a pair of secret/public keys to secure and authenticate its communication. Two additional features of our system are that it allows to implement threshold operations (signature or decryption) involving subgroups of nodes in the network and that any subgroup with a small number of nodes (between 2 and 6) can obtain a common secret key without any communication after the set up phase.

Keywords: Mobile ad-hoc networks; Secret sharing techniques; Identity-based cryptography; Threshold cryptography

Article Outline

1. Introduction
1.1. Our contribution
1.2. Related work
1.3. Organization
2. Preliminaries
2.1. Secret sharing schemes
2.2. Identity-based cryptography from bilinear pairings
2.2.1. Baek and Zheng’s threshold identity-based decryption scheme
2.2.1.1. Setup
2.2.1.2. Key generation
2.2.1.3. Encryption
2.2.1.4. Threshold decryption
3. Our proposal
3.1. Initialization phase
3.1.1. Commitments and verifiability
3.1.2. Efficiency
3.2. Node aggregation
3.2.1. Efficiency
3.3. Obtention of individual secret keys
3.3.1. PKI scenarios
3.3.2. Identity-based scenarios
3.3.3. Efficiency
3.4. Threshold operations involving subgroups
3.4.1. Decreasing the threshold t
3.4.2. Efficiency
4. Security and extensions
4.1. Security discussion
4.2. Proactive security
4.3. Key agreement
5. Conclusion
Acknowledgements
References
Vitae

Computer Networks
Volume 51, Issue 18, 19 December 2007, Pages 4938-4950
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.