One-time computable self-erasing functions

DOI10.1007/978-3-642-19571-6_9zbMATH Open1295.94061OpenAlexW1569144247MaRDI QIDQ3000536FDOQ3000536

Authors Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19571-6_9

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• One-Time Programs
• On Forward-Secure Storage
• One-time programs with limited memory
• scientific article; zbMATH DE number 1304335
• scientific article; zbMATH DE number 6866300

Cited in

(15)

• How to Protect Yourself without Perfect Shredding
• Depth-robust graphs and their cumulative memory complexity
• Formalizing data deletion in the context of the right to be forgotten
• Proof of space from stacked expanders
• Static-memory-hard functions, and modeling the cost of space vs. time
• Bandwidth-Hard Functions: Reductions and Lower Bounds
• Individual cryptography
• Non-malleable Codes with Split-State Refresh
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• The cost of adaptivity in security games on graphs
• Bounded tamper resilience: how to go beyond the algebraic barrier
• One-time programs with limited memory
• Proofs of space
• Memory erasability amplification
• Unclonable polymers and their cryptographic applications

This page was built for publication: One-time computable self-erasing functions

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