New-Age Cryptography

Author(s)
Pass, Rafael; Vaikuntanathan, Vinod
Thumbnail
DownloadMIT-CSAIL-TR-2008-022.pdf (289.1Kb)
Additional downloads
Other Contributors
Theory of Computation
Advisor
Shafi Goldwasser
Metadata
Show full item record
Abstract
We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; however, assuming their validity we can resolve a number of longstandingopen problems in cryptography.
Date issued
2008-04-16
URI
http://hdl.handle.net/1721.1/41518
Other identifiers
MIT-CSAIL-TR-2008-022
Keywords
Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge
Collections