Hyeonbum Lee

Paper 2024/232 , Hanyang University , Hanyang University Nova is a new type of recursive proof system that uses folding scheme as its core building block. This brilliant idea of folding relations can significantly reduce recursion overhead. In this paper, we study some issues related to Nova's soundness proof that relies on the soundness of the folding scheme in a recursive manner.

Paper 2023/478 TENET : Sublogarithmic Proof, Sublinear Verifier Inner Product Argument without a Trusted Setup Hyeonbum Lee , Hanyang University Jae Hong Seo , Hanyang University Abstract We propose a new inner product argument (IPA), called TENET, which features sublogarithmic proof size and sublinear verifier without a trusted setup.

Paper 2021/1450 Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier Abstract We propose three interactive zero-knowledge arguments for arithmetic circuit of size $N$ in the common random string model, which can be converted to be non-interactive by Fiat-Shamir heuristics in the random oracle model. First argument features $O(\sqrt{\log N})$ communication and round complexities and $O(N)$ computational complexity for the verifier.