4 citations · 4 across the 5 of their papers we have counts for
1 paper · 1 filter
Bruno Cavalar, Eli Goldin, Matthew Gray +3
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generato…