Hyeonbum Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Hyeonbum Lee has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jae Hong Seo
Hanyang University
6 shared publications - Sungwook Kim
Division of Information Security, Seoul Womens University, Seoul, Republic of Korea
3 shared publications - Changhao Chenli
Indiana Institute of Technology, USA
2 shared publications - Taeho Jung
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA
2 shared publications - Wenyi Tang
Indiana University School of Medicine, USA
2 shared publications - Chanyang Ju
Department of Mathematics Research Institute for Natural Sciences, Hanyang University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 10 September 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
\(\text{Trac}^{2}\) ZChain: Trackability and Traceability of Graph Data in Blockchain with Linkage PrivacyBlockchain's tamper-proof, decentralized qualities make it perfect for running shared provenance applications in a distributed setting, such as auditing data sharing or monitoring supply chains. However, blockchain presents challenges when it comes to storing sensitive provenance data, including the data records themselves and their connection, because (1) records cannot be modified due to tamper-proofness, (2) efficient graph tracking/tracing is required for a provenance system on the blockchain, and (3) the linkages between records should be kept from unauthorized users, including the blockchain maintainers. Existing methods either lack sufficient privacy protection, only support simple structures, or inadvertently reveal linkage volume with the UTXO model. We present \(\text{Trac}^{2}\) ZChain, which is based on our previous work Trac \({}^{2}\) Chain[57], a framework that provides complete linkage privacy (i.e., no leakages from record sizes) and full tracking/tracing functions for blockchain-stored provenance graphs. The innovative graph storage architecture presented in [57] enables the generation of provenance dependencies for arbitrary graph structures while maintaining the tamper-proofness of blockchain. However, the previous work does not provide the blockchain with the ability to verify the authenticity of the provenance record, which should be an essential property of any blockchain-based system. In \(\text{Trac}^{2}\) ZChain, we modified the original Trac \({}^{2}\) Chain protocols to make it feasible to apply zero-knowledge proof, which allows blockchain peers to verify the correctness of the on-chain provenance functions without learning private information. The evaluation and comparison demonstrate that \(\text{Trac}^{2}\) ZChain achieves efficient provenance functions, verification of records, and linkage privacy protections, and has reasonable overhead compared to the state-of-the-art approaches.- 10 September 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Open Access\(\text{Trac}^{2}\) ZChain: Trackability and Traceability of Graph Data in Blockchain with Linkage PrivacyBlockchain's tamper-proof, decentralized qualities make it perfect for running shared provenance applications in a distributed setting, such as auditing data sharing or monitoring supply chains. However, blockchain presents challenges when it comes to storing sensitive provenance data, including the data records themselves and their connection, because (1) records cannot be modified due to tamper-proofness, (2) efficient graph tracking/tracing is required for a provenance system on the blockchain, and (3) the linkages between records should be kept from unauthorized users, including the blockchain maintainers. Existing methods either lack sufficient privacy protection, only support simple structures, or inadvertently reveal linkage volume with the UTXO model. We present \(\text{Trac}^{2}\) ZChain, which is based on our previous work Trac \({}^{2}\) Chain[57], a framework that provides complete linkage privacy (i.e., no leakages from record sizes) and full tracking/tracing functions for blockchain-stored provenance graphs. The innovative graph storage architecture presented in [57] enables the generation of provenance dependencies for arbitrary graph structures while maintaining the tamper-proofness of blockchain. However, the previous work does not provide the blockchain with the ability to verify the authenticity of the provenance record, which should be an essential property of any blockchain-based system. In \(\text{Trac}^{2}\) ZChain, we modified the original Trac \({}^{2}\) Chain protocols to make it feasible to apply zero-knowledge proof, which allows blockchain peers to verify the correctness of the on-chain provenance functions without learning private information. The evaluation and comparison demonstrate that \(\text{Trac}^{2}\) ZChain achieves efficient provenance functions, verification of records, and linkage privacy protections, and has reasonable overhead compared to the state-of-the-art approaches. - Open Access
- 14 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 10217-10244
Cougar: Cubic Root Verifier Inner Product Argument Under Discrete Logarithm Assumption
An inner product argument (IPA) is a cryptographic proof system that serves as a fundamental building block for various applications, such as zero knowledge proofs and verifiable computation. Bulletproofs (IEEE S&P 2018), a well-known IPA under the discrete logarithm (DL) assumption, features a short, logarithmically-sized proof, making it suitable for blockchain applications. However, its major drawback is the linear verifier cost ( $O(N)$ ), which presents a significant bottleneck in settings like verifiable computation. To address this, recent advancements have successfully reduced the verification complexity to square-root order ( $O(\sqrt {N})$ ) under the same assumption (e.g., Asiacrypt 2022, IEEE TIFS). In this work, we propose $\textsf {Cougar}$ , a novel IPA that breaks this square-root barrier to achieve an unprecedented cubic-root verifier complexity ( $O(\sqrt [{3}]{N})$ ), while strictly maintaining the compact logarithmic proof size ( $O(\log N)$ ) characteristic of Bulletproofs. To achieve this, $\textsf {Cougar}$ introduces a generalized two-tier commitment framework combined with a disjoint interpolation strategy for efficient consistency checks. We implemented $\textsf {Cougar}$ in Rust and performed a comprehensive benchmarking against Bulletproofs and $\textsf {Leopard}$ (IEEE TIFS). Our evaluation demonstrates that while $\textsf {Cougar}$ incurs a moderate increase in prover overhead, its verification time scales significantly better for large instances. Concretely, for a witness size of $N = 2^{20}$ , $\textsf {Cougar}$ achieves a $50\times $ verification speed-up over Bulletproofs and exhibits a superior asymptotic growth rate compared to existing sublinear IPAs.
- 14 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 10217-10244
Open AccessCougar: Cubic Root Verifier Inner Product Argument Under Discrete Logarithm Assumption
An inner product argument (IPA) is a cryptographic proof system that serves as a fundamental building block for various applications, such as zero knowledge proofs and verifiable computation. Bulletproofs (IEEE S&P 2018), a well-known IPA under the discrete logarithm (DL) assumption, features a short, logarithmically-sized proof, making it suitable for blockchain applications. However, its major drawback is the linear verifier cost ( $O(N)$ ), which presents a significant bottleneck in settings like verifiable computation. To address this, recent advancements have successfully reduced the verification complexity to square-root order ( $O(\sqrt {N})$ ) under the same assumption (e.g., Asiacrypt 2022, IEEE TIFS). In this work, we propose $\textsf {Cougar}$ , a novel IPA that breaks this square-root barrier to achieve an unprecedented cubic-root verifier complexity ( $O(\sqrt [{3}]{N})$ ), while strictly maintaining the compact logarithmic proof size ( $O(\log N)$ ) characteristic of Bulletproofs. To achieve this, $\textsf {Cougar}$ introduces a generalized two-tier commitment framework combined with a disjoint interpolation strategy for efficient consistency checks. We implemented $\textsf {Cougar}$ in Rust and performed a comprehensive benchmarking against Bulletproofs and $\textsf {Leopard}$ (IEEE TIFS). Our evaluation demonstrates that while $\textsf {Cougar}$ incurs a moderate increase in prover overhead, its verification time scales significantly better for large instances. Concretely, for a witness size of $N = 2^{20}$ , $\textsf {Cougar}$ achieves a $50\times $ verification speed-up over Bulletproofs and exhibits a superior asymptotic growth rate compared to existing sublinear IPAs.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4049-4063
Practical Zero-Knowledge PIOP for Maliciously Secure Multiparty Homomorphic Encryption
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4049-4063
Open AccessPractical Zero-Knowledge PIOP for Maliciously Secure Multiparty Homomorphic Encryption
- 17 October 2025
- Published by Springer Nature
- p. 321-340
UTRA: Universal Token Reusability Attack and Token Unforgeable Delegatable Order-Revealing Encryption
- 17 October 2025
- Published by Springer Nature
- p. 321-340
UTRA: Universal Token Reusability Attack and Token Unforgeable Delegatable Order-Revealing Encryption
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4827-4842
Fair2Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness
Online data trading is increasingly prevalent as data are becoming valuable assets. In most common conventional data trading scenarios, three parties (seller, broker, and buyer) exist, and fairness in trading is essential. This paper discusses and solves the fairness problem in two aspects. First, we consider exchange fairness , which requires payments and data exchanged correctly between buyers and the broker. In existing solutions, keys of encrypted data are traded. However, these solutions failed to provide a complete and secure design for validating keys' correctness unless they used generic theoretical but expensive methods, e.g., zk-SNARK. We address this security issue by designing a new key verification mechanism. We also present a novel atomic exchange protocol based on Hashed Timelock Contracts on Ethereum, reducing gas consumption compared to the existing approach. Second, we consider distribution fairness , which requires correctly splitting income between the broker and sellers. Straightforward solutions are impractical, i.e., sellers participating in every transaction or traversing the blockchain. Therefore, we design a verifiable statement protocol for sellers to verify the income split efficiently. Further, analysis and experimental results indicate that extra fairness properties are securely achieved, and our protocol reduces users' on-chain participation compared to state-of-the-art protocols.
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4827-4842
Fair2Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness
Online data trading is increasingly prevalent as data are becoming valuable assets. In most common conventional data trading scenarios, three parties (seller, broker, and buyer) exist, and fairness in trading is essential. This paper discusses and solves the fairness problem in two aspects. First, we consider exchange fairness , which requires payments and data exchanged correctly between buyers and the broker. In existing solutions, keys of encrypted data are traded. However, these solutions failed to provide a complete and secure design for validating keys' correctness unless they used generic theoretical but expensive methods, e.g., zk-SNARK. We address this security issue by designing a new key verification mechanism. We also present a novel atomic exchange protocol based on Hashed Timelock Contracts on Ethereum, reducing gas consumption compared to the existing approach. Second, we consider distribution fairness , which requires correctly splitting income between the broker and sellers. Straightforward solutions are impractical, i.e., sellers participating in every transaction or traversing the blockchain. Therefore, we design a verifiable statement protocol for sellers to verify the income split efficiently. Further, analysis and experimental results indicate that extra fairness properties are securely achieved, and our protocol reduces users' on-chain participation compared to state-of-the-art protocols.
- 24 August 2023
- Published by Springer Nature
- p. 214-234
TENET: Sublogarithmic Proof and Sublinear Verifier Inner Product Argument without a Trusted Setup
- 24 August 2023
- Published by Springer Nature
- p. 214-234
TENET: Sublogarithmic Proof and Sublinear Verifier Inner Product Argument without a Trusted Setup
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 5332-5344
Leopard: Sublinear Verifier Inner Product Argument Under Discrete Logarithm Assumption
An inner product (IP) argument is a proof system that convinces the verifier of an IP relation between committed integer vectors. IP arguments are crucial building blocks for range proof and zero knowledge arguments, which can be applied to verifiable computation, confidential transactions, decentralized identification, and so on. This paper proposes a novel efficient IP argument with a trustless setup. For integer vectors of size N, the proposed IP argument provides a proof size of O(log2 N), a verification cost of O(√N), and a size of public parameter size of O(√N). The construction uses bilinear pairings and its security relies solely on the discrete logarithm (DL) assumption, a well-established standard cryptographic assumption. Consequently, we obtain the first DL-based IP argument with a trustless setup that achieves a sublinear verifier and logarithmic proof size, which we call Leopard. Furthermore, We empirically evaluate the performance of Leopard. The experimental results demonstrate that Leopard is highly efficient and scalable compared to previous works.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 5332-5344
Leopard: Sublinear Verifier Inner Product Argument Under Discrete Logarithm Assumption
An inner product (IP) argument is a proof system that convinces the verifier of an IP relation between committed integer vectors. IP arguments are crucial building blocks for range proof and zero knowledge arguments, which can be applied to verifiable computation, confidential transactions, decentralized identification, and so on. This paper proposes a novel efficient IP argument with a trustless setup. For integer vectors of size N, the proposed IP argument provides a proof size of O(log2 N), a verification cost of O(√N), and a size of public parameter size of O(√N). The construction uses bilinear pairings and its security relies solely on the discrete logarithm (DL) assumption, a well-established standard cryptographic assumption. Consequently, we obtain the first DL-based IP argument with a trustless setup that achieves a sublinear verifier and logarithmic proof size, which we call Leopard. Furthermore, We empirically evaluate the performance of Leopard. The experimental results demonstrate that Leopard is highly efficient and scalable compared to previous works.
- 1 January 2022
- Published by Springer Nature
- p. 403-433
Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
- 1 January 2022
- Published by Springer Nature
- p. 403-433
Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
- Open Access
- 6 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 164047-164059
Efficient Sum-Check Protocol for Convolution
Many applications have recently adopted machine learning and deep learning techniques. Convolutional neural networks (CNNs) are made up of sequential operations including activation, pooling, convolution, and fully connected layer, and their computation cost is enormous, with convolution and fully connected layer dominating. In general, a user with insufficient computer capacity delegated certain tasks to a server with sufficient computing power, and the user may want to verify that the outputs are truly machine learning model predictions. In this paper, we are interested in verifying that the delegation of CNNs, one of the deep learning models for image recognition and classification, is correct. Specifically, we focus on the verifiable computation of matrix multiplications in a CNN convolutional layer. We use Thaler’s idea (CRYPTO 2013) for validating matrix multiplication operations and present a predicate function based on the insight that the sequence of operations can be viewed as sequential matrix multiplication. Furthermore, we lower the cost of proving by splitting a convolution operation into two halves. As a result, we can provide an efficient sum-check protocol for a convolution operation that, like the state-of-the-art zkCNN (ePrint 2021) approach, achieves asymptotically optimal proving cost. The suggested protocol is about 2× cheaper than zkCNN in terms of communication costs. We also propose a verified inference system based on our method as the fundamental building component.
- 6 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 164047-164059
Open AccessEfficient Sum-Check Protocol for Convolution
Many applications have recently adopted machine learning and deep learning techniques. Convolutional neural networks (CNNs) are made up of sequential operations including activation, pooling, convolution, and fully connected layer, and their computation cost is enormous, with convolution and fully connected layer dominating. In general, a user with insufficient computer capacity delegated certain tasks to a server with sufficient computing power, and the user may want to verify that the outputs are truly machine learning model predictions. In this paper, we are interested in verifying that the delegation of CNNs, one of the deep learning models for image recognition and classification, is correct. Specifically, we focus on the verifiable computation of matrix multiplications in a CNN convolutional layer. We use Thaler’s idea (CRYPTO 2013) for validating matrix multiplication operations and present a predicate function based on the insight that the sequence of operations can be viewed as sequential matrix multiplication. Furthermore, we lower the cost of proving by splitting a convolution operation into two halves. As a result, we can provide an efficient sum-check protocol for a convolution operation that, like the state-of-the-art zkCNN (ePrint 2021) approach, achieves asymptotically optimal proving cost. The suggested protocol is about 2× cheaper than zkCNN in terms of communication costs. We also propose a verified inference system based on our method as the fundamental building component.