Non-malleable coding against bit-wise and split-state tampering

DOI10.1007/978-3-642-54242-8_19MaRDI QIDQ6826753zbMATH OpenFDO

Authors Mahdi Cheraghchi, Venkatesan Guruswami

Publication date 18 February 2014

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-54242-8_19

zbMATH Keywords

information theorycryptographycoding theoryerror detectionrandomness extractorstamper-resilient storage

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Cited in

(5)

• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection
• Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
• Uniform black-box separations via non-malleable extractors
• Two-source and affine non-malleable extractors for small entropy

This page was built for publication: Non-malleable coding against bit-wise and split-state tampering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826753)