Skip to main content

SKEMON: A Simple Certificate-Less Method for Key Exchange by Using Mobile Network

  • Conference paper
  • 767 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4658))

Abstract

Secure communications requires the exchange of keying material, which in general is not trivial problem. A simple solution is to use alternative communication channels to exchange the cryptographic keys, like standard mail services or reciprocal visual inspection of text strings. Here, we propose to use the standard Public Mobile Network (PMN) as an alternative channel, because the use of mobile phones has become pervasive and affordable for most of users. The basic assumption is that the PMN is more secure than other wireless and wired networks. We envision a system for subscribers who wish to exchange their cryptographic keys, which can be used afterwards for sending encrypted messages over other (insecure) communication channels, like Internet. We assume that every user or its mobile phone is able 1) to generate a public/private key pair, and 2) to store it inside his/her mobile phone rubric. The public key is exchanged by sending special requests by means of standard PMN services, like the text messaging system. We analyze the scalability of such a system, by assuming that the subscribers can send group queries, i.e. queries which request the whole (public) keys stored in the rubrics of a subset of the closest neighbors of an user. The performance of such an approach depends on the properties of the graph model of interactions among people. By means of simulations, we show that it is preferable to send few group queries instead of many single requests. This result can be used to dimension the service provided by the PMN.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.insecure.org

  2. Bollobás, B.: Random Graphs. Number 73 in Cambridge Studies in Advanced Mathematics. Cambridge

    Google Scholar 

  3. Boneh, D., Boyen, X.: Secure identity-based encryption without random oracles. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 443–459. Springer, Heidelberg (2004)

    Google Scholar 

  4. Boneh, D., Franklin, M.: Identity based encryption from the weil pairin. SIAM Journal of Computing 32(3), 586–615 (2003)

    Article  MATH  Google Scholar 

  5. Callas, J., Donnerhacke, L., Finney, H., Thayer, R.: RFC 2440 OpenPGP message format, November

    Google Scholar 

  6. Dierks, T., Allen, C.: RFC 2246: The tls protocol (January 1999)

    Google Scholar 

  7. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Advances in Physics 51, 1079 (2002)

    Article  Google Scholar 

  8. Gleeson, B., Lin, A., Heinanen, J., Armitage, G., Mlis, A.: RFC 2764  A Framework for IP Based Virtual Private Networks (February 2000)

    Google Scholar 

  9. Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 466–481. Springer, Heidelberg (2002)

    Google Scholar 

  10. Kent, S., Atkinson, R.: RFC 2401, Security Architecture for the Internet Protocol (November 1998)

    Google Scholar 

  11. Menezes, A., van Oorshot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1997)

    Google Scholar 

  12. Stamp, M.: Information Security, Principles and Practice. Wiley, Chichester (2006)

    Google Scholar 

  13. C̆agalj, M.,C̆apkun, S., Hubaux, J.-P.: Key agreement in peer-to-peer wireless networks. IEEE Proceedings 94(2) 467–478 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tomoya Enokido Leonard Barolli Makoto Takizawa

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakamoto, C., De Marco, G., Yaegashi, R., Tadauchi, M., Barolli, L. (2007). SKEMON: A Simple Certificate-Less Method for Key Exchange by Using Mobile Network. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74573-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74572-3

  • Online ISBN: 978-3-540-74573-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics