Date and time: April 18, Friday, 12:15-1:45pm
Location: Rice 109
Title: Black-Box Separation between Cryptographic Primitives
Abstract:
Black-box separations show that certain cryptographic primitives cannot be constructed from others using only black-box access, that is, by treating the underlying primitives as oracles, without relying on their codes. These results are useful for understanding the relative power of cryptographic primitives and for identifying which assumptions are inherently necessary for constructing certain functionalities.
In this talk, I will introduce the notion of black-box separation, with a focus on fully black-box separation. I will also discuss a common proof technique called relativizing reduction and illustrate how it is used to prove separation results.
Bio:
Shiyu is a first-year Ph.D. student in Computer Science at the University of Virginia, advised by Professor Wei-Kai Lin. She is interested in cryptography in general.