Distributively Increasing the Percentage of Similarities Between Strings with Applications to Key Agreement

  • Effie Makri
  • Yannis C. Stamatiou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4104)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Harney, H., Muchenhirn, C.: Group Key Management Protocol (GKMP) Specification. Internet Engineering Task Force - Network Working Group, Request for Comments No. 2093 (July 1997)Google Scholar
  8. 8.
    Kim, Y., Perrig, A., Tsudik, G.: Communication-Efficient Group Key Agreement. In: IFIP SEC 2001 (June 2001)Google Scholar
  9. 9.
    Lehane, B.: Ad Hoc Key Management, PhD Thesis, Department of Electronic and Electrical Engineering, Trinity College Dublin (2004)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Murphy, G.M.: Ordinary Differential Equations and their Solutions. D. Van Nostrand Company Inc. (1960)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. IEEE/ACM Transactions on Networking 8(1), 16–30 (2000)CrossRefGoogle Scholar
  14. 14.
    Wormald, N.C.: The differential equation method for random graph processes and greedy algorithms. Ann. Appl. Probab. 5, 1217–1235 (1995)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Effie Makri
    • 1
  • Yannis C. Stamatiou
    • 2
    • 3
  1. 1.Department of MathematicsUniversity of the AegeanKarlovasi, SamosGreece
  2. 2.Department of MathematicsUniversity of IoanninaIoanninaGreece
  3. 3.Research and Academic Computer Technology Institute, N. KazantzakiUniversity of PatrasRio, PatrasGreece

Personalised recommendations