Non-Malleable Codes
From MaRDI portal
Publication:4561508
DOI10.1145/3178432zbMath1409.94869OpenAlexW2164908759WikidataQ99673000 ScholiaQ99673000MaRDI QIDQ4561508
Stefan Dziembowski, Daniel Wichs, Krzysztof Pietrzak
Publication date: 6 December 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3178432
Related Items (43)
Non-malleable functions and their applications ⋮ How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ On the round complexity of black-box secure MPC ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ Secret sharing with statistical privacy and computational relaxed non-malleability ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ One-Time Programs with Limited Memory ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ The Chaining Lemma and Its Application ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Detection of Algebraic Manipulation in the Presence of Leakage ⋮ Algebraic restriction codes and their applications ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Unnamed Item ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Disjoint difference families and their applications ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Affine-evasive sets modulo a prime ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ Unnamed Item ⋮ Continuously non-malleable codes with split-state refresh ⋮ Unnamed Item ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Multi-source non-malleable extractors and applications ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ A new class of security oriented error correcting robust codes ⋮ Non-malleability against polynomial tampering ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
This page was built for publication: Non-Malleable Codes
