A molecular genetic approach for forensic animal species identification

This study investigated potential markers within chromosomal, mitochondrial DNA (mtDNA) and ribosomal RNA (rRNA) with the aim of developing a DNA based method to allow differentiation between animal species. Such discrimination tests may have important applications in the forensic science, agriculture, quarantine and customs fields. DNA samples from five different animal individuals within the same species for 10 species of animal (including human) were analysed. DNA extraction and quantitation followed by PCR amplification and GeneScan visualisation formed the basis of the experimental analysis. Five gene markers from three different types of genes were investigated. These included genomic markers for the β-actin and TP53 tumor suppressor gene. Mitochondrial DNA markers, designed by Bataille et al. [Forensic Sci. Int. 99 (1999) 165], examined the Cytochrome b gene and Hypervariable Displacement Loop (D-Loop) region. Finally, a ribosomal RNA marker for the 28S rRNA gene optimised by Naito et al. [J. Forensic Sci. 37 (1992) 396] was used as a possible marker for speciation. Results showed a difference of only several base pairs between all species for the β-actin and 28S markers, with the exception of Sus scrofa (pig) β-actin fragment length, which produced a significantly smaller fragment. Multiplexing of Cytochrome b and D-Loop markers gave limited species information, although positive discrimination of human DNA was evident. The most specific and discriminatory results were shown using the TP53 gene since this marker produced greatest fragment size differences between animal species studied. Sample differentiation for all species was possible following TP53 amplification, suggesting that this gene could be used as a potential animal species identifier.

Shadows : Re-visualising the shark. Developing a framework for hybrid photography in the illumination of nonhuman animal and ecological perspectives at Heron Island and Gladstone, Great Barrier Reef

This study investigated how and to what degree “hybrid photography”—the simultaneous use of indexical and fictional properties and strategies— innovates the representation of animals within animalcentric, ecocentric frameworks. Design theory structured this project’s Practice-led, Visual research methodology framework. Grounded theory processes articulated emerging categories of hybrid photography through systematically and comparatively treating animal photography works for reflexive analysis. Design theory then applied and clarified categories, developing practice that re-visualised shark perspectives as new ecological discourse. Shadows, a creative practice installation, realised a full-scale photographic investigation into shark and marine animal realities of a specific environment—Heron Island and Gladstone, Great Barrier Reef—facing ecological crisis from dredging and development at Gladstone Harbour. Works rendered and explored hybrid photography’s capacity for illuminating nonhuman animals, in particular, sharks, and comprise 65% of this project’s weighting. This exegetical paper offers a definition, strategies and evaluation of hybrid photography in unsettling animal perspectives as effective ecological discourse, and comprises 35%.

Plant and animal microRNAs : similarities and differences

Plant and animal microRNAs (miRNAs) are evolutionarily ancient small RNAs, ∼19-24 nucleotides in length, that are generated by cleavage from larger highly structured precursor molecules. In both plants and animals, miRNAs posttranscriptionally regulate gene expression through interactions with their target mRNAs, and these targets are often genes involved with regulating key developmental events. Despite these similarities, plant and animal miRNAs exert their control in fundamentally different ways. Generally, animal miRNAs repress gene expression by mediating translational attenuation through (multiple) miRNA-binding sites located within the 3′ untranslated region of the target gene. In contrast, almost all plant miRNAs regulate their targets by directing mRNA cleavage at single sites in the coding regions. These and other differences suggest that the two systems may have originated independently, possibly as a prerequisite to the development of complex body plans. © Springer-Verlag 2005.

Practical Modbus flooding attack and detection

The Modicon Communication Bus (Modbus) protocol is one of the most commonly used protocols in industrial control systems. Modbus was not designed to provide security. This paper confirms that the Modbus protocol is vulnerable to flooding attacks. These attacks involve injection of commands that result in disrupting the normal operation of the control system. This paper describes a set of experiments that shows that an anomaly-based change detection algorithm and signature-based Snort threshold module are capable of detecting Modbus flooding attacks. In comparing these intrusion detection techniques, we find that the signature-based detection requires a carefully selected threshold value, and that the anomaly-based change detection algorithm may have a short delay before detecting the attacks depending on the parameters used. In addition, we also generate a network traffic dataset of flooding attacks on the Modbus control system protocol.

Animal stories : flash flood 2011

Flash flood disasters happen suddenly. The Toowoomba Lockyer Valley flash flood in January 2011 was not forecast by the Bureau of Meteorology until after it had occurred. Domestic and wild animals gave the first warning of the disaster in the days leading up to the event and large animals gave warnings on the morning of the disaster. Twenty-three people, including 5 children in the disaster zone died. More than 500 people were listed as missing. Some of those who died, perished because they stayed in the disaster zone to look after their animals while other members of their family escaped to safety. Some people who were in danger refused to be rescued because they could not take their pets with them. During a year spent recording accounts of the survivors of the disaster, animals were often mentioned by survivors. Despite the obvious perils, people risked their lives to save their animals; people saw animals try to save each other; animals rescued people; people rescued animals; animals survived where people died; animals were used to find human victims in the weeks after the disaster; and animals died. The stories of the flood present challenges for pet owners, farmers, counter disaster planners, weather forecasters and emergency responders in preparing for disasters, responding to them and recovering after them.

Bucket attack on numeric set watermarking model and safeguards

Numeric set watermarking is a way to provide ownership proof for numerical data. Numerical data can be considered to be primitives for multimedia types such as images and videos since they are organized forms of numeric information. Thereby, the capability to watermark numerical data directly implies the capability to watermark multimedia objects and discourage information theft on social networking sites and the Internet in general. Unfortunately, there has been very limited research done in the field of numeric set watermarking due to underlying limitations in terms of number of items in the set and LSBs in each item available for watermarking. In 2009, Gupta et al. proposed a numeric set watermarking model that embeds watermark bits in the items of the set based on a hash value of the items’ most significant bits (MSBs). If an item is chosen for watermarking, a watermark bit is embedded in the least significant bits, and the replaced bit is inserted in the fractional value to provide reversibility. The authors show their scheme to be resilient against the traditional subset addition, deletion, and modification attacks as well as secondary watermarking attacks. In this paper, we present a bucket attack on this watermarking model. The attack consists of creating buckets of items with the same MSBs and determine if the items of the bucket carry watermark bits. Experimental results show that the bucket attack is very strong and destroys the entire watermark with close to 100% success rate. We examine the inherent weaknesses in the watermarking model of Gupta et al. that leave it vulnerable to the bucket attack and propose potential safeguards that can provide resilience against this attack.

Extensions of the cube attack based on low degree annihilators

At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an initialization vector. In a stream cipher setting where the filter function is known, we can extend it to the cube attack with annihilators: By applying the cube attack to Boolean functions for which we can find low-degree multiples (equivalently annihilators), the attack complexity can be improved. When the size of the filter function is smaller than the LFSR, we can improve the attack complexity further by considering a sliding window version of the cube attack with annihilators. Finally, we extend the cube attack to vectorial Boolean functions by finding implicit relations with low-degree polynomials.

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.

Converse results to the Wiener attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-exponent d from the public key (N,e) as long as d < N 1/4. Interestingly, Wiener stated that his attack may sometimes also work when d is slightly larger than N 1/4. This raises the question of how much larger d can be: could the attack work with non-negligible probability for d=N 1/4 + ρ for some constant ρ > 0? We answer this question in the negative by proving a converse to Wiener’s result. Our result shows that, for any fixed ε > 0 and all sufficiently large modulus lengths, Wiener’s attack succeeds with negligible probability over a random choice of d < N δ (in an interval of size Ω(N δ )) as soon as δ > 1/4 + ε. Thus Wiener’s success bound dattack, which are guaranteed to succeed even when δ > 1/4. The known attacks in this class (by Verheul and Van Tilborg and Dujella) run in exponential time, so it is natural to ask whether there exists an attack in this class with subexponential run-time. Our second converse result answers this question also in the negative.

Crossword puzzle attack on NLS

NLS is one of the stream ciphers submitted to the eSTREAM project. We present a distinguishing attack on NLS by Crossword Puzzle (CP) attack method which is introduced in this paper. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we present the graph showing how the bias of distinguisher vary with Konst. In result, we estimate the bias of the distinguisher to be around O(2^−30). Therefore, we claim that NLS is distinguishable from truly random cipher after observing O(2^60) keystream words. The experiments also show that our distinguishing attack is successful on 90.3% of Konst among 2^32 possible values. We extend the CP attack to NLSv2 which is a tweaked version of NLS. In result, we build a distinguisher which has the bias of around 2− 48. Even though this attack is below the eSTREAM criteria (2^−40), the security margin of NLSv2 seems to be too low.

Distinguishing attack on SOBER-128 with linear masking

We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2^− − 8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We also show that the bias of the distinguisher can be improved (or estimated more precisely) by considering quadratic terms of the approximation. The probability bias of the quadratic approximation used in the distinguisher is estimated to be equal to O(2^− − 51.8), so that we claim that SOBER-128 is distinguishable from truly random cipher by observing O(2^103.6) keystream words.

Extending FORK-256 attack to the full hash function

In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for the compression function, but in practice the attack could not be extended to the full function due to large memory requirements and computation time. In this paper we improve the attack and show that it is possible to find near-collisions in practice for any given value of IV. In particular, this means that the full hash function with the prespecified IV is vulnerable in practice, not just in theory. We exhibit an example near-collision for the complete hash function.

How should future building structure and emergency response cope with bushfire attack?

Bushfires are regular occurrences in the Australian landscape which can, under adverse weather conditions, give rise to losses of life, property, infrastructure, environmental and cultural values. Where property loss is involved, historical surveys of house losses have focussed on ember, radiant heat and flame contact as key bushfire attack mechanisms. Although often noted, little work has been done to quantify the impact of fire generated or fire enhanced wind and pyro-convective events on house loss and to improve construction practice within Australia. It is well known that strong winds are always associated with bushfire events. It is less well known, although increasingly shown through anecdotal evidence, that bushfires are not a passive companion of wind, but indeed they interact with winds and can together cause significant damages to exposed buildings and ecological structures. Previous studies have revealed the effects of wind, fire and structure interactions with the result of increased pressure coefficient distributions on the windward side of a building downstream of a fire front. This paper presents a further analysis of the result in relations to the relevant standards and fire weather conditions. A review of wind code and bushfire code was conducted. Based on the result of the current study, the authors believe it is necessary to consider wind as an attack mechanism in bushfire events. The results of the study will also have implications on bushfire emergency management, design of emergency shelters, perception of danger, emergency evacuation and on risk assessment.

Multiple modular additions and crossword puzzle attack on NLSv2

NLS is a stream cipher which was submitted to the eSTREAM project. A linear distinguishing attack against NLS was presented by Cho and Pieprzyk, which was called Crossword Puzzle (CP) attack. NLSv2 is a tweak version of NLS which aims mainly at avoiding the CP attack. In this paper, a new distinguishing attack against NLSv2 is presented. The attack exploits high correlation amongst neighboring bits of the cipher. The paper first shows that the modular addition preserves pairwise correlations as demonstrated by existence of linear approximations with large biases. Next, it shows how to combine these results with the existence of high correlation between bits 29 and 30 of the S-box to obtain a distinguisher whose bias is around 2^−37. Consequently, we claim that NLSv2 is distinguishable from a random cipher after observing around 2^74 keystream words.

Detection of sinkhole attack in wireless sensor networks

Generally wireless sensor networks rely of many-to-one communication approach for data gathering. This approach is extremely susceptible to sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and subsequently presents selective forwarding or change the data that carry through it. A sinkhole attack causes an important threat to sensor networks and it should be considered that the sensor nodes are mostly spread out in open areas and of weak computation and battery power. In order to detect the intruder in a sinkhole attack this paper suggests an algorithm which firstly finds a group of suspected nodes by analyzing the consistency of data. Then, the intruder is recognized efficiently in the group by checking the network flow information. The proposed algorithm's performance has been evaluated by using numerical analysis and simulations. Therefore, accuracy and efficiency of algorithm would be verified.