An Infinitely-Often One-Way Function Based on an Average-Case Assumption

DOI10.1007/978-3-540-69937-8_18MaRDI QIDQ3511459zbMATH OpenOpenAlexFDO

Authors Edward A. Hirsch, Dmitry Itsykson

Publication date 10 July 2008

Published in Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69937-8_18

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• An infinitely-often one-way function based on an average-case assumption
• On basing one-way functions on NP-hardness
• On building fine-grained one-way functions from strong average-case hardness
• scientific article; zbMATH DE number 4125016
• Absolute results concerning one-way functions and their applications

Cites work

• Average Case Complete Problems
• Foundations of Cryptography
• scientific article; zbMATH DE number 5081744 (Why is no real title available?)
• The tale of one-way functions

Cited in

(4)

• On building fine-grained one-way functions from strong average-case hardness
• An infinitely-often one-way function based on an average-case assumption
• Coin flipping of any constant bias implies one-way functions
• On building fine-grained one-way functions from strong average-case hardness

This page was built for publication: An Infinitely-Often One-Way Function Based on an Average-Case Assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511459)