Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR17-065 | 20th April 2017 18:33

The Complexity of Public-Key Cryptograph

RSS-Feed




TR17-065
Authors: Boaz Barak
Publication: 20th April 2017 18:33
Downloads: 487
Keywords: 


Abstract:

We survey the computational foundations for public-key cryptography. We discuss the computational assumptions that have been used as bases for public-key encryption schemes, and the types of evidence we have for the veracity of these assumptions.

This is a survey that appeared in a book of surveys in honor of Oded Goldreich's 60th birthday.



ISSN 1433-8092 | Imprint