Hadas Zeilberger
Yale University
hadas.zeilberger@yale.edu
Bio
Hadas Zeilberger is a fourth year PhD student in the Yale Applied Cryptography Laboratory, where she explores the theory and practice of cryptographic proof systems. Prior to starting her PhD, she worked as a cryptographic engineer at SRI International. She holds a BA in mathematics from Columbia University.
Areas of Research
- Theoretical Computer Science
Practical Proof Systems From Error-Correcting Codes
Succinct Non-Interactive Arguments of Knowledge (SNARKs) enable an untrusted prover to convince a verifier that they know a witness w such that C(w) = 1, where C is a circuit that is public to both parties. An important use case is the secure outsourcing of a computation to an untrusted server. For example, consider a chatbot powered by a proprietary large language model (LLM), that a user interacts with over the internet. Using a SNARK, the chatbot can provide a certificate verifying the exact inference model it used. Then, a user will have a cryptographic guarantee that they used the best model for the given task and will be alerted to its biases. While SNARKs have many good use cases, they are still too slow to be used in practice. In my research, I focus on improving the practicality of SNARKs through the use of error-correcting codes.