One-Time Computable Self-erasing Functions
From MaRDI portal
Publication:3000536
DOI10.1007/978-3-642-19571-6_9zbMath1295.94061OpenAlexW1569144247MaRDI QIDQ3000536
Daniel Wichs, Tomasz Kazana, Stefan Dziembowski
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
Related Items (12)
Static-memory-hard functions, and modeling the cost of space vs. time ⋮ One-Time Programs with Limited Memory ⋮ Proof of Space from Stacked Expanders ⋮ Proofs of Space ⋮ Unclonable polymers and their cryptographic applications ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ Individual cryptography ⋮ The cost of adaptivity in security games on graphs ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable Codes with Split-State Refresh ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Formalizing data deletion in the context of the right to be forgotten
This page was built for publication: One-Time Computable Self-erasing Functions
