Events

Faculty Candidate Talk Efficient Cryptographic Computation for Real-World Programs and People: Advancing Algorithms and Systems
Export Event Save iCal Send to Google Calendar Send to Yahoo Calendar Send to Outlook Live Send to Microsoft Outlook Save iCal Preserve formatting in description (only supported in some calendar applications) Close Tuesday, April 01, 2025, 10:30am - 12:00pm

Speaker: Yibin Yang

Bio

Yibin Yang is a Ph.D. candidate in Computer Science at Georgia Tech, advised by Vladimir Kolesnikov. Yibin’s research focuses on advancing cryptographic protocols, particularly in Zero-Knowledge Proofs (ZKP) and Secure Multi-Party Computation (MPC). He develops next-generation ZKP and MPC systems that enable seamless execution of real-world off-the-shelf programs over encrypted data, bridging the gap between theoretical cryptography and practical deployment. He is a RSAC Security Scholar and a recipient of Distinguished Paper Awards at ACM CCS. Prior to Georgia Tech, Yibin received his B.Eng. in Computer Science at Tsinghua University in 2019.

Location : CoRE 301

Committee: 

Event Type: Faculty Candidate Talk

Abstract: Data sharing is indispensable for operational efficiency and groundbreaking innovation in the information age. However, concerns related to intellectual property rights, strict privacy laws, security risks, and complex data custody often hinder this valuable sharing.For nearly four decades, cryptography has — in principle — provided solutions to address most of these concerns. Zero-Knowledge Proofs (ZKP) allow one party, the prover, to prove any property about its private data to another party, the verifier, without disclosing any additional information. More generally, Secure Multi-Party Computation (MPC) enables multiple mutually untrusting parties to jointly compute arbitrary functions on their private inputs, revealing only the intended output. Despite their strong theoretical guarantees, ZKP and MPC deployments remain rare.The core challenges extend beyond a lack of usable tools and systems. They lie in the absence of efficient cryptographic algorithms capable of handling complex, real-world programs, particularly those expressed using high-level programming languages.In this talk, I will explore these challenges and discuss my work that introduces novel cryptographic algorithms to overcome them. I will present end-to-end practically efficient ZKP and 2PC systems built to directly execute off-the-shelf high-level programs within ZKP or 2PC virtual machines. For example, one can prove in ZK interesting properties (e.g. CVE exploitable bugs) of off-the-shelf Linux programs in a few seconds on a laptop.These advances not only enhance the applicability, usability, and adoption of ZKP and MPC but also open new research opportunities in, e.g., compilers, programming languages, and hardware acceleration.

Organization: 

Contact  Assistant Professor He Zhu

Department Zoom Link and Recording Instructions


Cristina Fowler


​
Cristina Fowler
​
Join Zoom Meeting
https://rutgers.zoom.us/j/2014444359?pwd=WW9ybFNCNVFrUWlycHowSHdNZjhzUT09

Meeting ID: 201 444 4359
Password: 550978