One-time computable self-erasing functions

DOI10.1007/978-3-642-19571-6_9MaRDI QIDQ3000536zbMATH OpenOpenAlexFDO

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

(17)

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

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)