Error-correcting graphs for software watermarking.

DOI10.1007/B93953MaRDI QIDQ5902518zbMATH OpenFDO

Authors Christian S. Collberg, Stephen G. Kobourov, Edward M. Carter, Clark D. Thomborson

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1893217
• Hiding Software Watermarks in Loop Structures
• Towards a provably resilient scheme for graph-based watermarking
• Full characterization of a class of graphs tailored for software watermarking
• scientific article; zbMATH DE number 1919450

Cited in

(9)

• On the resilience of canonical reducible permutation graphs
• Models and algorithms for graph watermarking
• Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
• Dijkstra graphs
• Full characterization of a class of graphs tailored for software watermarking
• Towards a provably resilient scheme for graph-based watermarking
• scientific article; zbMATH DE number 1919450 (Why is no real title available?)
• scientific article; zbMATH DE number 1893217 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2003

This page was built for publication: Error-correcting graphs for software watermarking.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902518)