Encoding watermark numbers as reducible permutation graphs using self-inverting permutations

DOI10.1016/j.dam.2018.04.021zbMath1398.05099arXiv1712.08482OpenAlexW2962762263MaRDI QIDQ1801057

Maria Chroni, Leonidas Palios, Stavros D. Nikolopoulos

Publication date: 26 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08482

zbMATH Keywords

evaluationwatermarkingstructural propertiesreducible permutation graphspolynomial codec algorithmsself-inverting permutations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Flows in graphs (05C21)

Related Items (2)

Full characterization of a class of graphs tailored for software watermarking ⋮ On the resilience of canonical reducible permutation graphs

Cites Work

• Maximal incompleteness as obfuscation potency
• Towards a Provably Resilient Scheme for Graph-Based Watermarking
• An abstract interpretation-based framework for software watermarking
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Encoding watermark numbers as reducible permutation graphs using self-inverting permutations