Abstract

In this talk we will first review some basic notions from Cryoptography (i.e., digital signature schemes and their black-box security in random-oracle model). Then we will show how to use a classical result in combinatorics due to Ballobas to get a tight upper bound on the black-box security of any signature scheme. This is a joint work with Boaz Barak, Princeton University, USA.



Information: