IBM Israel Research Seminars

Pseudorandom generators are very central objects in cryptography, with many applications in computer science. In this talk I will introduce these objects and discuss what are the minimal hardness assumptions required in order to obtain such generators. Specifically, I will survey some fundamental results as well as recent works on the connection to one-way functions, or in other words, the ability to generate hard puzzles.

The talk will be self contained and requires no prior knowledge.

Based on joint work with Iftach Haitner and Omer Reingold.

About the Speaker
Danny has recently joined HRL via IBM's Josef Raviv postdoctoral fellowship program, and is now part of the storage systems and performance management group in Tel Aviv. Before arriving at IBM, Danny was a postdoc at the Technion, after graduating from the Weizmann Institute. His field of expertise is the foundations of cryptography and complexity.