Adaptive One-Way Functions and Applications

Abstract. We introduce new and general complexity theoretic hardumptions. 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 long-standing open problems in cryptography. Keywords. Cryptographic Assumptions, Non-malleable Commitment, Non-malleable Zero-knowledge

• Type: Conference
• Year: 2008
• Where: CRYPTO
• Authors: Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan
• Keywords: Complexity Theoretic Hardumptions, CRYPTO 2008, Cryptographic Assumptions, Cryptographic Hardness Assumptions, Cryptology