ICSA Colloquium Talk - Monday 3rd November @ 2pm Title: Security & Privacy through Programmable Cryptography, Compilers, and VerificationAbstract: How can we build large applications that are secure and private? 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.Bio: Alex Ozdemir is a postdoc at MPI-SP with Gilles Barthe and Peter Schwabe. Next year, he will be an assistant professor at Georgia Tech. Previously, he was a PhD student at Stanford with Dan Boneh and Clark Barrett. Before that, he taught high school. Check out Alex’s website at https://cs.stanford.edu/~aozdemir/ Nov 03 2025 14.00 - 15.00 ICSA Colloquium Talk - Monday 3rd November @ 2pm Alex Ozdemir (Georgia Tech) Bayes Theorem (G.03)
ICSA Colloquium Talk - Monday 3rd November @ 2pm Title: Security & Privacy through Programmable Cryptography, Compilers, and VerificationAbstract: How can we build large applications that are secure and private? 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.Bio: Alex Ozdemir is a postdoc at MPI-SP with Gilles Barthe and Peter Schwabe. Next year, he will be an assistant professor at Georgia Tech. Previously, he was a PhD student at Stanford with Dan Boneh and Clark Barrett. Before that, he taught high school. Check out Alex’s website at https://cs.stanford.edu/~aozdemir/ Nov 03 2025 14.00 - 15.00 ICSA Colloquium Talk - Monday 3rd November @ 2pm Alex Ozdemir (Georgia Tech) Bayes Theorem (G.03)
Nov 03 2025 14.00 - 15.00 ICSA Colloquium Talk - Monday 3rd November @ 2pm Alex Ozdemir (Georgia Tech)
