Non-Malleable Codes Against Bounded Polynomial Time Tampering.
Marshall BallDana Dachman-SoledMukul KulkarniHuijia LinTal MalkinPublished in: EUROCRYPT (1) (2019)
Keyphrases
- bounded treewidth
- digital images
- truth table
- special case
- reverse engineering
- bounded degree
- approximation algorithms
- error correction
- worst case
- computational complexity
- watermarking scheme
- polynomial size
- forensic analysis
- dnf formulas
- copyright protection
- fixed parameter tractable
- authentication scheme
- signal processing
- jpeg compression
- boolean functions
- np complete