How to Protect Yourself without Perfect Shredding

DOI10.1007/978-3-540-70583-3_42zbMath1155.68383OpenAlexW1530181486MaRDI QIDQ3519529

Ran Canetti, Dah-Yoh Lim, Dror Eiger

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

universal hashingadaptive securitysecure multiparty computationrandomness extractorsforward securitymobile adversaryproactive securityintrusion resiliencepartial erasures

Mathematics Subject Classification ID

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

Related Items (5)

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ A Leakage-Resilient Mode of Operation ⋮ Memory Erasability Amplification

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