Memory erasability amplification

DOI10.1007/978-3-319-44618-9_6MaRDI QIDQ2827713zbMATH OpenOpenAlexFDO

Authors Jan Camenisch, Robert R. Enderlein, Ueli M. Maurer

Publication date 21 October 2016

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-44618-9_6

zbMATH Keywords

constructive cryptographyadaptive corruptionall-or-nothing-transforms (AoNT)secure deletionsecure memory erasure

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1304335
• scientific article; zbMATH DE number 1722684
• Efficient Proofs of Secure Erasure
• How to Protect Yourself without Perfect Shredding
• One-time computable self-erasing functions

Cites work

• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• scientific article; zbMATH DE number 1304335 (Why is no real title available?)
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Adaptively secure computation with partial erasures
• Constructive cryptography -- a new paradigm for security definitions and proofs
• Exposure-resilient functions and all-or-nothing transforms
• How to Protect Yourself without Perfect Shredding
• Introduction to modern cryptography

Cited in

(2)

• Just Forget It – The Semantics and Enforcement of Information Erasure
• How to Protect Yourself without Perfect Shredding

This page was built for publication: Memory erasability amplification

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