How to Protect Yourself without Perfect Shredding

DOI10.1007/978-3-540-70583-3_42MaRDI QIDQ3519529zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Dror Eiger, Dah-Yoh Lim, Shafi Goldwasser

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_42

zbMATH Keywords

adaptive securityforward securityintrusion resiliencemobile adversarypartial erasuresproactive securityrandomness extractorssecure multiparty computationuniversal hashing

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1304335
• One-time computable self-erasing functions
• Memory erasability amplification
• Adaptively secure computation with partial erasures
• Adaptively Secure Two-Party Computation with Erasures

Cited in

(8)

• Memory erasability amplification
• Fully automated and hidden system for wiping sensitive data
• Mind your coins: fully leakage-resilient signatures with graceful degradation
• A Leakage-Resilient Mode of Operation
• scientific article; zbMATH DE number 1304335 (Why is no real title available?)
• On the number of shredders
• Continuously non-malleable codes against bounded-depth tampering
• Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model

This page was built for publication: How to Protect Yourself without Perfect Shredding

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