Adaptive one-way functions and applications

Omkant Pandey*, Rafael Pass, Vinod Vaikuntanathan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 long-standing open problems in cryptography.

Original languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings
Number of pages18
StatePublished - 2008
Externally publishedYes
Event28th Annual International Cryptology Conference, CRYPTO 2008 - Santa Barbara, CA, United States
Duration: 17 Aug 200821 Aug 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5157 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference28th Annual International Cryptology Conference, CRYPTO 2008
Country/TerritoryUnited States
CitySanta Barbara, CA


  • Cryptographic assumptions
  • Non-malleable commitment
  • Non-malleable zero-knowledge


Dive into the research topics of 'Adaptive one-way functions and applications'. Together they form a unique fingerprint.

Cite this