BiTR: Built-in Tamper Resilience

DOI10.1007/978-3-642-25385-0_40zbMath1227.94038OpenAlexW2166362740MaRDI QIDQ3102219

Aggelos Kiayias, Tal Malkin, Seung Geol Choi

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_40

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ The Chaining Lemma and Its Application ⋮ On the impossibility of cryptography with tamperable randomness ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Locally decodable and updatable non-malleable codes and their applications

This page was built for publication: BiTR: Built-in Tamper Resilience