I'm a fourth-year Ph.D. candidate in CSE at the University of Michigan, advised by Professor Paul Grubbs. I work on applied cryptography; my research focuses on building efficient privacy-preserving systems with zero-knowledge proofs. I solve subtle problems that arise when attempting to ensure privacy, integrity, and efficiency at the same time. Along the way, I also design cryptographic primitives that improve both security guarantees and practicality.

Before diving into a PhD program, I worked three and half years in the software industry, including Kakao Corporation, the largest social media company in South Korea with 60M+ users, and Samsung SDS.

I received a B.S. in Computer Science and Engineering and B.A. in History Education from Seoul National University.

News

Jun 2026 Back at Microsoft Research in Redmond for a second summer internship with the Cryptography group.
Mar 2026 Our paper Haechi: Simple Commitment-based Keyless In-person Verifiable Elections is now on ePrint.
Oct 2025 Gave a talk on ALPACA at UC Berkeley.
Sep 2025 Gave a talk on ALPACA at the University of Maryland.
May 2025 Started a research internship at Microsoft Research in Redmond, mentored by Josh Benaloh and Michael Naehrig.
May 2025 Our paper ALPACA: Anonymous Blocklisting with Constant-Sized Updatable Proofs appeared at IEEE S&P 2025.
May 2025 Received a Recognition for Exceptional Prelim Exams.

Experience

University of Michigan, Ann Arbor, MI
Aug. 2023 – 2028 (Expected)
Graduate Student Research Assistant
  • Built two anonymous moderation systems: (a) ALPACA achieves O(1) proof size and verifier time by designing an unlinkable variant of Incremental Verifiable Computation (IVC); (b) Centaur achieves optimal prover time across usage patterns by enabling dynamic verifiable user-server state synchronization via Non-uniform IVC; 630x speedup on the median Wikipedia workload.
  • Formalized security definitions with security games; proved security with non-trivial game hops and reductions.
Microsoft Research, Redmond, WA
Summers 2025 and 2026
Research Intern, Cryptography Group

Mentors: Josh Benaloh (2025–2026) and Michael Naehrig (2025)

  • (2025) Developed a new zero-knowledge proof scheme that proves a ballot satisfies a voting rule based on the compressed-Sigma technique, enabling a new design of verifiable election with vector commitments.
  • (2025) For a voting with 1M voters and 100 candidates, reduced the bulletin board size from 120GB (SOTA) to 576MB.
  • (2026) Extended the verifiable election scheme to provide post-quantum integrity using BDLOP commitments and d-ary bootstrapping for commitment aggregation.
  • (2026) Developed a new approach to verifiable ranked-choice voting, reducing communication complexity from O(n3) in SOTA to O(n log n) for n candidates.
Kakao Corp., Seongnam, Korea
May. 2021 – Jul. 2023
Software Engineer, Wallet Service Development Part

Kakao offers KakaoTalk, a Korea-based messenger app with 97% market share.

  • Designed and implemented a new platform to securely issue, store, and present users’ identity information, including a prototype of anonymous credential.
  • Implemented features for issuing users’ Kakao public key certificates and generating users’ digital signatures; these are used for two-factor authentication in Korean government and online banking websites.
Samsung SDS, Seoul, Korea
Jan. 2020 – Apr. 2021
Researcher, Blockchain Research Lab
  • Invented and implemented a cryptographic scheme for blockchain that shares actual files only with the owners and stores metadata to the distributed ledger [Korea Patent 10-2020-0059823].
  • Modeled a real-time private blockchain banking system and improved the TPS by 33% through a batch processor and a database connection resource scheduler [Korea Patent 10-2022-0160299].
Jun. 2019 – Dec. 2019
Student Researcher, Blockchain Research Lab
  • Surveyed blockchain consensus algorithms and proposed an evaluation standard that helps determine appropriate consensus algorithms for specific purposes.

Publications

  1. Centaur: A Flexible and Efficient Stateful Anonymous Moderation System
    Jiwon Kim, Abhiram Kothapalli, Paul Grubbs, Ian Miers, and Riad Wahby
    In submission
  2. Haechi: Simple Commitment-based Keyless In-person Verifiable Elections
    Jiwon Kim, Michael Naehrig, Bharath Namboothiry, Olivier Pereira, and Josh Benaloh
    In submission

    Verifiable election systems allow voters to verify that their secret ballots were accurately recorded and counted, while enabling anyone to verify the announced tallies. However, two practical obstacles stand between this guarantee and actual verification. First, public election records can be prohibitively large: for an election with one million ballots, deployed systems may publish more than 100GB of cryptographic data. Second, most existing systems protect ballot privacy through encryption, introducing key management—usually one of the most cumbersome and error-prone components of election administration.

    We present Haechi, a keyless verifiable election scheme for in-person voting, based on cryptographic vector commitments rather than encryption. At the core of Haechi is a new zero-knowledge proof of ballot well-formedness based on Compressed Σ-protocol theory. Our proof scheme proves the validity of an entire ballot using only a logarithmic number of group elements in the number of the ballot options. This allows all of a voter’s selections to be encoded into a single vector commitment.

    With this approach, Haechi reduces the data required for public verification by more than an order of magnitude compared to prior in-person verifiable election systems. Haechi thereby makes verifications for large-scale election considerably more practical. We also give a post-quantum instantiation of Haechi based on lattice commitments, which preserves the same keyless workflow at the cost of larger election records.

  3. ALPACA: Anonymous Blocklisting with Constant-Sized Updatable Proofs
    Jiwon Kim, Abhiram Kothapalli, Orestis Chardouvelis, Riad Wahby, and Paul Grubbs
    In IEEE Symposium on Security and Privacy (S&P), 2025

    In recent years, online anonymity has become increasingly important but is under threat due to the challenges of moderating anonymous spaces. A promising cryptographic solution, known as anonymous blocklisting, allows users to post anonymously while still enabling moderation. Moderation via anonymous blocklisting roughly works by requiring that when users post a message they attach a cryptographic proof that they did not author any posts on a “blocklist”.

    Existing anonymous blocklisting schemes are unfortunately still far from achieving practical performance for large blocklists. This is essentially due to all prior works requiring a user to (cryptographically) reprocess blocklist entries many times. Relatedly, prior works have relatively high verification times and proof sizes.

    In this work, we introduce ALPACA, the first anonymous blocklisting system with the property that a user only needs to do a constant amount of work per blocklist entry. Thus, our scheme has asymptotically optimal performance. Our scheme is also the first to have verification times and proof sizes that are independent of the number of blocklist entries.

    Our key technique is a new variant of incrementally verifiable computation (IVC), designed to ensure anonymity. Along the way, we introduce new definitions to formally establish security. On a mid-range laptop, ALPACA’s proof generation time is always 6.15 seconds and proof size is 25.6KBs. On a server, the verification time is always 400ms.