| dc.contributor.advisor | Shafi Goldwasser | en_US |
| dc.contributor.author | Pass, Rafael | en_US |
| dc.contributor.author | Vaikuntanathan, Vinod | en_US |
| dc.contributor.other | Theory of Computation | en_US |
| dc.date.accessioned | 2008-05-05T15:46:14Z | |
| dc.date.available | 2008-05-05T15:46:14Z | |
| dc.date.issued | 2008-04-16 | en_US |
| dc.identifier.other | MIT-CSAIL-TR-2008-022 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41518 | |
| dc.description.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. | en_US |
| dc.format.extent | 28 pp. | en_US |
| dc.relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.relation | | en_US |
| dc.subject | Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge | en_US |
| dc.title | New-Age Cryptography | en_US |
