SungKee Noh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
SungKee Noh has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- JoonYoung Lee
School of Electronic and Electrical Engineering, Kyungpook National University, Daegu, South Korea
3 shared publications - Kisung Park
Department of Computer Engineering (Smart Security), Gachon University, Seongnam, South Korea
3 shared publications - Myeonghyun Kim
System Security Research Section, Electronics and Telecommunications Research Institute, Daejeon 34129, Republic of Korea
3 shared publications - Youngho Park
School of Electronic and Electrical Engineering, Kyungpook National University, Daegu 41566, Republic of Korea
3 shared publications - Jihyeon Oh
School of Electronic and Electrical Engineering, Kyungpook National University, Daegu 41566, Republic of Korea
2 shared publications - Abhishek Bisht
Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India
1 shared publication
Latest Publications
- Open Access
Blockchain-Based Data Access Control and Key Agreement System in IoT Environment
Recently, with the increasing application of the Internet of Things (IoT), various IoT environments such as smart factories, smart homes, and smart grids are being generated. In the IoT environment, a lot of data are generated in real time, and the generated IoT data can be used as source data for various services such as artificial intelligence, remote medical care, and finance, and can also be used for purposes such as electricity bill generation. Therefore, data access control is required to grant access rights to various data users in the IoT environment who need such IoT data. In addition, IoT data contain sensitive information such as personal information, so privacy protection is also essential. Ciphertext-policy attribute-based encryption (CP-ABE) technology has been utilized to address these requirements. Furthermore, system structures applying blockchains with CP-ABE are being studied to prevent bottlenecks and single failures of cloud servers, as well as to support data auditing. However, these systems do not stipulate authentication and key agreement to ensure the security of the data transmission process and data outsourcing. Accordingly, we propose a data access control and key agreement scheme using CP-ABE to ensure data security in a blockchain-based system. In addition, we propose a system that can provide data nonrepudiation, data accountability, and data verification functions by utilizing blockchains. Both formal and informal security verifications are performed to demonstrate the security of the proposed system. We also compare the security, functional aspects, and computational and communication costs of previous systems. Furthermore, we perform cryptographic calculations to analyze the system in practical terms. As a result, our proposed protocol is safer against attacks such as guessing attacks and tracing attacks than other protocols, and can provide mutual authentication and key agreement functions. In addition, the proposed protocol is more efficient than other protocols, so it can be applied to practical IoT environments.
Open AccessBlockchain-Based Data Access Control and Key Agreement System in IoT Environment
Recently, with the increasing application of the Internet of Things (IoT), various IoT environments such as smart factories, smart homes, and smart grids are being generated. In the IoT environment, a lot of data are generated in real time, and the generated IoT data can be used as source data for various services such as artificial intelligence, remote medical care, and finance, and can also be used for purposes such as electricity bill generation. Therefore, data access control is required to grant access rights to various data users in the IoT environment who need such IoT data. In addition, IoT data contain sensitive information such as personal information, so privacy protection is also essential. Ciphertext-policy attribute-based encryption (CP-ABE) technology has been utilized to address these requirements. Furthermore, system structures applying blockchains with CP-ABE are being studied to prevent bottlenecks and single failures of cloud servers, as well as to support data auditing. However, these systems do not stipulate authentication and key agreement to ensure the security of the data transmission process and data outsourcing. Accordingly, we propose a data access control and key agreement scheme using CP-ABE to ensure data security in a blockchain-based system. In addition, we propose a system that can provide data nonrepudiation, data accountability, and data verification functions by utilizing blockchains. Both formal and informal security verifications are performed to demonstrate the security of the proposed system. We also compare the security, functional aspects, and computational and communication costs of previous systems. Furthermore, we perform cryptographic calculations to analyze the system in practical terms. As a result, our proposed protocol is safer against attacks such as guessing attacks and tracing attacks than other protocols, and can provide mutual authentication and key agreement functions. In addition, the proposed protocol is more efficient than other protocols, so it can be applied to practical IoT environments.
- Open Access
- 6 October 2022
- Published by MDPI AG in Electronics
- Vol. 11 (19) , 3199
A Secure Personal Health Record Sharing System with Key Aggregate Dynamic Searchable Encryption
Recently, as interest in individualized health has increased, the Personal Health Record (PHR) has attracted a lot of attention for prognosis predictions and accurate diagnoses. Cloud servers have been used to manage the PHR system, but privacy concerns are evident since cloud servers process the entire PHR, which contains the sensitive information of patients. In addition, cloud servers centrally manage the PHR system so patients lose direct control over their own PHR and cloud servers can be an attractive target for malicious users. Therefore, ensuring the integrity and privacy of the PHR and allocating authorization to users are important issues. In this paper, we propose a secure PHR sharing system using a blockchain, InterPlanetary File System (IPFS), and smart contract to ensure PHR integrity and secure verification. To guarantee the patient’s authority over the management of his/her own PHR, as well as provide convenient access, we suggest a key aggregate dynamic searchable encryption. We prove the security of the proposed scheme through informal and formal analyses including an Automated Verification of Internet Security Protocols and Applications (AVISPA) simulation, Burrows–Abadi–Needham (BAN) logic, and security-model-based games. Furthermore, we estimate the computational costs of the proposed scheme using a Multiprecision Integer and Rational Arithmetic Cryptographic Library (MIRACL) and compare the results with those of previous works.
- 6 October 2022
- Published by MDPI AG in Electronics
- Vol. 11 (19) , 3199
Open AccessA Secure Personal Health Record Sharing System with Key Aggregate Dynamic Searchable Encryption
Recently, as interest in individualized health has increased, the Personal Health Record (PHR) has attracted a lot of attention for prognosis predictions and accurate diagnoses. Cloud servers have been used to manage the PHR system, but privacy concerns are evident since cloud servers process the entire PHR, which contains the sensitive information of patients. In addition, cloud servers centrally manage the PHR system so patients lose direct control over their own PHR and cloud servers can be an attractive target for malicious users. Therefore, ensuring the integrity and privacy of the PHR and allocating authorization to users are important issues. In this paper, we propose a secure PHR sharing system using a blockchain, InterPlanetary File System (IPFS), and smart contract to ensure PHR integrity and secure verification. To guarantee the patient’s authority over the management of his/her own PHR, as well as provide convenient access, we suggest a key aggregate dynamic searchable encryption. We prove the security of the proposed scheme through informal and formal analyses including an Automated Verification of Internet Security Protocols and Applications (AVISPA) simulation, Burrows–Abadi–Needham (BAN) logic, and security-model-based games. Furthermore, we estimate the computational costs of the proposed scheme using a Multiprecision Integer and Rational Arithmetic Cryptographic Library (MIRACL) and compare the results with those of previous works.
- Open Access
- 23 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (19) , 8841
A Secure Key Aggregate Searchable Encryption with Multi Delegation in Cloud Data Sharing Service
As the amount of data generated in various distributed environments is rapidly increasing, cloud servers and computing technologies are attracting considerable attention. However, the cloud server has privacy issues, including personal information and requires the help of a Trusted Third Party (TTP) for data sharing. However, because the amount of data generated and value increases, the data owner who produces data must become the subject of data sharing. In this study, we use key aggregate searchable encryption (KASE) technology, which enables keyword search, to efficiently share data without using TTP. The traditional KASE scheme approach only discusses delegation of authority from the data owner to another user. However, if the delegated entity cannot perform time-critical tasks because the shared data are unavailable, the delegate must further delegate the rights given to other users. Consequently, this paper proposes a new KASE scheme that enables multi-delegation without TTP and includes an authentication technique between the user and the server. After that, we perform informal and formal analysis using BAN logic and AVISPA for security evaluation, and compare the security and performance aspects with existing schemes.
- 23 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (19) , 8841
Open AccessA Secure Key Aggregate Searchable Encryption with Multi Delegation in Cloud Data Sharing Service
As the amount of data generated in various distributed environments is rapidly increasing, cloud servers and computing technologies are attracting considerable attention. However, the cloud server has privacy issues, including personal information and requires the help of a Trusted Third Party (TTP) for data sharing. However, because the amount of data generated and value increases, the data owner who produces data must become the subject of data sharing. In this study, we use key aggregate searchable encryption (KASE) technology, which enables keyword search, to efficiently share data without using TTP. The traditional KASE scheme approach only discusses delegation of authority from the data owner to another user. However, if the delegated entity cannot perform time-critical tasks because the shared data are unavailable, the delegate must further delegate the rights given to other users. Consequently, this paper proposes a new KASE scheme that enables multi-delegation without TTP and includes an authentication technique between the user and the server. After that, we perform informal and formal analysis using BAN logic and AVISPA for security evaluation, and compare the security and performance aspects with existing schemes.
- 8 April 2008
- Published by Wiley in ETRI Journal
- Vol. 30 (2) , 341-343
Angular MST-Based Topology Control for Multi-hop Wireless Ad Hoc Networks
- 8 April 2008
- Published by Wiley in ETRI Journal
- Vol. 30 (2) , 341-343
Angular MST-Based Topology Control for Multi-hop Wireless Ad Hoc Networks
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1031-1035
Two-Tier Call Admission Control to Minimize CBP/CDP in Heterogeneous Wireless Networks
This paper proposes a two-tier call admission control scheme for the efficient use of cellular/WLAN integrated resource. The proposed two-tier call admission control has two separated policies for 3 G cellular network and WLAN. Using the proposed call admission control, the call blocking probability and call dropping probability for voice and data calls are reduced and validated by simulations.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1031-1035
Two-Tier Call Admission Control to Minimize CBP/CDP in Heterogeneous Wireless Networks
This paper proposes a two-tier call admission control scheme for the efficient use of cellular/WLAN integrated resource. The proposed two-tier call admission control has two separated policies for 3 G cellular network and WLAN. Using the proposed call admission control, the call blocking probability and call dropping probability for voice and data calls are reduced and validated by simulations.