Tzung-Her Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tzung-Her Chen has a total of 401 co-authors. Here are the top co-authors by number of shared publications:
- Gwoboa Horng
National Chung-Hsing University
12 shared publications Wei-Bin Lee
Feng Chia University
10 shared publicationsChih-Hung Lin
National Chiayi University
7 shared publicationsKai-Hsiang Tsao
7 shared publicationsYao-Sheng Lee
Department of Computer Science and Information Engineering, National Chiayi University, Chiayi 600, Taiwan, R.O.C
7 shared publicationsFuh-Gwo Jeng
National Chiayi University
5 shared publications
Latest Publications
- Open Access
- 9 July 2026
- Published by MDPI AG in Electronics
- Vol. 15 (14) , 3019
Compression-Unimpaired Joint Encryption and Authentication for PIZ-Compressed OpenEXR HDR Images
High dynamic range (HDR) images require protection of both confidentiality and integrity, but conventional LDR-oriented security methods are difficult to apply directly because HDR images differ substantially in file structure, numerical representation, and compression mechanisms. This paper focuses on secure protection of PIZ-compressed OpenEXR HDR images, where preserving compression syntax and decoder compatibility is essential. In our previous work, we proposed a commutative joint encryption and authentication scheme for uncompressed OpenEXR HDR images (This paper is an extended version of our previously published work in Multimedia Tools and Applications, entitled “Commutative Encryption and Authentication for OpenEXR High Dynamic Range Images” by Chen and Yan. Compared with the previous work, this extended version specifically addresses the challenge of integrating PIZ compression encoding into the joint encryption and authentication process for OpenEXR HDR images, which was not considered in our earlier study). However, that scheme did not address OpenEXR images encoded with PIZ compression. To overcome this limitation, this paper presents a compression-unimpaired joint encryption and authentication scheme that operates directly on Huffman-coded values in the chunk data of PIZ-compressed OpenEXR images. Specifically, we partition the histogram of values output according to the corresponding Huffman code into two segments: an encrypted part for confidentiality and an embedded part for authentication. To the best of our knowledge, this study is the first attempt to investigate commutative encryption and authentication directly in the PIZ-compressed OpenEXR HDR image domain. Experimental results on seven OpenEXR HDR images show that the decrypted and authenticated images preserve high visual quality, with PSNR values exceeding 75 dB in most cases. The protected files remain decodable by OpenEXR-compatible software, and the file size is preserved because the proposed operations replace valid Huffman codes with codes of identical length. These results indicate that the proposed scheme can jointly support confidentiality, authentication, format compliance, and compression preservation.
- 9 July 2026
- Published by MDPI AG in Electronics
- Vol. 15 (14) , 3019
Open AccessCompression-Unimpaired Joint Encryption and Authentication for PIZ-Compressed OpenEXR HDR Images
High dynamic range (HDR) images require protection of both confidentiality and integrity, but conventional LDR-oriented security methods are difficult to apply directly because HDR images differ substantially in file structure, numerical representation, and compression mechanisms. This paper focuses on secure protection of PIZ-compressed OpenEXR HDR images, where preserving compression syntax and decoder compatibility is essential. In our previous work, we proposed a commutative joint encryption and authentication scheme for uncompressed OpenEXR HDR images (This paper is an extended version of our previously published work in Multimedia Tools and Applications, entitled “Commutative Encryption and Authentication for OpenEXR High Dynamic Range Images” by Chen and Yan. Compared with the previous work, this extended version specifically addresses the challenge of integrating PIZ compression encoding into the joint encryption and authentication process for OpenEXR HDR images, which was not considered in our earlier study). However, that scheme did not address OpenEXR images encoded with PIZ compression. To overcome this limitation, this paper presents a compression-unimpaired joint encryption and authentication scheme that operates directly on Huffman-coded values in the chunk data of PIZ-compressed OpenEXR images. Specifically, we partition the histogram of values output according to the corresponding Huffman code into two segments: an encrypted part for confidentiality and an embedded part for authentication. To the best of our knowledge, this study is the first attempt to investigate commutative encryption and authentication directly in the PIZ-compressed OpenEXR HDR image domain. Experimental results on seven OpenEXR HDR images show that the decrypted and authenticated images preserve high visual quality, with PSNR values exceeding 75 dB in most cases. The protected files remain decodable by OpenEXR-compatible software, and the file size is preserved because the proposed operations replace valid Huffman codes with codes of identical length. These results indicate that the proposed scheme can jointly support confidentiality, authentication, format compliance, and compression preservation.
- Open Access
- 18 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2712
A Verification-Table-Free Post-Quantum Authenticated Key Agreement Scheme via ML-DSA-Based Subliminal Message Recovery
In user–server authentication environments, persistent server-side verification tables, such as password verifiers, shared authentication records, or per-user secret tables, may become a critical point of failure once leaked. To address this problem in the post-quantum setting, this paper proposes an ML-DSA-specific verification-table-free authenticated key agreement (AKA) scheme based on the NIST-standardized Module-Lattice-Based Digital Signature Algorithm (ML-DSA). The main contribution is a protocol-level use of the signer-recoverable masking vector in ML-DSA as an on-demand reconstruction mechanism for user-related authentication material. This enables the server to reconstruct the required user-related authentication material from its own signature and long-term secret key. This architecture reduces the exposure associated with centralized verification-table leakage, but it should be understood as a storage-relocation tradeoff rather than a storage-free design, because each user must retain the issued signature and the corresponding hash-derived authentication value. By combining the recovered value with identity information through a quantum-resistant one-way hash function, the server can authenticate the user and establish a session key. Its security is analyzed within a Canetti–Krawczyk-style adversarial model and further discussed in the random-oracle setting through a sequence-of-games argument. The analysis supports session-key indistinguishability under the stated freshness and exposure assumptions, while explicitly excluding full forward secrecy under compromise of the server’s long-term ML-DSA secret key. In addition, an operation-level comparison is provided to clarify computational, storage, and communication tradeoffs relative to representative post-quantum AKA schemes. Since the present work does not include implementation-level benchmarking, the performance discussion should be interpreted as analytical rather than empirical validation. The proposed scheme is therefore most suitable for account-login-oriented applications in which reducing centralized verification-table leakage is a primary design objective and where user-side credential storage can be securely managed.
- 18 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2712
Open AccessA Verification-Table-Free Post-Quantum Authenticated Key Agreement Scheme via ML-DSA-Based Subliminal Message Recovery
In user–server authentication environments, persistent server-side verification tables, such as password verifiers, shared authentication records, or per-user secret tables, may become a critical point of failure once leaked. To address this problem in the post-quantum setting, this paper proposes an ML-DSA-specific verification-table-free authenticated key agreement (AKA) scheme based on the NIST-standardized Module-Lattice-Based Digital Signature Algorithm (ML-DSA). The main contribution is a protocol-level use of the signer-recoverable masking vector in ML-DSA as an on-demand reconstruction mechanism for user-related authentication material. This enables the server to reconstruct the required user-related authentication material from its own signature and long-term secret key. This architecture reduces the exposure associated with centralized verification-table leakage, but it should be understood as a storage-relocation tradeoff rather than a storage-free design, because each user must retain the issued signature and the corresponding hash-derived authentication value. By combining the recovered value with identity information through a quantum-resistant one-way hash function, the server can authenticate the user and establish a session key. Its security is analyzed within a Canetti–Krawczyk-style adversarial model and further discussed in the random-oracle setting through a sequence-of-games argument. The analysis supports session-key indistinguishability under the stated freshness and exposure assumptions, while explicitly excluding full forward secrecy under compromise of the server’s long-term ML-DSA secret key. In addition, an operation-level comparison is provided to clarify computational, storage, and communication tradeoffs relative to representative post-quantum AKA schemes. Since the present work does not include implementation-level benchmarking, the performance discussion should be interpreted as analytical rather than empirical validation. The proposed scheme is therefore most suitable for account-login-oriented applications in which reducing centralized verification-table leakage is a primary design objective and where user-side credential storage can be securely managed.
- Open Access
- 12 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2595
Efficient HDR Image Reconstruction: A ResNet Approach with Enhanced Data Augmentation
High dynamic range (HDR) image reconstruction from a single low dynamic range (LDR) input remains an important problem for computational photography, particularly when practical deployment on consumer-grade hardware is considered. With the increasing availability of hardware supporting HDR, public demand for capturing and viewing HDR images has grown significantly. Recent research has explored deep learning-based approaches to reconstruct HDR images from low dynamic range (LDR) inputs by extracting regional pixel features or leveraging the camera response function (CRF) for model training. Many of these approaches employ Convolutional Neural Network (CNN) architectures and utilize skip connections to preserve learned information. Nevertheless, the configuration-level effects of data augmentation in HDR reconstruction remain insufficiently discussed. Existing CNN-based approaches, such as HDRCNN, HDRUNet, and ExpandNet, have demonstrated promising reconstruction ability, but they may involve a heavy backbone architecture, a long training time, or a limited discussion of how preprocessing configurations affect reconstruction performance. This study presents an engineering-oriented HDR reconstruction framework derived from HDRCNN, focusing on practical efficiency, structural fidelity, and training feasibility. The proposed framework introduces three modifications: (1) a configuration-level comparison of composite data augmentation settings, including unsharp masking, denoising, Gaussian blur, and brightness–contrast adjustment; (2) the replacement of the original VGG16 backbone with a ResNet50-based encoder enhanced with attention blocks and squeeze-and-excitation (SE) blocks for improved multi-scale feature extraction and channel-wise recalibration; and (3) the integration of mixed-precision training with cosine annealing learning-rate scheduling to reduce computational cost. Experimental results on the SI-HDR dataset show that the best composite augmentation configuration improves PSNR from 19.05 dB to 22.10 dB and SSIM from 0.6444 to 0.7714 without increasing the training time. Compared with the original VGG16-based HDRCNN setting, the ResNet50-based model reduces training time while improving SSIM from 0.2705 to 0.8512. Under the adopted comparison protocol, the proposed model achieves the shortest training time and slightly higher PSNR than HDRUNet, while HDRUNet retains a higher SSIM. This indicates a trade-off among pixel-wise fidelity, structural similarity, and computational efficiency. The current evaluation is limited by a small test setting, composite rather than operation-level augmentation analysis, and the use of PSNR and SSIM only; therefore, future work should include full benchmark evaluation, additional perceptual/HDR-specific metrics, and controlled component-level ablation studies.
- 12 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2595
Open AccessEfficient HDR Image Reconstruction: A ResNet Approach with Enhanced Data Augmentation
High dynamic range (HDR) image reconstruction from a single low dynamic range (LDR) input remains an important problem for computational photography, particularly when practical deployment on consumer-grade hardware is considered. With the increasing availability of hardware supporting HDR, public demand for capturing and viewing HDR images has grown significantly. Recent research has explored deep learning-based approaches to reconstruct HDR images from low dynamic range (LDR) inputs by extracting regional pixel features or leveraging the camera response function (CRF) for model training. Many of these approaches employ Convolutional Neural Network (CNN) architectures and utilize skip connections to preserve learned information. Nevertheless, the configuration-level effects of data augmentation in HDR reconstruction remain insufficiently discussed. Existing CNN-based approaches, such as HDRCNN, HDRUNet, and ExpandNet, have demonstrated promising reconstruction ability, but they may involve a heavy backbone architecture, a long training time, or a limited discussion of how preprocessing configurations affect reconstruction performance. This study presents an engineering-oriented HDR reconstruction framework derived from HDRCNN, focusing on practical efficiency, structural fidelity, and training feasibility. The proposed framework introduces three modifications: (1) a configuration-level comparison of composite data augmentation settings, including unsharp masking, denoising, Gaussian blur, and brightness–contrast adjustment; (2) the replacement of the original VGG16 backbone with a ResNet50-based encoder enhanced with attention blocks and squeeze-and-excitation (SE) blocks for improved multi-scale feature extraction and channel-wise recalibration; and (3) the integration of mixed-precision training with cosine annealing learning-rate scheduling to reduce computational cost. Experimental results on the SI-HDR dataset show that the best composite augmentation configuration improves PSNR from 19.05 dB to 22.10 dB and SSIM from 0.6444 to 0.7714 without increasing the training time. Compared with the original VGG16-based HDRCNN setting, the ResNet50-based model reduces training time while improving SSIM from 0.2705 to 0.8512. Under the adopted comparison protocol, the proposed model achieves the shortest training time and slightly higher PSNR than HDRUNet, while HDRUNet retains a higher SSIM. This indicates a trade-off among pixel-wise fidelity, structural similarity, and computational efficiency. The current evaluation is limited by a small test setting, composite rather than operation-level augmentation analysis, and the use of PSNR and SSIM only; therefore, future work should include full benchmark evaluation, additional perceptual/HDR-specific metrics, and controlled component-level ablation studies.
- Open Access
- 8 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2534
Hardware-Aware Parallel Emulation of BB84-like Circuit Primitives on NISQ Processors: Device Reliability and QBER-Based Disturbance Evaluation
This work investigates a hardware-aware, circuit-level emulation of BB84-like circuit primitives on noisy intermediate-scale quantum (NISQ) processors. The motivation is to evaluate whether BB84-like basis sifting and intercept–resend-induced QBER behavior remain observable when selected BB84 operations are mapped to parallel single-qubit circuits on gate-based devices. The proposed mapping represents Alice’s preparation, optional Eve intercept–resend emulation, and Bob’s measurement as processor-internal circuit layers; it is therefore an on-chip emulation and not an end-to-end optical QKD implementation. Experiments combine real IBM superconducting processors with Qiskit, Cirq, and Azure/Q# simulator-based or noise-modeled evaluations. Baseline QBER was first calibrated for each backend, and intercept–resend experiments then produced a clear QBER separation from the no-eavesdropper condition. The observed sifted-bit utilization was close to the expected 50% BB84 basis-matching reference, while the constant-depth circuit structure supported scalable raw/sifted-bit generation before any classical post-processing. These observations are treated as implementation-level consistency checks and backend-dependent experimental metrics, rather than as new BB84 protocol-level results. Finite-shot uncertainty, calibration drift, and backend-specific noise are treated as limitations of the proposed QBER-based evaluation rule rather than as deployment-level security guarantees. Because the study does not implement a physical quantum channel, authenticated classical communication, error correction, privacy amplification, finite-key security analysis, or general QKD attack models, the reported metrics should be interpreted as raw/sifted-bit experimental metrics and QBER-based disturbance evaluation for BB84-like NISQ emulation, not as secure key rates, secure throughput, or practical QKD deployment results.
- 8 June 2026
- Published by MDPI AG in Electronics
- Vol. 15 (12) , 2534
Open AccessHardware-Aware Parallel Emulation of BB84-like Circuit Primitives on NISQ Processors: Device Reliability and QBER-Based Disturbance Evaluation
This work investigates a hardware-aware, circuit-level emulation of BB84-like circuit primitives on noisy intermediate-scale quantum (NISQ) processors. The motivation is to evaluate whether BB84-like basis sifting and intercept–resend-induced QBER behavior remain observable when selected BB84 operations are mapped to parallel single-qubit circuits on gate-based devices. The proposed mapping represents Alice’s preparation, optional Eve intercept–resend emulation, and Bob’s measurement as processor-internal circuit layers; it is therefore an on-chip emulation and not an end-to-end optical QKD implementation. Experiments combine real IBM superconducting processors with Qiskit, Cirq, and Azure/Q# simulator-based or noise-modeled evaluations. Baseline QBER was first calibrated for each backend, and intercept–resend experiments then produced a clear QBER separation from the no-eavesdropper condition. The observed sifted-bit utilization was close to the expected 50% BB84 basis-matching reference, while the constant-depth circuit structure supported scalable raw/sifted-bit generation before any classical post-processing. These observations are treated as implementation-level consistency checks and backend-dependent experimental metrics, rather than as new BB84 protocol-level results. Finite-shot uncertainty, calibration drift, and backend-specific noise are treated as limitations of the proposed QBER-based evaluation rule rather than as deployment-level security guarantees. Because the study does not implement a physical quantum channel, authenticated classical communication, error correction, privacy amplification, finite-key security analysis, or general QKD attack models, the reported metrics should be interpreted as raw/sifted-bit experimental metrics and QBER-based disturbance evaluation for BB84-like NISQ emulation, not as secure key rates, secure throughput, or practical QKD deployment results.
- 30 September 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (10)
Pioneering quantum authenticated key agreement through Grover’s algorithm
- 30 September 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (10)
Pioneering quantum authenticated key agreement through Grover’s algorithm
- Open Access
- 26 September 2025
- Published by MDPI AG in Electronics
- Vol. 14 (19) , 3821
Feasibility and Limitations of Generalized Grover Search Algorithm-Based Quantum Asymmetric Cryptography: An Implementation Study on Quantum Hardware
The emergence of quantum computing poses significant threats to conventional public-key cryptography, driving the urgent need for quantum-resistant cryptographic solutions. While quantum key distribution addresses secure key exchange, its dependency on symmetric keys and point-to-point limitations present scalability constraints. Quantum Asymmetric Encryption (QAE) offers a promising alternative by leveraging quantum mechanical principles for security. This paper presents the first practical implementation of a QAE protocol on IBM Quantum devices, building upon the theoretical framework originally proposed by Yoon et al. We develop a generalized Grover Search Algorithm (GSA) framework that supports non-standard initial quantum states through novel diffusion operator designs, extending its applicability beyond idealized conditions. The complete QAE protocol, including key generation, encryption, and decryption stages, is translated into executable quantum circuits and evaluated on both IBM Quantum simulators and real quantum hardware. Experimental results demonstrate significant scalability challenges, with success probabilities deteriorating considerably for larger systems. The 2-qubit implementation achieves near-perfect accuracy (100% on the simulator, and 93.88% on the hardware), while performance degrades to 78.15% (simulator) and 45.84% (hardware) for 3 qubits, and declines critically to 48.08% (simulator) and 7.63% (hardware) for 4 qubits. This degradation is primarily attributed to noise and decoherence effects in current Noisy Intermediate-Scale Quantum (NISQ) devices, highlighting the limitations of single-iteration GSA approaches. Our findings underscore the critical need for enhanced hardware fidelity and algorithmic optimization to advance the practical viability of quantum cryptographic systems, providing valuable insights for bridging the gap between theoretical quantum cryptography and real-world implementations.
- 26 September 2025
- Published by MDPI AG in Electronics
- Vol. 14 (19) , 3821
Open AccessFeasibility and Limitations of Generalized Grover Search Algorithm-Based Quantum Asymmetric Cryptography: An Implementation Study on Quantum Hardware
The emergence of quantum computing poses significant threats to conventional public-key cryptography, driving the urgent need for quantum-resistant cryptographic solutions. While quantum key distribution addresses secure key exchange, its dependency on symmetric keys and point-to-point limitations present scalability constraints. Quantum Asymmetric Encryption (QAE) offers a promising alternative by leveraging quantum mechanical principles for security. This paper presents the first practical implementation of a QAE protocol on IBM Quantum devices, building upon the theoretical framework originally proposed by Yoon et al. We develop a generalized Grover Search Algorithm (GSA) framework that supports non-standard initial quantum states through novel diffusion operator designs, extending its applicability beyond idealized conditions. The complete QAE protocol, including key generation, encryption, and decryption stages, is translated into executable quantum circuits and evaluated on both IBM Quantum simulators and real quantum hardware. Experimental results demonstrate significant scalability challenges, with success probabilities deteriorating considerably for larger systems. The 2-qubit implementation achieves near-perfect accuracy (100% on the simulator, and 93.88% on the hardware), while performance degrades to 78.15% (simulator) and 45.84% (hardware) for 3 qubits, and declines critically to 48.08% (simulator) and 7.63% (hardware) for 4 qubits. This degradation is primarily attributed to noise and decoherence effects in current Noisy Intermediate-Scale Quantum (NISQ) devices, highlighting the limitations of single-iteration GSA approaches. Our findings underscore the critical need for enhanced hardware fidelity and algorithmic optimization to advance the practical viability of quantum cryptographic systems, providing valuable insights for bridging the gap between theoretical quantum cryptography and real-world implementations.
- Open Access
- 17 June 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (6) , 263
A Grover Search-Based Quantum Key Agreement Protocol for Secure Internet of Medical Things Communication
The rapid integration of the Internet of Medical Things (IoMT) into healthcare systems raises urgent demands for secure communication mechanisms capable of protecting sensitive patient data. Quantum key agreement (QKA), a collaborative approach to key generation based on quantum principles, provides an attractive alternative to traditional quantum key distribution (QKD), as it eliminates dependence on a trusted authority and ensures equal participation from all users. QKA demonstrates particular suitability for IoMT’s decentralized medical networks by eliminating trusted authority dependence while ensuring equitable participation among all participants. This addresses fundamental challenges where centralized trust models introduce vulnerabilities and asymmetric access patterns that compromise egalitarian principles essential for medical data sharing. However, practical QKA applications in IoMT remain limited, particularly for schemes that avoid complex entanglement operations and authenticated classical channels. Among the few QKA protocols employing Grover’s search algorithm (GSA), existing proposals potentially suffer from limitations in fairness and security. In this paper, the author proposes an improved GSA-based QKA protocol that ensures fairness, security, and correctness without requiring an authenticated classical communication channel. The proposed scheme guarantees that each participant’s input equally contributes to the final key, preventing manipulation by any user subgroup. The scheme combines Grover’s algorithm with the decoy photon technique to ensure secure quantum transmission. Security analysis confirms resistance to external attacks, including intercept-resend, entanglement probes, and device-level exploits, as well as insider threats such as parameter manipulation. Fairness is achieved through a symmetric protocol design rooted in quantum mechanical principles. Efficiency evaluation shows a theoretical efficiency of approximately 25%, while eliminating the need for quantum memory. These results position the proposed protocol as a practical and scalable solution for future secure quantum communication systems, particularly within distributed IoMT environments.
- 17 June 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (6) , 263
Open AccessA Grover Search-Based Quantum Key Agreement Protocol for Secure Internet of Medical Things Communication
The rapid integration of the Internet of Medical Things (IoMT) into healthcare systems raises urgent demands for secure communication mechanisms capable of protecting sensitive patient data. Quantum key agreement (QKA), a collaborative approach to key generation based on quantum principles, provides an attractive alternative to traditional quantum key distribution (QKD), as it eliminates dependence on a trusted authority and ensures equal participation from all users. QKA demonstrates particular suitability for IoMT’s decentralized medical networks by eliminating trusted authority dependence while ensuring equitable participation among all participants. This addresses fundamental challenges where centralized trust models introduce vulnerabilities and asymmetric access patterns that compromise egalitarian principles essential for medical data sharing. However, practical QKA applications in IoMT remain limited, particularly for schemes that avoid complex entanglement operations and authenticated classical channels. Among the few QKA protocols employing Grover’s search algorithm (GSA), existing proposals potentially suffer from limitations in fairness and security. In this paper, the author proposes an improved GSA-based QKA protocol that ensures fairness, security, and correctness without requiring an authenticated classical communication channel. The proposed scheme guarantees that each participant’s input equally contributes to the final key, preventing manipulation by any user subgroup. The scheme combines Grover’s algorithm with the decoy photon technique to ensure secure quantum transmission. Security analysis confirms resistance to external attacks, including intercept-resend, entanglement probes, and device-level exploits, as well as insider threats such as parameter manipulation. Fairness is achieved through a symmetric protocol design rooted in quantum mechanical principles. Efficiency evaluation shows a theoretical efficiency of approximately 25%, while eliminating the need for quantum memory. These results position the proposed protocol as a practical and scalable solution for future secure quantum communication systems, particularly within distributed IoMT environments.
- 8 September 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (10) , 28913-28926
Security enhancement of an (n, n) threshold non-expansible XOR-based visual cryptography with unique meaningful shares
- 8 September 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (10) , 28913-28926
Security enhancement of an (n, n) threshold non-expansible XOR-based visual cryptography with unique meaningful shares
- Open Access
- 3 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 85202-85213
A Blockchain-Enabled Authentication and Conserved Data Aggregation Scheme for Secure Smart Grids
The construction of smart grids provides many benefits. Computational cost, however, drastically grows with an increase in scale since a large amount of data is generated, transmitted, collected, and treated. Although data aggregation technology is helpful when adopting smart grid applications, corresponding security and performance issues should be considered while implementing the mechanism. In this paper, a blockchain-enabled authenticated conserved data aggregation scheme is proposed to balance security concerns and the computational cost of the smart grid. Furthermore, several functions are developed in our scheme to highlight the contributions. First, efficient cryptographic algorithms are integrated instead of computationally-expensive ones. Second, the proposed scheme seamlessly incorporates a blockchain system into a smart grid for better decentralization which can avoid the possible threats and high cost of a centralized system. Third, the scheme is scalable, which can be adapted to manage a great number of metering devices. Fourth, the aggregational operations in our design combine power data and signature, which is more practical. Finally, the proposed scheme covers a one-time key pair and signature mechanism, thus upgrading the privacy protection of blockchain applications in the smart grid.
- 3 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 85202-85213
Open AccessA Blockchain-Enabled Authentication and Conserved Data Aggregation Scheme for Secure Smart Grids
The construction of smart grids provides many benefits. Computational cost, however, drastically grows with an increase in scale since a large amount of data is generated, transmitted, collected, and treated. Although data aggregation technology is helpful when adopting smart grid applications, corresponding security and performance issues should be considered while implementing the mechanism. In this paper, a blockchain-enabled authenticated conserved data aggregation scheme is proposed to balance security concerns and the computational cost of the smart grid. Furthermore, several functions are developed in our scheme to highlight the contributions. First, efficient cryptographic algorithms are integrated instead of computationally-expensive ones. Second, the proposed scheme seamlessly incorporates a blockchain system into a smart grid for better decentralization which can avoid the possible threats and high cost of a centralized system. Third, the scheme is scalable, which can be adapted to manage a great number of metering devices. Fourth, the aggregational operations in our design combine power data and signature, which is more practical. Finally, the proposed scheme covers a one-time key pair and signature mechanism, thus upgrading the privacy protection of blockchain applications in the smart grid.