Full characterization of a class of graphs tailored for software watermarking
DOI10.1007/S00453-019-00557-WzbMATH Open1421.68107OpenAlexW2938947166MaRDI QIDQ2415367FDOQ2415367
Authors: Yanyan Li 
Publication date: 21 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00557-w
Recommendations
- Towards a provably resilient scheme for graph-based watermarking
- On the resilience of canonical reducible permutation graphs
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
- scientific article; zbMATH DE number 1893217
- An abstract interpretation-based framework for software watermarking
Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Theory of software (68N99) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Testing flow graph reducibility
- Characterizations of Reducible Flow Graphs
- Flow Graph Reducibility
- Robust algorithms for restricted domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the resilience of canonical reducible permutation graphs
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
- Error-correcting graphs for software watermarking.
Cited In (6)
- Models and algorithms for graph watermarking
- On the resilience of canonical reducible permutation graphs
- Error-correcting graphs for software watermarking.
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
- Towards a provably resilient scheme for graph-based watermarking
- Title not available (Why is that?)
This page was built for publication: Full characterization of a class of graphs tailored for software watermarking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415367)
