Skip to main content
SpringerLink
Log in

Random Bit Extraction for Secret Key Generation in MANETs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Mobile ad hoc networks are a group of random mobile nodes which does not have a pre-existing base stations or infrastructure. In order to make communications effective over these networks a security scheme is essential. This can be achieved by establishing some shared random bits generated with fundamental secret key generation techniques. This paper presents a secret key generation scheme suitable for networks adapted to dynamic source routing protocol. Investigations were carried out for the possibility of using a system metadata like routing information for randomness extraction. Using routing tables maintained by the nodes as backbone, we are extracting a set of common secret random data for key generation. The secret key generation starts with random source extraction followed by information reconciliation to reduce errors and privacy amplification to increase the confidentiality. The main advantage of this technique is that it utilizes the sources of randomness inherent in the system itself without increasing the computational complexity. It also helps to identify the presence of an adversary in the network. The results of the system are evaluated to analyze the efficiency of the technique in terms of packet loss and packet overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Divecha, B., Abraham, A., Grosan, C., & Sanyal, S. (2007). Impact of node mobility on MANET routing protocols models. JDIM, 5(1), 19–23.

    Google Scholar 

  2. Capkun, S., Buttyán, L., & Hubaux, J.-P. (2003). Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing, 2(1), 52–64.

    Article  Google Scholar 

  3. Shaltiel, R. (2011). An introduction to randomness extractors. In J. Sgall (Ed.), International colloquium on automata, languages, and programming (pp. 21–41). Berlin: Springer.

    Chapter  Google Scholar 

  4. Park, S. K., & Miller, K. W. (1988). Random number generators: good ones are hard to find. Communications of the ACM, 31(10), 1192–1201.

    Article  MathSciNet  Google Scholar 

  5. Renner, R., & Wolf, S. (2005). Simple and tight bounds for information reconciliation and privacy amplification. In International conference on the theory and application of cryptology and information security (pp. 199–216). Berlin: Springer.

  6. Maurer, U. M. (1993). Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3), 733–742.

    Article  MathSciNet  MATH  Google Scholar 

  7. Khalili-Shoja, M. R., Amariucai, G. T., Wei, S., & Deng, J. (2016). Secret common randomness from routing metadata in ad hoc networks. IEEE Transactions on Information Forensics and Security, 11(8), 1674–1684.

    Article  Google Scholar 

  8. Wu, B., Jie, W., Fernandez, E. B., Ilyas, M., & Magliveras, S. (2007). Secure and efficient key management in mobile ad hoc networks. Journal of Network and Computer Applications, 30(3), 937–954.

    Article  Google Scholar 

  9. Yi, S., & Kravets, R. (2004). Composite key management for ad hoc networks. MobiQuitous, 4, 52–61.

    Google Scholar 

  10. Johnson, D. B., Maltz, D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. Ad Hoc Networking, 5, 139–172.

    Google Scholar 

  11. Shoja, M. R. K., Amariucai, G. T., Wei, S., & Deng, J. (2001). KERMAN: A key establishment algorithm based on harvesting randomness in MANETs. arXiv preprint arXiv:1504.03744.

  12. Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010). Information-theoretically secret key generation for fading wireless channels. IEEE Transactions on Information Forensics and Security, 5(2), 240–254.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Noorul Islam Centre for Higher Education, Kumaracoil, Tamilnadu, India

    K. R. Shibu & R. Suji Pramila

Authors
  1. K. R. Shibu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Suji Pramila
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. R. Shibu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shibu, K.R., Suji Pramila, R. Random Bit Extraction for Secret Key Generation in MANETs. Wireless Pers Commun 107, 2247–2261 (2019). https://doi.org/10.1007/s11277-019-06381-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06381-3

Keywords

Search

Navigation