research-article

Spraying Techniques for Securing Key Exchange in Large Ad-hoc Networks

Authors:

Alan StulmanAuthors Info & Claims

Q2SWinet '15: Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks

Pages 29 - 34

https://doi.org/10.1145/2815317.2815324

Published: 02 November 2015 Publication History

Abstract

Massive ad-hoc mobile networks with fluctuating topologies, as is expected for the Internet of Things (IoT), vehicular networks (VANETs), and others, allow for new solutions for the initial key exchange problem. Spraying data on multiple paths is a novel algorithm for confidential key exchange over public, insecure mobile ad-hoc network. It assumes neither prior knowledge nor a trusted third party. It is based on the inherent fluctuating topology of such networks. By spraying the key exchange packets over multiple fluctuating paths, an adversary's ability of attacking a communication link is greatly diminished; thus, active attackers are turned passive. In this paper, two spraying techniques are compared using multiple simulations on random network topologies. The results show that for small networks one technique surpasses the other, but as the network grows - as is expected in IoT, smart cities, VANETs, etc. - this advantage is diminished.

References

[1]

The serval project. {Online}. Available: http://www.servalproject.org/. (Access date: 24 August, 2015).

[2]

Rockwell Automation. Arena simulation software. {Online}. Available: https://www.arenasimulation.com. (Access date: 21 August, 2015).

[3]

Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644--654, 1976.

Digital Library

[4]

Whitfield Diffie, Paul C. Van Oorschot, and Michael J. Wiener. Authentication and authenticated key exchanges. Des. Codes Cryptography, 2(2):107--125, June 1992. {Online}. Available: http://dx.doi.org/10.1007/BF00124891. (Access Date: 21 August, 2015).

Digital Library

[5]

E. W. Dijkstra. A note on two problems in connexion with graphs. NUMERISCHE MATHEMATIK, 1(1):269--271, 1959.

Digital Library

[6]

William Feller. An Introduction to Probability Theory and Its Applications, volume 1. Wiley, 2 edition, January 1968.

[7]

Pierre L'Ecuyer. Combined multiple recursive random number generators. Operations Research, 44(5):816--822, 1996.

Digital Library

[8]

Pierre L'ecuyer. Good parameters and implementations for combined multiple recursive random number generators. Operations Research, 47(1):159--164, 1999.

Digital Library

[9]

Pierre L'Ecuyer. Software for uniform random number generation: Distinguishing the good and the bad. In Simulation Conference, 2001. Proceedings of the Winter, volume 1, pages 95--105. IEEE, 2001.

Digital Library

[10]

Wenjing Lou. Spread: Enhancing data confidentiality in mobile ad hoc networks. In Proceedings IEEE INFOCOM, pages 2404--2413, 2004.

[11]

Makoto Matsumoto and Takuji Nishimura. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul., 8(1):3--30, January 1998.

Digital Library

[12]

J. Moy. OSPF Version 2. RFC 2328 (Standard), April 1998. Updated by RFC 5709.

[13]

B. O'Higgins, W. Diffie, L. Strawczynski, and R. de Hoog. Encryption and isdn - a natural fit. In Proc. ISS'87, pages 863--869, Pheonix, March 15--20 1987.

[14]

E. Rescorla. Diffie-Hellman Key Agreement Method. RFC 2631 (Proposed Standard), June 1999. {Online}. Available: http://www.ietf.org/rfc/rfc2631.txt. (Access date: 21 August, 2015).

Digital Library

[15]

Bruce Schneier. Applied cryptography: protocols, algorithms, and source code in C. john wiley & sons, 2007.

Digital Library

[16]

Adi Shamir. How to share a secret. Commun. ACM, 22(11):612--613, November 1979.

Digital Library

[17]

GJ Simmons. An introduction to shared secret and/or shared control schemes and their application, 1992.

[18]

Ariel Stulman, Jonathan Lahav, and Avraham Shmueli. Manet secure key exchange using spraying diffie-hellman algorithm. In Nick Savage, Safwan El Assad, and Charles A. Shoniregun, editors, ICITST, pages 249--252. IEEE, 2012.

[19]

Ariel Stulman, Jonathan Lahav, and Avraham Shmueli. Spraying diffie-hellman for secure key exchange in manets. In Bruce Christianson, James A. Malcolm, Frank Stajano, Jonathan Anderson, and Joseph Bonneau, editors, Security Protocols Workshop, volume 8263 of Lecture Notes in Computer Science, pages 202--212. Springer, 2013.

[20]

P. Zimmermann, A. Johnston, and J. Callas. ZRTP: Media Path Key Agreement for Unicast Secure RTP. RFC 6189 (Proposed Standard), April 2011. {Online}. Available: http://www.ietf.org/rfc/rfc6189.txt. (Access date: 21 August, 2015).

Cited By

Ritika Kumari SManwal MSingh SKumari S(2023)An Investigation into the Performance of DHKE Algorithm over Different Network Topologies in Cryptography Networks2023 3rd International Conference on Technological Advancements in Computational Sciences (ICTACS)10.1109/ICTACS59847.2023.10390219(755-762)Online publication date: 1-Nov-2023
https://doi.org/10.1109/ICTACS59847.2023.10390219
Fuchs AStulman AGurtov A(2021)IoT and HIP's Opportunistic ModeIEEE Transactions on Mobile Computing10.1109/TMC.2020.296704420:4(1434-1448)Online publication date: 1-Apr-2021
https://doi.org/10.1109/TMC.2020.2967044
Stulman AStulman A(2019)Secured by Fluctuating Topology Using the Fluctuating Topology of MANETs to Secure Key ExchangeElectronics10.3390/electronics81011728:10(1172)Online publication date: 16-Oct-2019
https://doi.org/10.3390/electronics8101172
Show More Cited By

Index Terms

Spraying Techniques for Securing Key Exchange in Large Ad-hoc Networks
1. Security and privacy
  1. Network security

Recommendations

Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security
AODV compatible routing with extensive use of cache information in ad-hoc networks
SAC '02: Proceedings of the 2002 ACM symposium on Applied computing

Recently, there has been an increasing interest in ad-hoc networks, which are dynamically constructed by collections of mobile hosts without using any existing network infrastructure or centralized administration. Each mobile host plays a role of a ...
Methods for Securing Routing Protocols in Ad-Hoc Networks
SYNASC '12: Proceedings of the 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

The ad-hoc networks are wireless networks formed spontaneously between certain devices (computers, sensors, mobile phones and others) with limited resources (battery, memory, processing power) that doesn't have a central routing device (router) and so ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Q2SWinet '15: Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks

November 2015

184 pages

ISBN:9781450337571

DOI:10.1145/2815317

General Chair:
Peter Mueller
IBM Zurich Research Laboratory, Switzerland
,
Program Chairs:
Luca Foschini
University of Bologna, Italy
,
Richard Yu
Carleton University, Ottawa -- Canada
,
Graciela Román Alonso
Universidad Autónoma Metropolitana, Mexico

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MSWiM'15

Sponsor:

SIGSIM

MSWiM'15: 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 2 - 6, 2015

Cancun, Mexico

Acceptance Rates

Overall Acceptance Rate 46 of 131 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
105
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ritika Kumari SManwal MSingh SKumari S(2023)An Investigation into the Performance of DHKE Algorithm over Different Network Topologies in Cryptography Networks2023 3rd International Conference on Technological Advancements in Computational Sciences (ICTACS)10.1109/ICTACS59847.2023.10390219(755-762)Online publication date: 1-Nov-2023
https://doi.org/10.1109/ICTACS59847.2023.10390219
Fuchs AStulman AGurtov A(2021)IoT and HIP's Opportunistic ModeIEEE Transactions on Mobile Computing10.1109/TMC.2020.296704420:4(1434-1448)Online publication date: 1-Apr-2021
https://doi.org/10.1109/TMC.2020.2967044
Stulman AStulman A(2019)Secured by Fluctuating Topology Using the Fluctuating Topology of MANETs to Secure Key ExchangeElectronics10.3390/electronics81011728:10(1172)Online publication date: 16-Oct-2019
https://doi.org/10.3390/electronics8101172
Krokosz TRykowski J(2019)Verification of IoT Devices by Means of a Shared SecretInformation Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 201910.1007/978-3-030-30440-9_17(175-186)Online publication date: 5-Sep-2019
https://doi.org/10.1007/978-3-030-30440-9_17
Fuchs AStulman AGurtov ALoureiro AWu HYu R(2017)Hardening Opportunistic HIPProceedings of the 20th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems10.1145/3127540.3127571(123-127)Online publication date: 21-Nov-2017
https://dl.acm.org/doi/10.1145/3127540.3127571

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten