Non-Malleable Codes Against Bounded Polynomial Time Tampering.
Marshall BallDana Dachman-SoledMukul KulkarniHuijia LinTal MalkinPublished in: IACR Cryptol. ePrint Arch. (2018)
Keyphrases
- bounded treewidth
- digital images
- reverse engineering
- special case
- error correction
- truth table
- worst case
- copyright protection
- approximation algorithms
- np complete
- watermarking scheme
- upper bound
- neural network
- jpeg compression
- authentication scheme
- error control
- forensic analysis
- fixed parameter tractable
- hypertree decomposition
- computational complexity