Georgia Institute of Technology
Efficient Zero-Knowledge Proofs for Real-World Programs
Abstract
dc:description.abstractZero-knowledge proofs (ZKPs) allow a prover to convince a verifier of the validity of a statement without revealing any information beyond its truth. Since their introduction in 1985 by Shafi Goldwasser, Silvio Micali, and Charles Rackoff, ZKPs have become foundational in both theoretical and applied cryptography. Most existing ZKPs operate over the circuit model. While circuits offer a clean abstraction for theoretical analysis, they diverge significantly from how real-world computation is expressed---namely, via high-level programming languages. As a result, applying ZKPs to real-world programs incurs substantial overhead in terms of both efficiency and usability. This dissertation aims to discuss why these inefficiencies exist, how they hinder broader adoption of ZKPs, and, more importantly, how we can mitigate them through new cryptographic systems and algorithmic advances.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Computer Science
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yang, Yibin
- Advisor dc:contributor.advisor
-
- Kolesnikov, Vladimir
- Committee members dc:contributor.committeemember
-
- Boldyreva, Alexandra
- Hazay, Carmit
- Jaeger, Joseph
- Kim, Taesoo
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1853/78667