Show simple item record

New-Age Cryptography

dc.date.accessioned2008-05-05T15:46:14Z
dc.date.accessioned2018-11-26T22:25:16Z
dc.date.available2008-05-05T15:46:14Z
dc.date.available2018-11-26T22:25:16Z
dc.date.issued2008-04-16en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/41518
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/41518
dc.description.abstractWe 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.extent28 pp.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.subjectCryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledgeen_US
dc.titleNew-Age Cryptographyen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2008-022.pdf296.1Kbapplication/pdfView/Open
MIT-CSAIL-TR-2008-022.ps73.87Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record