Abstract
Software watermarking is a defense technique used to prevent or discourage software piracy by embedding a signature in the code. In (Discrete Applied Mathematics 250 (2018) 145–164), a software watermarking system is presented which encodes an integer number w (i.e., a watermark) as a reducible permutation flow-graph F [ π ∗ ] embeddable in the code through the use of a self-inverting permutation π ∗ . In this work, we theoretically investigate this watermarking system and exploit structural properties of the self-inverting permutation π ∗ encoding the watermark in order to prove its resilience to edge-modification attacks on the flow-graph F [ π ∗ ]. Based on the minimum number of edge modifications needed to be applied on F [ π ∗ ] so that a different watermark can be extracted from the resulting graph, we give a characterization of the watermarks as strong, intermediate or weak and provide good recommendations for the choices of watermark.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.