Previous Events

• (Nov 2024) I gave a talk, How to Design a Zero-Knowledge Proof System in the Discrete Logarithm Setting, at the Hanyang Mathematics Colloquium in Seoul.

• (Oct 2024) Won an Excellence Prize at the National Cryptographic Technology Contest, 2024.
  UTRA: Universal Token Reusability Attack and Verifiable Delegatable Order-Revealing Encryption
  Hyeonbum Lee, Jaehwan Park, Junbeom Hur, Jae Hong Seo, and Doowon Kim.

• (Aug 2023) Presented TENET: Sublogarithmic Proof, Sublinear Verifier Inner Product Argument without a Trusted Setup at IWSEC 2023 in Yokohama, Japan.

• (Jul 2023) One paper published at IEEE TIFS.
  Sublinear Verifier Inner Product Argument under Discrete Logarithm Assumption
  Sungwook Kim, Hyeonbum Lee, Gwangwoon Lee, and Jae Hong Seo.

• (Mar 2023) Finished my visiting program at the University of Notre Dame (Sep 2022 – Feb 2023), hosted by Professor Taeho Jung.

• (Dec 2022) Presented Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier at ASIACRYPT 2022 in Taipei, Taiwan.

• (Sep 2022) Won the Grand Prize at the National Cryptographic Technology Contest, 2022.
  Non-Pairing Sublinear Verifiable Zero-Knowledge Arguments in Discrete Logarithm Setting
  Hyeonbum Lee, Sungwook Kim, and Jae Hong Seo.

• (Dec 2021) One paper published at IEEE Access.
  Efficient Sum-Check Protocol for Convolution
  Chanyang Ju, Hyeonbum Lee, Heewon Chung, Jae Hong Seo, and Sungwook Kim.

• (Oct 2021) Won a Special Prize at the National Cryptographic Technology Contest, 2021.
  Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
  Hyeonbum Lee and Jae Hong Seo.

• (Sep 2021) Joined a new project supported by the Samsung Science & Technology Foundation (Secure Multi-party Approximate Computation).

• (Apr 2021) Joined a new project supported by the Institute for Information and Communications Technology Promotion, IITP (Study on Crypto Primitives for SNARK).