Protocols for Supporting a Public Key Infrastructure in Ad Hoc Networks

  • Mike Burmester
  • Alec Yasinsac
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3364)

Abstract

Ad hoc networking technologies allow mobile devices to communicate by utilizing one another as communication relays. Resulting networks are highly dynamic, with nodes entering and leaving the network, for short duration membership. This absence of structure complicates planning in these networks, resulting in networks with limited functionality when their topology (their nodes and links) has highly varying and unpredictable characteristics.

We propose protocols for a Public Key Infrastructre (PKI) suitable for ad hoc networks that are based on threshold cryptography technology, adapted to general access structures.

Keywords

Ad hoc networks security access structures threshold cryptography 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bellovin, S.M., Merritt, M.: Limitations of the kerberos authentication system. Computer Communications Review (October 1990)Google Scholar
  2. 2.
    Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, FIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)Google Scholar
  3. 3.
    Boneh, D., Franklin, M.: Efficient generation of shared rsa keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 425–439. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Burmester, M., Desmedt, Y.G.: Secure communication in an unknown network using certificates. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 274–287. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)Google Scholar
  6. 6.
    Desmedt, Y.G.: Threshold cryptography. European Trans. on Telecommunications 5(4), 449–457 (1994)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Desmedt, Y.: Some recent research aspects of threshold cryptography. In: Proc. of the 1st Intl. Information Security Workshop, pp. 158–173 (1997)Google Scholar
  8. 8.
    Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications. Technical Report ISSE TR-97-01, George Mason University (July 1997)Google Scholar
  9. 9.
    Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Frankel, Y., Gemmel, P., MacKenzie, P., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: Proceedings of the 38th Symposium on Foundations of Computer Science (1997)Google Scholar
  11. 11.
    Horng, G.: A new method for constructing multiple assignment schemes for generalized secret sharing. Journal of Information Science and Engineering 17, 959–965 (2001)MathSciNetGoogle Scholar
  12. 12.
    Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proceedings of IEEE Globecom 1987, pp. 99–102 (1987)Google Scholar
  13. 13.
    Khalili, A., Katz, J., Arbaugh, W.A.: Toward secure key distribution in truly ad-hoc networks. In: IEEE Workshop on Security and Assurance in Ad hoc Networks, in conjunction with the 2003 International Symposium on Applications and the Internet, Orlando, FL, January 28 (2003)Google Scholar
  14. 14.
    National Bureau of Standards (NBS). Data Encryption Standard. Federal Information Processing Standard, Publication 46, NBS, Washington, D.C. (January 1977)Google Scholar
  15. 15.
    Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Communications of the ACM 21(12), 993–999 (1978)MATHCrossRefGoogle Scholar
  16. 16.
    Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal 28, 656–715 (1949)MATHMathSciNetGoogle Scholar
  19. 19.
    Yasinsac, A.: Rates of Change in Ad Hoc Networks. In: The Proceedings of the Information Resources Management Association International Conference (IRMA 2003), Philadelphia, PA, May 18–21 (2003) (to appear)Google Scholar
  20. 20.
    Yasinsac, A., Davis, J.A.: Modeling protocols for secure group communications in ad hoc networks. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2002. LNCS, vol. 2845, pp. 189–202. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  21. 21.
    Zimmermann, P.: The Official PGP User’s Guide. MIT Press, Cambridge (1995) (second printing)Google Scholar
  22. 22.
    Zhou, L., Haas, Z.J.: Securing ad hoc networks. IEEE Network Magazine 13(6), 24–30 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mike Burmester
    • 1
  • Alec Yasinsac
    • 1
  1. 1.Department of Computer ScienceFlorida State UniversityTallahasseeU.S.A.

Personalised recommendations