Skip to main content
Conference ProceedingsOPEN ACCESS

Adaptive one-way functions and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5157 LNCS 57-74
DOI: 10.1007/978-3-540-85174-5_4
73Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.

This article is free to access.

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 long-standing open problems in cryptography. © International Association for Cryptologic Research 2008.

Author supplied keywords

Cite

CITATION STYLE

APA

Pandey, O., Pass, R., & Vaikuntanathan, V. (2008). Adaptive one-way functions and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5157 LNCS, pp. 57–74). https://doi.org/10.1007/978-3-540-85174-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free