Abstract
We survey the computational foundations for public-key cryptography. We discuss the computational assumptions that have been used as bases for publickey encryption schemes, and the types of evidence we have for the veracity of these assumptions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Barak, B. (2017). The Complexity of Public-Key Cryptography. In: Lindell, Y. (eds) Tutorials on the Foundations of Cryptography. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-57048-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-57048-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57047-1
Online ISBN: 978-3-319-57048-8
eBook Packages: Computer ScienceComputer Science (R0)