Non-malleable Codes for Decision Trees

Marshall Ball
Marshall Ball
Siyao Guo
Siyao Guo

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, pp. 413-434, 2019.

Cited by: 8|Bibtex|Views26|DOI:https://doi.org/10.1007/978-3-030-26948-7_15
EI
Other Links: dblp.uni-trier.de

Abstract:

We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by decision trees of depth d = n(1/4-o(1)). In particular, each bit of the tampered codeword is set arbitrarily after adaptively reading up to d arbitrary locations within the original codeword. Prior to this work, no efficient u...More

Code:

Data:

Your rating :
0

 

Tags
Comments