Skip to main content

Evolutionary Design of Message Efficient Secrecy Amplification Protocols

  • Conference paper
Genetic Programming (EuroGP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7244))

Included in the following conference series:

Abstract

Secrecy amplification protocols are mechanisms that can significantly improve security of partially compromised wireless sensor networks (e.g., turning a half-compromised network into the 95% secure one). The main disadvantage of existing protocols is a high communication overhead increasing exponentially with network density. We devise a novel family of these protocols exhibiting only a linear increase of the communication overhead. The protocols are automatically generated by linear genetic programming (LGP) connected to a network simulator. After a deep analysis of various characteristics of this new family of protocols, with a special focus on the tuning of LGP parameters, new and better group-oriented protocols are discovered by LGP. A multi-criteria optimization is then utilized to further reduce the communication overhead down to 1/2 of the original amount while maintaining the original fraction of secure links.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, D.: Boinc: A system for public-resource computing and storage. In: Proceedings of Fifth IEEE/ACM International Workshop on Grid Computing, pp. 4–10. IEEE (2004)

    Google Scholar 

  2. Anderson, R., Chan, H., Perrig, A.: Key infection: Smart trust for smart dust. In: ICNP 2004, pp. 206–215. IEEE (2004)

    Google Scholar 

  3. Bernardi, P., Sánchez, E., Schillaci, M., Squillero, G., Reorda, M.S.: An effective technique for minimizing the cost of processor software-based diagnosis in socs. In: IEEE DATE 2006: Design, Automation and Test in Europe, pp. 412–417 (2006)

    Google Scholar 

  4. Brameier, M., Banzhaf, W.: Linear Genetic Programming. Springer, Berlin (2007)

    Google Scholar 

  5. CrossBow: Telosb, http://www.willow.co.uk/TelosB_Datasheet.pdf

  6. Cvrcek, D., Svenda, P.: Smart dust security-key infection revisited. Electronic Notes in Theoretical Computer Science 157(3), 11–25 (2006)

    Article  Google Scholar 

  7. Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor networks, pp. 41–47 (2002)

    Google Scholar 

  8. Švenda, P., Sekanina, L., Matyáš, V.: Evolutionary design of secrecy amplification protocols for wireless sensor networks. In: Proceedings of the Second ACM Conference on Wireless Network Security, pp. 225–236. ACM (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smolka, T., Švenda, P., Sekanina, L., Matyáš, V. (2012). Evolutionary Design of Message Efficient Secrecy Amplification Protocols. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds) Genetic Programming. EuroGP 2012. Lecture Notes in Computer Science, vol 7244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29139-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29139-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29138-8

  • Online ISBN: 978-3-642-29139-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics