Memory Erasability Amplification

DOI10.1007/978-3-319-44618-9_6zbMath1400.94129OpenAlexW2899161396MaRDI QIDQ2827713

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

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)

Cites Work

• Adaptively Secure Computation with Partial Erasures
• Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
• How to Protect Yourself without Perfect Shredding
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Memory Erasability Amplification