|
Title:
|
New-Age Cryptography |
|
Author:
|
Pass, Rafael; Vaikuntanathan, Vinod |
|
Other Contributors:
|
Theory of Computation |
|
Advisor:
|
Shafi Goldwasser |
|
Issue Date:
|
2008-04-16 |
|
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. |
|
URI:
|
http://hdl.handle.net/1721.1/41518
|
|
Other Identifiers:
|
MIT-CSAIL-TR-2008-022 |
|
Related To
|
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
|
|
Keywords:
|
Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge |
