Author(s)Pass, Rafael; Vaikuntanathan, Vinod
Theory of Computation
MetadataShow full item record
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.
Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge