Paper 2017/365
The Complexity of Public-Key Cryptography
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.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Minor revision. Book of tutorials in honor of Oded Goldreich's 60th birthday
- Keywords
- Public key encryptionassumptionspost quantum cryptography
- Contact author(s)
- b @ boazbarak org
- History
- 2017-04-28: received
- Short URL
- https://ia.cr/2017/365
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/365, author = {Boaz Barak}, title = {The Complexity of Public-Key Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/365}, year = {2017}, url = {https://eprint.iacr.org/2017/365} }