2018/12/28 by Anna Mpanti, Mpanti, Anna, Stavros D. Nikolopoulos +3
Computer Science · #Advanced Steganography and Watermarking Techniques #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.1 #G.2.2 #G.2.3 #Internet Traffic Analysis and Secure E-voting #User Authentication and Security Systems
paper · pdf · doi:10.48550/arxiv.1812.11080
openalex publication_date 2018/12/28 · openalex created_date 2019/01/11 · openalex updated_date 2026/07/28
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers w as reducible permutation flow-graphs F[π^*] through the use of self-inverting permutations π^*. Following up on our proposed methods, we theoretically study the oldest one, which we call W-RPG, in order to investigate and prove its resilience to edge-modification attacks on the flow-graphs F[π^*]. In particular, we characterize the integer w≡π^* as strong or weak watermark through the structure of self-inverting permutations π^* which encodes it. To this end, for any integer watermark w ∈ Rn=[2n-1, 2n-1], where n is the length of the binary representation b(w) of w, we compute the minimum number of 01-modifications needed to be applied on b(w) so that the resulting b(w') represents the valid watermark number w'; note that a number w' is called valid (or, true-incorrect watermark number) if w' can be produced by the W-RPG codec system and, thus, it incorporates all the structural properties of π^* ≡ w.