Abstract
A central problem in distributed computing and telecommunications is the establishment of common knowledge between two computing entities. An immediate use of such common knowledge is in the initiation of a secure communication session between two entities since the two entities may use this common knowledge in order to produce a secret key for use with some symmetric cipher. The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no predetermined structure such as wireless mobile ad-hoc networks. In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before in order to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a protocol that enables two entities initially possessing a string each to securely eliminate inconsistent bit positions, obtaining strings with a larger percentage of similarities. This can help the nodes establish a shared set of bits and use it as a key with some shared key encryption scheme.
Partially supported by the IST Programme of the European Union under contact number IST-2005-15964 (AEOLUS) and the INTAS Programme under contract with Ref. No 04-77-7173 (Data Flow Systems: Algorithms and Complexity (DFS-AC)).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: Proceedings of the IEEE Symposium of Privacy and Security, May 11–14, pp. 197–213 (2003)
Chan, A.C.-F., Rogers Sr., E.S.: Distributed Symmetric Key Management for Mobile Ad hoc Networks. In: INFOCOM 2004. 23rd Annual Conference of the IEEE Computer and Communications Societies, March 7–11, vol. 4, pp. 2414–2424 (2004)
Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On The Lambert W Function. Advances in Computational Mathematics 5, 329–359 (1996)
DeCleene, B., Dondeti, L., Griffin, S., Hardhonio, T., Kiwior, D., Kurose, J., Towsley, D., Vasudevan, S., Zhang, C.: Secure Group Communication for Wireless Networks. In: Military Communications Conference (MILCOM) 2001. Network-Centric Operations: Creating the Information Force, October 28-31, vol. 1, pp. 113–117. IEEE, Los Alamitos (2001)
Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)
Eschenauer, L., Gligor, V.D.: A Key-Management Scheme for Distributed Sensor Networks. In: Proceedings of the 9th ACM Conference on Computer and Communication Security, pp. 41–47 (November 2002)
Harney, H., Muchenhirn, C.: Group Key Management Protocol (GKMP) Specification. Internet Engineering Task Force - Network Working Group, Request for Comments No. 2093 (July 1997)
Kim, Y., Perrig, A., Tsudik, G.: Communication-Efficient Group Key Agreement. In: IFIP SEC 2001 (June 2001)
Lehane, B.: Ad Hoc Key Management, PhD Thesis, Department of Electronic and Electrical Engineering, Trinity College Dublin (2004)
McGrew, D.A., Sherman, A.T.: Key Establishment in Large Dynamic Groups Using One-Way Function Trees. IEEE Transactions on Software Engineering 29(5), 444–458 (2003)
Murphy, G.M.: Ordinary Differential Equations and their Solutions. D. Van Nostrand Company Inc. (1960)
Steiner, M., Tsudik, G., Waidner, M.: CLIQUES: A New Approach to Group Key Agreement. In: Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS 1998), May 26–29, pp. 380–387 (1998)
Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. IEEE/ACM Transactions on Networking 8(1), 16–30 (2000)
Wormald, N.C.: The differential equation method for random graph processes and greedy algorithms. Ann. Appl. Probab. 5, 1217–1235 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makri, E., Stamatiou, Y.C. (2006). Distributively Increasing the Percentage of Similarities Between Strings with Applications to Key Agreement. In: Kunz, T., Ravi, S.S. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2006. Lecture Notes in Computer Science, vol 4104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814764_18
Download citation
DOI: https://doi.org/10.1007/11814764_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37246-2
Online ISBN: 978-3-540-37248-6
eBook Packages: Computer ScienceComputer Science (R0)