Maria Chroni

Learn More
In a software watermarking environment, several graph theoretic watermark methods use integers as watermark values, where some of these methods encode the watermark integers as reducible permutation graphs (RPG; these are reducible control-flow graphs with a maximum out-degree of two). Since there is a one-to-one correspondence between self-inverting(More)
In this paper we propose an efficient and easily implemented codec system for encoding watermark numbers as reducible permutation flow-graphs. More precisely, in light of our recent encoding algorithms which encode a watermark value w as a self-inverting permutation π*, we present an efficient algorithm which encodes a self-inverting permutation(More)
In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. In this paper we extended the class of graphs which can be efficiently used in a software watermarking system by proposing an efficient codec system, i.e., encoding and decoding algorithms(More)
In a software watermarking environment, several graph theoretic watermark methods use numbers as watermark values, where some of these methods encode the watermark numbers as graph structures. In this paper we extended the class of error correcting graphs by proposing an efficient and easily implemented codec system for encoding watermark numbers as(More)
Information hiding is widely used in almost all intelligence and security software systems as a standard technology to prevent piracy and copyright infringement. This technology mainly involves the idea of digital watermarking where a unique identifier (or, watermark number) is embedded into software, image, audio, or video data through the introduction of(More)
In this work we propose efficient codec algorithms for watermarking images that are intended for uploading on the web under intellectual property protection. Headed to this direction, we recently suggested a way in which an integer number w which being transformed into a self-inverting permutation, can be represented in a two dimensional (2D) object and(More)
In this paper, we propose an efficient and easily implemented codec system for encoding watermark numbers as graph structures thought the use of self-inverting permutations. More precisely, based on the fact that a watermark number w can be efficiently encoded as self-inverting permutation π∗, we present an efficient encoding algorithm which encodes a(More)
In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. In this paper we first present an efficient codec system for encoding a watermark number w as a reducible permutation graph F[π*] through the use of the self-inverting permutation(More)
Software watermarking involves embedding a unique identifier, i.e., a watermark value, within a software to discourage software theft; to this end, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs using a wide range of algorithmic techniques. In this paper we propose an(More)
The intellectual property infringement in music due to the proliferation of the internet and the ease of creating and distributing identical digital objects has brought watermarking techniques to the forefront of digital rights protection. Towards this direction, a significant number of watermarking techniques have been proposed in recent years in order to(More)