Efficient Proofs of Secure Erasure

DOI10.1007/978-3-319-10879-7_30MaRDI QIDQ2922679zbMATH OpenOpenAlexFDO

Authors Nikolaos P. Karvelas, Aggelos Kiayias

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)

Recommendations

• Removing erasures with explainable hash proof systems
• Adaptively secure computation with partial erasures
• Compact proofs of retrievability
• Compact Proofs of Retrievability
• Efficient perfectly secure computation with optimal resilience
• Efficient perfectly secure computation with optimal resilience
• Efficient zero-knowledge proofs. (Abstract)
• Efficient proofs of retrievability using expander codes
• scientific article; zbMATH DE number 2009957
• Efficient fully secure computation via distributed zero-knowledge proofs

Cited in

(8)

• Efficient attribute-based encryption with attribute revocation for assured data deletion
• Formalizing data deletion in the context of the right to be forgotten
• Memory erasability amplification
• Proof of space from stacked expanders
• Secure Code Update for Embedded Devices via Proofs of Secure Erasure
• scientific article; zbMATH DE number 1304335 (Why is no real title available?)
• Just Forget It – The Semantics and Enforcement of Information Erasure
• Cumulative memory lower bounds for randomized and quantum computation

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

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