SCS Faculty Candidate - Alex Ozdemir

Location:
In Person and Virtual - ET - Newell-Simon 4305 and Zoom

Speaker:
ALEX OZDEMIR, Ph.D. Student, Computer Science Department, Stanford University
https://cs.stanford.edu/~aozdemir/

How can we build large applications with strong security and privacy? How can we balance complexity of the application's logic with the complexity of the cryptographic tools needed to achieve security? 

In this talk, I will discuss an answer to this question: the programmable cryptography stack. A programmable cryptosystem allows a developer to build applications that securely compute over encrypted, secret, or distributed data. The programmable cryptography stack allows developers to express these secure applications using high level abstractions. I will discuss three of my contributions to the programmable cryptography stack in the domains of cryptography, compilers, and formal verification. 

— 

Alex Ozdemir is a PhD student at Stanford advised by Dan Boneh and Clark Barrett. His work combines ideas from cryptography, compilers, and verification. He and his collaborators have published 18 papers at top-tier venues in computer security, verification, and distributed systems, and they won the Best Tool Paper award at TACAS 2022. 

Faculty Hosts: Wenting Zheng, Fraser Brown 

In Person and Zoom Participation.  See announcement.

Add event to Google
Add event to iCal