Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits

DOI10.1109/TIT.2016.2613919zbMath1359.94692OpenAlexW2625364733MaRDI QIDQ2976439

Daniele Venturi, Daniel Wichs, Sebastian Faust, Pratyay Mukherjee

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2016.2613919

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Analytic circuit theory (94C05)

Related Items (5)

Non-malleable codes for bounded parallel-time tampering ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Continuously non-malleable codes with split-state refresh ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties

This page was built for publication: Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits