Efficient Proofs of Secure Erasure

DOI10.1007/978-3-319-10879-7_30zbMath1378.94051OpenAlexW409409102MaRDI QIDQ2922679

Aggelos Kiayias, Nikolaos P. Karvelas

Publication date: 14 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10879-7_30

zbMATH Keywords

graph pebblingspace-bounded adversariestime/space tradeoffs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Proof of Space from Stacked Expanders ⋮ Efficient attribute-based encryption with attribute revocation for assured data deletion ⋮ Formalizing data deletion in the context of the right to be forgotten

This page was built for publication: Efficient Proofs of Secure Erasure