Adaptive one-way functions and applications

Omkant Pandey; Rafael Pass; Vinod Vaikuntanathan

doi:10.1007/978-3-540-85174-5_4

Adaptive one-way functions and applications

Omkant Pandey
, Rafael Pass
, Vinod Vaikuntanathan

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

78 Scopus citations

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.

Original language	English
Title of host publication	Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings
Pages	57-74
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-540-85174-5_4
State	Published - 2008
Event	28th Annual International Cryptology Conference, CRYPTO 2008 - Santa Barbara, CA, United States Duration: Aug 17 2008 → Aug 21 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5157 LNCS

Conference

Conference	28th Annual International Cryptology Conference, CRYPTO 2008
Country/Territory	United States
City	Santa Barbara, CA
Period	08/17/08 → 08/21/08

Keywords

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

Access to Document

10.1007/978-3-540-85174-5_4

Cite this

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

@inproceedings{86120532e48a4c389cb91fb635c55901,

title = "Adaptive one-way functions and applications",

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.",

keywords = "Cryptographic assumptions, Non-malleable commitment, Non-malleable zero-knowledge",

author = "Omkant Pandey and Rafael Pass and Vinod Vaikuntanathan",

year = "2008",

doi = "10.1007/978-3-540-85174-5\_4",

language = "English",

isbn = "3540851739",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "57--74",

booktitle = "Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings",

note = "28th Annual International Cryptology Conference, CRYPTO 2008 ; Conference date: 17-08-2008 Through 21-08-2008",

}

Pandey, O, Pass, R & Vaikuntanathan, V 2008, Adaptive one-way functions and applications. in Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5157 LNCS, pp. 57-74, 28th Annual International Cryptology Conference, CRYPTO 2008, Santa Barbara, CA, United States, 08/17/08. https://doi.org/10.1007/978-3-540-85174-5_4

Adaptive one-way functions and applications. / Pandey, Omkant; Pass, Rafael; Vaikuntanathan, Vinod.
Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings. 2008. p. 57-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5157 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Adaptive one-way functions and applications

AU - Pandey, Omkant

AU - Pass, Rafael

AU - Vaikuntanathan, Vinod

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Cryptographic assumptions

KW - Non-malleable commitment

KW - Non-malleable zero-knowledge

UR - https://www.scopus.com/pages/publications/51849154718

U2 - 10.1007/978-3-540-85174-5_4

DO - 10.1007/978-3-540-85174-5_4

M3 - Conference contribution

SN - 3540851739

SN - 9783540851738

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 57

EP - 74

BT - Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings

T2 - 28th Annual International Cryptology Conference, CRYPTO 2008

Y2 - 17 August 2008 through 21 August 2008

ER -

Adaptive one-way functions and applications

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this