scientific article; zbMATH DE number 6820220

DOI10.4230/LIPIcs.ICALP.2016.31zbMath1377.94041MaRDI QIDQ4598167

Jalaj Upadhyay, Pratyay Mukherjee, Vipul Goyal, Nishanth Chandran, Omkant Pandey

Publication date: 19 December 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

non-malleable commitmentsnon-malleable codesblock-wise tamperingcomplexity-leveraging

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Non-malleable codes for bounded parallel-time tampering ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Interactive non-malleable codes ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ 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 ⋮ Optimal Computational Split-state Non-malleable Codes

This page was built for publication: