Welcome to the resource topic for 2017/365
Title:
The Complexity of Public-Key Cryptography
Authors: Boaz Barak
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 survey/tutorial was published in the book “Tutorials on the Foundations of Cryptography”, dedicated to Oded Goldreich on his 60th birthday.
ePrint: https://eprint.iacr.org/2017/365
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .