Database relation watermarking resilient against secondary watermarking attacks

There has been tremendous interest in watermarking multimedia content during the past two decades, mainly for proving ownership and detecting tamper. Digital fingerprinting, that deals with identifying malicious user(s), has also received significant attention. While extensive work has been carried out in watermarking of images, other multimedia objects still have enormous research potential. Watermarking database relations is one of the several areas which demand research focus owing to the commercial implications of database theft. Recently, there has been little progress in database watermarking, with most of the watermarking schemes modeled after the irreversible database watermarking scheme proposed by Agrawal and Kiernan. Reversibility is the ability to re-generate the original (unmarked) relation from the watermarked relation using a secret key. As explained in our paper, reversible watermarking schemes provide greater security against secondary watermarking attacks, where an attacker watermarks an already marked relation in an attempt to erase the original watermark. This paper proposes an improvement over the reversible and blind watermarking scheme presented in [5], identifying and eliminating a critical problem with the previous model. Experiments showing that the average watermark detection rate is around 91% even with attacker distorting half of the attributes. The current scheme provides security against secondary watermarking attacks.

Source code watermarking based on function dependency oriented sequencing

In the current market, extensive software development is taking place and the software industry is thriving. Major software giants have stated source code theft as a major threat to revenues. By inserting an identity-establishing watermark in the source code, a company can prove it's ownership over the source code. In this paper, we propose a watermarking scheme for C/C++ source codes by exploiting the language restrictions. If a function calls another function, the latter needs to be defined in the code before the former, unless one uses function pre-declarations. We embed the watermark in the code by imposing an ordering on the mutually independent functions by introducing bogus dependency. Removal of dependency by the attacker to erase the watermark requires extensive manual intervention thereby making the attack infeasible. The scheme is also secure against subtractive and additive attacks. Using our watermarking scheme, an n-bit watermark can be embedded in a program having n independent functions. The scheme is implemented on several sample codes and performance changes are analyzed.

Reversible and blind database watermarking using difference expansion

Database watermarking has received significant research attention in the current decade. Although, almost all watermarking models have been either irreversible (the original relation cannot be restored from the watermarked relation) and/or non-blind (requiring original relation to detect the watermark in watermarked relation). This model has several disadvantages over reversible and blind watermarking (requiring only watermarked relation and secret key from which the watermark is detected and original relation is restored) including inability to identify rightful owner in case of successful secondary watermarking, inability to revert the relation to original data set (required in high precision industries) and requirement to store unmarked relation at a secure secondary storage. To overcome these problems, we propose a watermarking scheme that is reversible as well as blind. We utilize difference expansion on integers to achieve reversibility. The major advantages provided by our scheme are reversibility to high quality original data set, rightful owner identification, resistance against secondary watermarking attacks, and no need to store original database at a secure secondary storage.

Fetal Alcohol Spectrum Disorder diagnosis and counselling

The Foetal Alcohol Syndrome has long gone unrecognised and undiagnosed in Australia. In the last few years of the 21st Century (2010-14) health practitioners are finally seeking ways of diagnosing the effects of alcohol in pregnancy on the next generation. The author offers a power point presentation which gives guidance on making an accurate diagnosis.

Cancer : the to and fro of tumour spread

The spread of cells from the primary site of a solid tumour to distant sites remains the major cause of disease and death associated with these cancers. For tumour cells to spread, or metastasize, they must modify their 'anchored' state and detach from their neighbouring cells; migrate through tissues into the blood and lymph systems; survive in these circulation systems; and then leave the vessels at an appropriate site to form another tumour1. Many of these events are favoured by conversions between two cellular states — the epithelial and mesenchymal phenotypes. But the role of these transitions in cancer metastasis is controversial. Writing in Cancer Cell, Tsai et al.2 and Ocaña et al.3 help to clarify this issue...

Polarized infrared absorption spectrum of matrix-isolated methylperoxyl radicals, CH3OO (X)over-tilde 2A ''

We have used a tandem pair of supersonic nozzles to produce clean samples of CH3OO radicals in cryogenic matrices. One hyperthermal nozzle decomposes azomethane (CH3NNCH3) to generate intense pulses of CH3 radicals, While the second nozzle alternately fires a burst Of O-2/Ar at the 20 K matrix. The CH3/O-2/20 K argon radical sandwich acts to produce target methylperoxyl radicals: CH3 + O-2 --> CH3OO. The absorption spectra of the radicals are monitored with a Fourier transform infrared spectrometer. We report 10 of the 12 fundamental infrared bands of the methylperoxyl radical CH3OO, (X) over tilde (2)A", in an argon matrix at 20 K. The experimental frequencies (cm(-1)) and polarizations follow: the a' modes are 3032, 2957, 1448, 1410, 1180, 1109, 90, 492, while the a" modes are 3024 and 1434. We cannot detect the asymmetric CH3 rocking mode, nu(11), nor the torsion, nu(12). The infrared spectra of (CH3OO)-O-18-O-18, (CH3OO)-C-13, and CD3OO have been measured as well in order to determine the isotopic shifts. The experimental frequencies, {nu}, for the methylperoxyl radicals are compared to harmonic frequencies, {omega}, resulting from a UB3LYP/6-311G(d,p) electronic structure calculation. Linear dichroism spectra were measured with photooriented radical samples in order to establish the experimental polarizations of most vibrational bands. The methylperoxyl radical matrix frequencies listed above are within +/-2% of the gas-phase vibrational frequencies. A final set of vibrational frequencies for the H radical, are recommended. See also http://ellison.colorado.edu/methylperoxyl.

An attack-localizing watermarking scheme for natural language documents

We present a text watermarking scheme that embeds a bitstream watermark Wi in a text document P preserving the meaning, context, and flow of the document. The document is viewed as a set of paragraphs, each paragraph being a set of sentences. The sequence of paragraphs and sentences used to embed watermark bits is permuted using a secret key. Then, English language sentence transformations are used to modify sentence lengths, thus embedding watermarking bits in the Least Significant Bits (LSB) of the sentences’ cardinalities. The embedding and extracting algorithms are public, while the secrecy and security of the watermark depends on a secret key K. The probability of False Positives is extremely small, hence avoiding incidental occurrences of our watermark in random text documents. Majority voting provides security against text addition, deletion, and swapping attacks, further reducing the probability of False Positives. The scheme is secure against the general attacks on text watermarks such as reproduction (photocopying, FAX), reformatting, synonym substitution, text addition, text deletion, text swapping, paragraph shuffling and collusion attacks.

Planning to Learn : Creating and Using a Personal Planner with Young People on the Autism Spectrum

Late intervention often means that young people on the autism spectrum appear to act on impulse, seem disorganized, or fail to learn from past experiences. In this practical, effective resource, the authors share tried and tested techniques for creating and using a personal planner to help individuals on the autism spectrum to develop independence. "Planning to Learn" is split into three parts. The first part guides adults in helping young people to make sense of the world and to develop and practise coping strategies for any given situation. The authors also explain how simple visual and verbal cues can help people to cope successfully in stressful situations. The second part provides worksheets for the young person to complete to learn how to use plans in different situations, for example staying calm when waiting for a doctor, or coping with a change in the school timetable. Each individual makes a unique planner with procedures to refer to, such as responding to pressure, calming down, being organised, and being around people. The third part includes useful cards, schedules and plans for photocopying and including in the planner. This illustrated photocopiable workbook is packed with guidance, support and helpful notes for those new to, or experienced in, working with children and young people with ASD. It can be used within educational and community settings or at home.

Efficiency of lexical access in children with autism spectrum disorders : does modality matter?

The provision of visual support to individuals with an autism spectrum disorder (ASD) is widely recommended. We explored one mechanism underlying the use of visual supports: efficiency of language processing. Two groups of children, one with and one without an ASD, participated. The groups had comparable oral and written language skills and nonverbal cognitive abilities. In two semantic priming experiments, prime modality and prime–target relatedness were manipulated. Response time and accuracy of lexical decisions on the spoken word targets were measured. In the first uni-modal experiment, both groups demonstrated significant priming effects. In the second experiment which was cross-modal, no effect for relatedness or group was found. This result is considered in the light of the attentional capacity required for access to the lexicon via written stimuli within the developing semantic system. These preliminary findings are also considered with respect to the use of visual support for children with ASD.

Nano-scale morphology and electron spectrum of defect states in low-k SiOCH films

Results of experimental investigations on the relationship between nanoscale morphology of carbon doped hydrogenated silicon-oxide (SiOCH) low-k films and their electron spectrum of defect states are presented. The SiOCH films have been deposited using trimethylsilane (3MS) - oxygen mixture in a 13.56 MHz plasma enhanced chemical vapor deposition (PECVD) system at variable RF power densities (from 1.3 to 2.6 W/cm2) and gas pressures of 3, 4, and 5 Torr. The atomic structure of the SiOCH films is a mixture of amorphous-nanocrystalline SiO2-like and SiC-like phases. Results of the FTIR spectroscopy and atomic force microscopy suggest that the volume fraction of the SiC-like phase increases from ∼0.2 to 0.4 with RF power. The average size of the nanoscale surface morphology elements of the SiO2-like matrix can be controlled by the RF power density and source gas flow rates. Electron density of the defect states N(E) of the SiOCH films has been investigated with the DLTS technique in the energy range up to 0.6 eV from the bottom of the conduction band. Distinct N(E) peaks at 0.25 - 0.35 eV and 0.42 - 0.52 eV below the conduction band bottom have been observed. The first N(E) peak is identified as originated from E1-like centers in the SiC-like phase. The volume density of the defects can vary from 1011 - 1017 cm-3 depending on specific conditions of the PECVD process.

Reversible and semi-blind relational database watermarking

Database watermarking has received significant research attention in the current decade. Although, almost all watermarking models have been either irreversible (the original relation cannot be restored from the watermarked relation) and/or non-blind (requiring original relation to detect the watermark in watermarked relation). This model has several disadvantages over reversible and blind watermarking (requiring only watermarked relation and secret key from which the watermark is detected and original relation is restored) including inability to identify rightful owner in case of successful secondary watermarking, inability to revert the relation to original data set (required in high precision industries) and requirement to store unmarked relation at a secure secondary storage. To overcome these problems, we propose a watermarking scheme that is reversible as well as blind. We utilize difference expansion on integers to achieve reversibility. The major advantages provided by our scheme are reversibility to high quality original data set, rightful owner identification, resistance against secondary watermarking attacks, and no need to store original database at a secure secondary storage.

Robust and reversible numerical set watermarking

Numeric sets can be used to store and distribute important information such as currency exchange rates and stock forecasts. It is useful to watermark such data for proving ownership in case of illegal distribution by someone. This paper analyzes the numerical set watermarking model presented by Sion et. al in “On watermarking numeric sets”, identifies it’s weaknesses, and proposes a novel scheme that overcomes these problems. One of the weaknesses of Sion’s watermarking scheme is the requirement to have a normally-distributed set, which is not true for many numeric sets such as forecast figures. Experiments indicate that the scheme is also susceptible to subset addition and secondary watermarking attacks. The watermarking model we propose can be used for numeric sets with arbitrary distribution. Theoretical analysis and experimental results show that the scheme is strongly resilient against sorting, subset selection, subset addition, distortion, and secondary watermarking attacks.

Robust numeric set watermarking : numbers don’t lie

Ever since Cox et. al published their paper, “A Secure, Robust Watermark for Multimedia” in 1996 [6], there has been tremendous progress in multimedia watermarking. The same pattern re-emerged with Agrawal and Kiernan publishing their work “Watermarking Relational Databases” in 2001 [1]. However, little attention has been given to primitive data collections with only a handful works of research known to the authors [11, 10]. This is primarily due to the absence of an attribute that differentiates marked items from unmarked item during insertion and detection process. This paper presents a distribution-independent, watermarking model that is secure against secondary-watermarking in addition to conventional attacks such as data addition, deletion and distortion. The low false positives and high capacity provide additional strength to the scheme. These claims are backed by experimental results provided in the paper.

Software watermarking resilient to debugging attacks

In 2006, Gaurav Gupta and Josef Pieprzyk presented an attack on the branch-based software watermarking scheme proposed by Ginger Myles and Hongxia Jin in 2005. The software watermarking model is based on replacing jump instructions or unconditional branch statements (UBS) by calls to a fingerprint branch function (FBF) that computes the correct target address of the UBS as a function of the generated fingerprint and integrity check. If the program is tampered with, the fingerprint and/or integrity checks change and the target address is not computed correctly. Gupta and Pieprzyk's attack uses debugger capabilities such as register and address lookup and breakpoints to minimize the requirement to manually inspect the software. Using these resources, the FBF and calls to the same is identified, correct displacement values are generated and calls to FBF are replaced by the original UBS transferring control of the attack to the correct target instruction. In this paper, we propose a watermarking model that provides security against such debugging attacks. Two primary measures taken are shifting the stack pointer modification operation from the FBF to the individual UBSs, and coding the stack pointer modification in the same language as that of the rest of the code rather than assembly language to avoid conspicuous contents. The manual component complexity increases from O(1) in the previous scheme to O(n) in our proposed scheme.

Detection of dynamic primary user with cooperative spectrum sensing

In this paper we demonstrate that existing cooperative spectrum sensing formulated for static primary users cannot accurately detect dynamic primary users regardless of the information fusion method. Performance error occurs as the sensing parameters calculated by the conventional detector result in sensing performance that violates the sensing requirements. Furthermore, the error is accumulated and compounded by the number of cooperating nodes. To address this limitation, we design and implement the duty cycle detection model for the context of cooperative spectrum sensing to accurately calculate the sensing parameters that satisfy the sensing requirements. We show that longer sensing duration is required to compensate for dynamic primary user traffic.