Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits

DOI10.1007/978-3-662-49896-5_31zbMath1371.94623OpenAlexW2433413249MaRDI QIDQ5739226

Mukul Kulkarni, Dana Dachman-Soled, Marshall Ball, Tal Malkin

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_31

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

Non-malleable codes for bounded parallel-time tampering ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Interactive non-malleable codes ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Non-malleable Codes with Split-State Refresh ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Continuously non-malleable codes with split-state refresh ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Non-malleability against polynomial tampering

This page was built for publication: Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits