Non-malleable codes from additive combinatorics

SIAM J. Comput., Volume 47, Issue 2, 2018, Pages 524-546.

Cited by: 125|Bibtex|Views49|Links
EI
Keywords:
algorithmsdesigncombinatoricstheorynumerical algorithms and problemsMore(1+)

Abstract:

Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional errorcorrection (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either the orig...More

Code:

Data:

Your rating :
0

 

Tags
Comments