| 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.description.provenance |
Submitted by CSAIL Importer (publications-dspace@csail.mit.edu) on 2008-05-05T15:46:13Z
No. of bitstreams: 2
MIT-CSAIL-TR-2008-022.pdf: 296108 bytes, checksum: 2515271266404a6309e1976a1b0da253 (MD5)
MIT-CSAIL-TR-2008-022.ps: 73870 bytes, checksum: c99a2c620bebadcbd5ef66cfe4b844eb (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2008-05-05T15:46:14Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2008-022.pdf: 296108 bytes, checksum: 2515271266404a6309e1976a1b0da253 (MD5)
MIT-CSAIL-TR-2008-022.ps: 73870 bytes, checksum: c99a2c620bebadcbd5ef66cfe4b844eb (MD5)
Previous issue date: 2008-04-16 |
en |
| 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 |
