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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (15)

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

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)