On Seed-Incompressible Functions

DOI10.1007/978-3-540-78524-8_2MaRDI QIDQ5445496zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Steven Myers, Charles W. Rackoff

Publication date 5 March 2008

Published in Theory of Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
• On the randomness complexity of efficient sampling
• Deterministic random oracles
• scientific article; zbMATH DE number 1775406
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions

Cited in

(10)

• A Leakage-Resilient Mode of Operation
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
• On the correlation intractability of obfuscated pseudorandom functions
• scientific article; zbMATH DE number 697806 (Why is no real title available?)
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
• On the connection between leakage tolerance and adaptive security
• Toward RSA-OAEP without random oracles
• \(k\)-critical graphs in \(P_5\)-free graphs
• Constructing tree decompositions of graphs with bounded gonality

This page was built for publication: On Seed-Incompressible Functions

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