Towards a Provably Resilient Scheme for Graph-Based Watermarking

DOI10.1007/978-3-642-45043-3_6zbMath1417.94093arXiv1302.7262OpenAlexW2963703523MaRDI QIDQ2864290

Lucila Maria Souza Bento, Vinícius Gusmão Pereira de Sá, Davidson R. Boccardo, Raphael C. S. Machado, Jayme Luiz Szwarcfiter

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

algorithmssoftware securitygraph-based watermarkingreducible permutation graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Dijkstra graphs ⋮ On the resilience of canonical reducible permutation graphs ⋮ Encoding watermark numbers as reducible permutation graphs using self-inverting permutations

This page was built for publication: Towards a Provably Resilient Scheme for Graph-Based Watermarking