Skip to main content

A Functional Relationship Based Attestation Scheme for Detecting Compromised Nodes in Large IoT Networks

  • Conference paper
  • First Online:
Advances in Computer Science and Ubiquitous Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 373))

Abstract

Despite memory traverse is commonly used for attestation, this approach could not feasibly work for an IoT network that requires scalable and sustainable operations. To overcome this limitation, we propose a functional relationship based attestation scheme, which verifies the integrity of battery-powered devices by analyzing the consistency among neighbors, where a consistent edge between two nodes is given if outputs of the same functions at both nodes are equal to each other. Efficiency of the proposed method is demonstrated in terms of attestation termination and detection speed.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Atzori, L., Iera, A., Morabito, G.: The Internet of Things: A survey. Computer Networks 54, 2787–2805 (2010). doi:10.1016/j.comnet.2010.05.010

    Article  MATH  Google Scholar 

  2. Gubbi, J., Buyya, R., Marusic, S., Palaniswami, M.: Internet of Things (IoT): A vision, architectural elements, and future directions. Future Generation Computer Systems 29, 1645–1660 (2013)

    Article  Google Scholar 

  3. Loscocco, P.A., Wilson, P.W., Pendergrass, J.A., McDonell, C.D.: Linux kernel integrity measurement using contextual inspection. In: Proceedings of the 2nd ACM Workshop on Scalable Trusted Computing (STC 2007), pp. 21–29. ACM (2007)

    Google Scholar 

  4. Petroni Jr., N.L., Hicks, M.: Automated detection of persistent kernel control-flow attacks. In: CCS 2007: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 103–115. ACM (2007)

    Google Scholar 

  5. Jaeger, T., Sailer, R., Shankar, U.: PRIMA: policy-reduced integrity measurement architecture. In: Proceeding of the Eleventh ACM Symposium on Access Control Models and Technologies, pp. 19–28 (2006)

    Google Scholar 

  6. R. Macdonald, S. Smith, J. Marchesini, and O. Wild. Bear: An open-source virtual secure coprocessor based on TCPA. Technical Report TR2003-471, Department of Computer Science, Dartmouth College, 2003

    Google Scholar 

  7. Trusted Computing Group (TCG). TPM Main Specifications. Version 1.2 rev 116, March 1, 2011. http://www.trustedcomputinggroup.org/resources/tpm_main_specification

  8. Sailer, R., Zhang, X., Jaeger, T., van Doorn, L.: Design and implementation of a tcg-based integrity measurement architecture. In: Proceedings of the 13th USENIX Security Symposium, August 9–13, 2004, San Diego, CA, USA, pp. 223–238 (2004)

    Google Scholar 

  9. Ganesh, A.J., Kermarrec, A.M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52(2), 139–149 (2003)

    Article  Google Scholar 

  10. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences, vol. 8 (2000)

    Google Scholar 

  11. Erdős, P., Rényi, A.: On Random Graphs. Publicationes Mathematicae 6, 290–297 (1959)

    Google Scholar 

  12. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973). doi:10.1145/362342.362367

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong-Hyuk Moon .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media Singapore

About this paper

Cite this paper

Moon, YH., Jeon, YS., Youn, CH. (2015). A Functional Relationship Based Attestation Scheme for Detecting Compromised Nodes in Large IoT Networks. In: Park, DS., Chao, HC., Jeong, YS., Park, J. (eds) Advances in Computer Science and Ubiquitous Computing. Lecture Notes in Electrical Engineering, vol 373. Springer, Singapore. https://doi.org/10.1007/978-981-10-0281-6_101

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0281-6_101

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0280-9

  • Online ISBN: 978-981-10-0281-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics