An Efficient Secure Scheme Based on Hierarchical Topology in the Smart Home Environment
Abstract
:1. Introduction
2. Related Works
2.1. Infrastructure of a Smart Home
2.2. Features of Smart Home
2.2.1. Topology for ESNs in smart homes
2.2.2. Security
2.2.3. Different sensor performances
2.2.4. Low resource
2.3. Previous Studies on Smart Homes
3. Proposed Infrastructure
3.1. Proposed Sensor Network Topology of a Smart Home
3.2. Proposed Protocols
3.2.1. Provisioning Phase
- Step 1.
- Sensori sends their IDi to SP.
- Step 2.
- SP confirms ID received from Sensori and generates n challenge values to create PUFi DB in the Sensori and sends them to Sensori.
- Step 3.
- Sensori received Challenge C1…n from SP and computes Response R1…n in correspondence with C1…n by using the PUFi chip that it owns and sends them to SP.
- Step 4.
- SP received with Response R1…n from Sensori maps C1…n and Response R1…n in 1:1 and stores them in the PUFi DB for a challenge-response with Sensori in the future.
3.2.2. Authentication and Key Agreement Phases
- Step 1.
- HS generates a random number Nhs and sends it to SP with its identifier IDhs.
- Step 2.
- SP received with Nhs and IDhs from HS generates the random number Nsp and selects Challenge C from the PUF’hs DB that is relevant to IDhs. In addition, it computes the Response R’ value corresponding to Challenge C from PUF’hs(C) and hashes (R’||Nhs) to create session key SK’hs−sp = h(R’||Nhs). Then, SP connects the Nhs received from HS and Nsp to compute Vsp−hs = ESK’hs−sp(Nhs||Nsp) the value that is encrypted with SK’hs−sp and sends SK’hs−sp to Hs.
- Step 3.
- HS received with C, Nsp, Vsp−hs from SP computes PUFhs(C) and the R value and connects R and Nhs to hash them and create the session key, SKhs-sp = h(R’||Nhs). If the Vsp−hs received from HS is identical with the encrypted value with SKhs−sp in connection with Nsp and Nhs, HS authenticates SP. In addition, the verification value, Vhs−sp = DSKhs−sp(C), is calculated by encrypting the C received from SP with SKhs−sp and is sent to SP.
- Step 4.
- SP received with Vhs−sp from HS encrypts C with SK’hs−sp, and if ESK’hs−sp(C) is consistent with Vhs−sp, HS is authenticated. In addition, the used Challenge C and Response R’ values are removed from the PUF’hs DB.
- Step 1.
- MSj generates a random number Nmsj and sends it to HS with its identifier IDmsj.
- Step 2.
- HS received with Nmsj from MSj generates a random number Nhs and sends IDhs, IDmsj, Nhs, and Nmsj to SP.
- Step 3.
- SP received with IDhs, IDmsj, Nhs, and Nmsj from HS generates a random number Nsp and selects Challenge C from the PUF’msj DB. In addition, R’ is computed from PUF’msj(C), which creates the session key SK’msj−sp from h(R’||Nmsj). In addition, (Nmsj||Nhs||Nsp) is encrypted with session key SK’msj−sp and sends Msp-msj = ESK’msj−sp(Nmsj||Nhs||Nsp) with C to HS.
- Step 4.
- HS received with Msp−msj from SP sends C, Msp−msj, and Nhs to MSj.
- Step 5.
- MSj received with C, Msp−msj, Nhs from HS computes R = PUFmsj(C) and creates session key SKmsj-sp = h(R||Nmsj). Nmsj, Nhs, and Nsp are acquired after decrypting Msp−msj with session key SKmsj−sp, and if Nhs, which is received in plain text, is identical with Nhs acquired through decryption, HS and SP are authenticated. In addition, Vmsj−sp = ESKmsj−sp(C||Nsp) is created by encrypting (C||Nsp) with the session key SKmsj−sp and sends Vmsj−sp to SP through HS.
- Step 6.
- SP received with Vmsj−sp from MSj through HS encrypts (C||Nsp) with the session key SK’msj−sp. If ESK'msj−sp(C||Nsp) is consistent with Vmsj−sp, MSj is authenticated. In addition, (IDmsj||Nhs||Nsp) is encrypted with the session key, SK’hs−sp and sends Mhs−sp = ESK’hs−sp(IDmsj||Nhs) to HS. The used Challenge C and Response R’ are removed from PUF’msj DB.
- Step 7.
- HS received with Mhs−sp from SP decrypts Mhs−sp with session key SKhs−sp, and acquires IDmsj, Nhs, and Nsp and authenticates MSj. In addition, Nsp acquired by decrypting the Mhs−sp is hashed, which creates the session key SK’msj−hs = h(Nsp). Nmsj is encrypted with the session key SK’msj−hs, while creating Vmsj−hs = ESK’msj−hs(Nhs). The created Vmsj-sp is sent to MSj.
- Step 8.
- MSj received with Vmsj−sp from HS hashes Nsp and creates the session key, SKmsj−hs and encrypts Nhs with the session key SKmsj−hs to see if it is consistent with Vmsj−hs.
- Step 1.
- LSk generates the random number Nlsk and sends IDlsk, and Nlsk to MSj.
- Step 2.
- MSj received with IDlsk, Nlsk from LSk generates the random number Nmsj and sends IDlsk, IDmsj, Nlsk, and Nmsj to HS.
- Step 3.
- HS received with IDlsk, IDmsj, Nlsk, and Nmsj from MSj generates the random number Nhs, and sends IDhs, IDmsj, IDhs, Nhs, Nmsj, and Nhs to SP.
- Step 4.
- SP received with IDhs, IDmsj, IDhs, Nhs, Nmsj, and Nhs from HS generates the random numbers Nsp1, Nsp2. In addition, it selects Challenge C from the PUF’lsk DB by computing R’ = PUF’lsk(C) and producing the session key SK’lsk−sp = h(R’||Nlsk). In addition, (Nlsk||Nmsj||Nhs||Nsp1||Nsp2) is encrypted with session key SK’lsk−sp and sends C and Vsp−lsk to HS.
- Step 5.
- HS received with C, Vsp−lsk from SP sends C, Vsp−lsk, and Nhs to MSj.
- Step 6.
- MSj received with C, Vsp−lsk, Nhs from HS sends C, Vsp−lsk, Nhs, and Nmsj to LSk.
- Step 7.
- LSk received with C, Vsp−lsk, Nhs, and Nmsj from MSj hashes R and Nlsk acquired by computing R = PUFlsk(C) and creates the session key SKlsk−sp = h(R||Nlsk). In addition, Msp1 is decrypted by SKlsk−sp while acquiring Nlsk, Nmsj, Nhs, Nsp1, and Nsp2. If Nhs and Nmsj acquired by decrypting Nhs, Nmsj and Msp1 are identical, MS, HS, and SP are authenticated. (C||Nsp1||Nsp2) is encrypted with the session key SKlsk-sp, which creates the Vlsk-sp=ESKmsj−sp(C||Nsp1||Nsp2) and sends Vlsk−sp to SP through MSj and HS.
- Step 8.
- SP received with Vlsk−sp through MSj and HS from LSk encrypts (C||Nsp1||Nsp2) with SK’lsk−sp and authenticates LSk if ESK‘lsk−sp(C||Nsp1||Nsp2) and Vlsk−sp are identical. In addition, (IDlsk||Nmsj||Nsp1) is encrypted with the session key SK’hs−sp, creating Msp1 = ESK’msj−sp(IDlsk||Nmsj||Nsp1), and (Msp1||IDlsk||Nhs||Nsp2) is encrypted with the session key SK’hs−sp creating Msp2 = ESK’hs−sp(Msp1||IDlsk||Nhs||Nsp2) and sending Msp2 to HS. The used Challenge C and Response R’ are removed from the PUF’msj DB.
- Step 9.
- HS received with Msp2 from SP decrypts Msp2 with the session key, SKhs−sp, and acquires Msp1, IDlsk, Nhs, and Nsp2 and authenticates LSk. In addition, Nsp2 is hashed creating SK’lsk−hs = h(Nsp2) and encrypting the Nhs with session key SK’lsk−hs, while creating Vlsk-hs=ESK’lsk−hs(Nhs). Msp1, Vlsk−hs are received by MSj.
- Step 10.
- MSj received with Msp1, Vlsk−hs from HS decrypts Msp1 with the session key SKmsj−sp, and acquires IDlsk, Nmsj, and Nsp1 and authenticates LSk. In addition, Nsp1 is hashed, which creates the session key SK’lsk−msj = h(Nsp1), encrypts Nmsj with the session key SK’lsk−msj, and creates Vlsk−msj = ESK’lsk−hs(Nmsj). Vlsk−msj and Vlsk−hs are received by MSj.
- Step 11.
- LSk received with Vlsk−msj, Vlsk−hs from MSj hashes Nsp1 creating the session key SKlsk−msj = h(Nsp1), encrypts Nmsj with the session key SKlsk−msj, and encrypts Nhs with the session key SKlsk−hs to see if it is identical with Vlsk−hs.
4. Security and Performance Analysis
4.1. Security Analysis
4.1.1. Performance Analysis
4.1.2. Security Analysis
4.2. Computing Resource Analysis
4.3. Storage Resource Analysis
5. Conclusions
Author Contributions
Conflicts of Interest
References
- Whitmore, A.; Anurag, A.; Li, D.X. The Internet of Things? A survey of topics and trends. Inf. Syst. Front. 2015, 17, 261–274. [Google Scholar] [CrossRef]
- Mainetti, L.; Patrono, L.; Vilei, A. Evolution of wireless sensor networks towards the internet of things: A survey. In Proceedings of the 2011 19th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Split, Croatia, 15–17 September 2011. [Google Scholar]
- Kun, P. A secure network for mobile wireless service. J. Inf. Process. Syst. 2013, 9, 247–258. [Google Scholar]
- Bayram, I.S.; Papapanagiotou, I. A survey on communication technologies and requirements for internet of electric vehicles. EURASIP J. Wirel. Commun. Netw. 2014, 2014, 1–18. [Google Scholar] [CrossRef]
- Hashizume, K.; Rosado, D.G.; Fernández-Medina, E.; Fernandez, E.B. An analysis of security issues for cloud computing. J. Internet Serv. Appl. 2013, 4, 5. [Google Scholar] [CrossRef]
- Ablondi, W. 2014 Smart Home Systems and Services Forecast Global Total; Strategy Analytics: Boston, MA, USA, 2014. [Google Scholar]
- Zhang, F.; Xu, Y.; Chou, J. A novel petri nets-based modeling method for the interaction between the sensor and the geographic environment in emerging sensor networks. Sensors 2016, 16, 1571. [Google Scholar] [CrossRef] [PubMed]
- Bays, L.R.; Oliveira, R.R.; Barcellos, M.P.; Gaspary, L.P.; Madeira, E.R.M. Virtual network security: Threats, countermeasures, and challenges. J. Internet Serv. Appl. 2015, 6, 1. [Google Scholar] [CrossRef]
- Joo, J.W.; Lee, J.K.; Park, J.H. Security considerations for a connected car. J. Converg. 2015, 6, 1–9. [Google Scholar]
- Ahn, H.; Kim, H.; Park, J.R. Smart monitoring of indoor asbestos based on the distinct optical properties of asbestos from particulate matters. J. Converg. 2014, 5, 22–25. [Google Scholar]
- Li, D.X.; He, W.; Li, S. Internet of things in industries: A survey. IEEE Trans. Ind. Inform. 2014, 10, 2233–2243. [Google Scholar]
- Hewlett Packard Enterprise. How Safe Are Home Security Systems? An HPE Study on IoT Security; HPE: Palo Alto, CA, USA, 2015. [Google Scholar]
- Kang, J.; Han, J.; Park, J.H. Design of IP camera access control protocol by utilizing hierarchical group key. Symmetry 2015, 7, 1567–1586. [Google Scholar] [CrossRef]
- Im, H.; Kang, J.; Park, J.H. Certificateless based public key infrastructure using a DNSSEC. J. Converg. 2015, 6, 26–33. [Google Scholar]
- Kang, J.; Kim, M.; Park, J.H. A reliable TTP-based infrastructure with low sensor resource consumption for the smart home multi-platform. Sensors 2016, 16, 1036. [Google Scholar] [CrossRef] [PubMed]
- Kwon, T.; Lee, J.; Choi, H.; Yi, O.; Ju, S. Efficiency of LEA compared with AES. J. Converg. 2015, 6, 16–25. [Google Scholar]
- Ng, C.K.; Wu, C.H.; Ip, W.H.; Zhang, J.; Ho, G.T.S.; Chan, C.Y. Network topology management optimization of wireless sensor network (WSN). In Proceedings of the International Conference on Intelligent Computing, Lanzhou, China, 2–5 August 2016; Lecture Notes in Computer Science. Springer: Cham, Switzerland, 2016; pp. 850–859. [Google Scholar]
- Sohrabi, K.; Gao, J.; Ailawadhi, V.; Pottie, G.J. Protocols for self-organization of a wireless sensor network. IEEE Pers. Commun. 2000, 7, 16–27. [Google Scholar] [CrossRef]
- Shnayder, V.; Hempstead, M.; Chen, B.R.; Allen, G.W.; Welsh, M. Simulating the power consumption of large-scale sensor network applications. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, Baltimore, MD, USA, 3–5 November 2004. [Google Scholar]
- Gaur, M.S.; Pant, B. Trusted and secure clustering in mobile pervasive environment. Hum.-Centric Comput. Inf. Sci. 2015, 5, 32. [Google Scholar] [CrossRef]
- Kang, J.; Park, J.H.; Suk, S. Design of a distributed personal information access control scheme for secure integrated payment in NFC. Symmetry 2015, 7, 935–948. [Google Scholar] [CrossRef]
- Penrig, A.; Song, D.; Tygar, D. Elk, a new protocol for efficient large-group key distribution. In Proceedings of the 2001 IEEE Symposium on Security and Privacy (S & P 2001), Oakland, CA, USA, 14–16 May 2000. [Google Scholar]
- Wong, C.K.; Mohamed, W.; Simon, G.; Lam, S. Secure Group Communications Using Key Graphs; Tech. Rep.; ACM SIGCOMM Computer Communication Review: Waterloo, ON, Canada, 1998. [Google Scholar]
- Nguyen, T.-D.; Huh, E.-N. An efficient Key management for secure multicast in Sensor-Cloud. In Proceedings of the 2011 First ACIS/JNU International Conference, Jeju Island, Korea, 23–25 May 2011. [Google Scholar]
- Hassan, M.M.; Song, B.; Huh, E.-N. A framework of sensor-cloud integration opportunities and challenges. In Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, Suwon, Korea, 15–16 January 2009. [Google Scholar]
- Gupta, G.P.; Misra, M.; Garg, K. An energy efficient distributed approach-based agent migration scheme for data aggregation in wireless sensor networks. JIPS 2015, 11, 148–164. [Google Scholar]
- Hwang, K.-I.; Jang, I. Ultra low power data aggregation for request oriented sensor networks. JIPS 2014, 10, 412–428. [Google Scholar] [CrossRef]
- Dahane, A.; Berrached, N.-E.; Loukil, A. A virtual laboratory to practice mobile wireless sensor networks: A case study on energy efficient and safe weighted clustering algorithm. J. Inf. Process. Syst. 2015, 11, 205–228. [Google Scholar]
- Viani, F.; Robol, F.; Polo, A.; Massa, A. Wireless architectures for heterogeneous sensing in smart home applications: Concepts and real implementation. IEEE Proc. 2013, 101, 2381–2396. [Google Scholar] [CrossRef]
- Sivaraman, V.; Gharakheili, H.H.; Vishwanath, A.; Boreli, R.; Mehani, O. Network-level security and privacy control for smart-home IoT devices. In Proceedings of the 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Avignon, France, 19–21 October 2015. [Google Scholar]
- Basu, D.; Moretti, G.; Gupta, G.S.; Marsland, S. Wireless sensor network based smart home: Sensor selection, deployment and monitoring. In Proceedings of the 2013 IEEE Sensors Applications Symposium (SAS), Galveston, TX, USA, 19–21 February 2013. [Google Scholar]
- El-Basioni, B.M.M.; El-kader, S.M.A.; Abdelmonim, M. Smart home design using wireless sensor network and biometric technologies. Int. J. Appl. Innov. Eng. Manag. 2013, 2, 413–429. [Google Scholar]
- Gassend, B.; Clarke, D.; van Dijk, M.; Devadas, S. Silicon physical random functions. In Proceedings of the 9th ACM conference on Computer and communications security, Washington, DC, USA, 18–22 November 2002. [Google Scholar]
- Gassend, B.L.P. Physical Random Functions. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2003. [Google Scholar]
- Bielefeldt, J.; Chellappan, S. Sensor authentication in collaborating sensor networks. In Proceedings of the 2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET), Los Angeles, CA, USA, 2–4 June 2014. [Google Scholar]
- Delvaux, J.; Peeters, R.; Gu, D.; Verbauwhede, I. A survey on lightweight entity authentication with strong PUFs. ACM Comput. Surv. (CSUR) 2015, 48, 26. [Google Scholar] [CrossRef] [Green Version]
Notation | Meaning |
---|---|
SP | Service Provider |
Sensor | Sensors including HS, MS, and LS |
HS | High-class sensor |
MS | Middle-class sensor |
LS | Low-class sensor |
PUFs() | Physical unclonable functions |
PUF DB | Challenge and Response value mapping DB for PUF() |
E() | Encrytion function |
h() | Hash function |
ID | Identification |
N | Randomly gerated Nonce |
C | Challenge value for PUF |
R | Response value for PUF |
M | Encrypted Message |
V | Verification Message |
SK | Session Key |
i | The number of sensor |
j | The number of MS |
k | The number of LS |
Performance Requirements | Alessandro et al. [29] | Vijay et al. [30] | Debraj et al. [31] | Basma M et al. [32] | Proposed Scheme |
---|---|---|---|---|---|
Topology for smart home | X | X | X | X | O |
Security | X | O | X | O | O |
Different sensor performances | X | X | X | O | O |
Low Resource | O | X | O | O | O |
Threates | ELK [22] | LKH [23] | CoGKTK [24] | sGIM [25] | Proposed Scheme |
---|---|---|---|---|---|
Leaked key | Not-support | Not-support | Support | Support | Support |
Forward Secrecy | X | X | O | X | O |
Mutual Authentication | X | X | O | X | O |
Eavesdropping | X | X | X | X | O |
Replay Attack | X | X | O | O | O |
Calculation Item | LS | MS | HS | SP |
---|---|---|---|---|
PUF | n + 1 | n + 1 | n + 1 | (n + 1)(1 + J + K) |
Hash | 2 | 2 + k | 1 + J + K | 1 + J + K |
Encryption | 3 | 2 + k | 2 + J + K | 2 + 3J + 4K |
Decryption | 1 | 1 + k | J + K | - |
Nonce generation | 1 | 1 + k | 1 + J + K | 1 + J + 2K |
Storage Item | LS | MS | HS | SP |
---|---|---|---|---|
ID | 4 | 3 + k | 3 + K | 2 + J + K |
Challenge C | 1 | 1 | 1 | n + Jn + kN |
Response R | 1 | 1 | 1 | n + Jn + kN |
SK | 3 | 2 + k | 1 + J + K | 1 + J + K |
M | 1 | 1 + k | J + 2K | 2(J + K) |
V | 3 | 2 + k | 2 + J + K | 2 + J + 2K |
N | 3 | 3 + k | 2 + 3J + 3K | 2 + 3J + 5K |
© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Kim, M.; Lim, K.-S.; Song, J.; Jun, M.-s. An Efficient Secure Scheme Based on Hierarchical Topology in the Smart Home Environment. Symmetry 2017, 9, 143. https://doi.org/10.3390/sym9080143
Kim M, Lim K-S, Song J, Jun M-s. An Efficient Secure Scheme Based on Hierarchical Topology in the Smart Home Environment. Symmetry. 2017; 9(8):143. https://doi.org/10.3390/sym9080143
Chicago/Turabian StyleKim, Mansik, Kyung-Soo Lim, Jungsuk Song, and Moon-seog Jun. 2017. "An Efficient Secure Scheme Based on Hierarchical Topology in the Smart Home Environment" Symmetry 9, no. 8: 143. https://doi.org/10.3390/sym9080143
APA StyleKim, M., Lim, K.-S., Song, J., & Jun, M.-s. (2017). An Efficient Secure Scheme Based on Hierarchical Topology in the Smart Home Environment. Symmetry, 9(8), 143. https://doi.org/10.3390/sym9080143