The deep trauma of secondary victimisation : parents of sex offenders

The publication of the fourth edition of the Diagnostic and Statistical Manual of Mental Disorders (DSM-IV; American Psychiatric Association, 1994) introduced the notion that a life-threatening illness can be a stressor and catalyst for Posttraumatic Stress Disorder (PTSD). Since then a solid body of research has been established investigating the post-diagnosis experience of cancer. These studies have identified a number of short and long-term life changes resulting from a diagnosis of cancer and associated treatments. In this chapter, we discuss the psychosocial response to the cancer experience and the potential for cancer-related distress. Cancer can represent a life-threatening diagnosis that may be associated with aggressive treatments and result in physical and psychological changes. The potential for future trauma through the lasting effects of the disease and treatment, and the possibility of recurrence, can be a source of continued psychological distress. In addition to the documented adverse repercussions of cancer, we also outline the recent shift that has occurred in the psycho-oncology literature regarding positive life change or posttraumatic growth that is commonly reported after a diagnosis of cancer. Adopting a salutogenic framework acknowledges that the cancer experience is a dynamic psychosocial process with both negative and positive repercussions. Next, we describe the situational and individual factors that are associated with posttraumatic growth and the types of positive life change that are prevalent in this context. Finally, we discuss the implications of this research in a therapeutic context and the directions of future posttraumatic growth research with cancer survivors. This chapter will present both quantitative and qualitative research that indicates the potential for personal growth from adversity rather than just mere survival and return to pre-diagnosis functioning. It is important to emphasise however, that the presence of growth and prevalence of resilience does not negate the extremely distressing nature of a cancer diagnosis for the patient and their families and the suffering that can accompany treatment regimes. Indeed, it will be explained that for growth to occur, the experience must be one that quite literally shatters previously held schemas in order to act as a catalyst for change.

Deformation with coupled chemical diffusion

The deformation of rocks is commonly intimately associated with metamorphic reactions. This paper is a step towards understanding the behaviour of fully coupled, deforming, chemically reacting systems by considering a simple example of the problem comprising a single layer system with elastic-power law viscous constitutive behaviour where the deformation is controlled by the diffusion of a single chemical component that is produced during a metamorphic reaction. Analysis of the problem using the principles of non-equilibrium thermodynamics allows the energy dissipated by the chemical reaction-diffusion processes to be coupled with the energy dissipated during deformation of the layers. This leads to strain-rate softening behaviour and the resultant development of localised deformation which in turn nucleates buckles in the layer. All such diffusion processes, in leading to Herring-Nabarro, Coble or “pressure solution” behaviour, are capable of producing mechanical weakening through the development of a “chemical viscosity”, with the potential for instability in the deformation. For geologically realistic strain rates these chemical feed-back instabilities occur at the centimetre to micron scales, and so produce structures at these scales, as opposed to thermal feed-back instabilities that become important at the 100–1000 m scales.

Private hospital emergency departments in Australia : challenges and opportunities

BACKGROUND: Public hospital EDs in Australia have become increasingly congested because of increasing demand and access block. Six per cent of ED patients attend private hospital EDs whereas 45% of the population hold private health insurance. OBJECTIVES: This study describes the patients attending a small selection of four private hospital EDs in Queensland and Victoria, and tests the feasibility of a private ED database. METHODS: De-identified routinely collected patient data were provided by the four participating private hospital and amalgamated into a single data set. RESULT: The mean age of private ED patients was 52 years. Males outnumbered females in all age groups except > 80 years. Attendance was higher on weekends and Mondays, and between 08.00 and 20.00 h. There were 6.6% of the patients triaged as categories 1 and 2, and 60% were categories 4 or 5. There were 36.4% that required hospital admission. Also, 96% of the patients had some kind of insurance. Furthermore, 72% were self-referred and 12% were referred by private medical practitioners. Approximately 25% arrived by ambulance. There were 69% that completed their ED treatment within 4 h. CONCLUSION: This study is the first public description of patients attending private EDs in Australia. Private EDs have a significant role to play in acute medical care and in providing access to private hospitals which could alleviate pressure on public EDs. This study demonstrates the need for consolidated data based on a consistent data set and data dictionary to enable system-wide analysis, benchmarking and evaluation

Investigation between the S377G3 GATA-4 polymorphism and migraine

Migraine is a common and painful neurological disorder, with genetic and environmental components. Several conditions have been shown to be comorbid with migraine, notably a cardiac malformation affecting the interatrial septum and leading to patent foramen ovale (PFO). Mutations in the development regulatory gene GATA-4, located on human chromosome 8p23.1-p22, have been found to be responsible for some cases of congenital heart defects including PFO. To determine whether the GATA-4 gene is involved in migraine, the present study performed an association analysis of a common GATA-4 variant that results in a change of amino acid (S377G), in a large case/control population (275 unrelated Caucasian migraineurs versus 275 control individuals). The results showed that there was no significant association for this polymorphism between migraine and controls (χ² = 0.84, P = 0.66). Thus it appears that the GATA-4 (S377G) mutation does not play a significant role in common migraine susceptibility.

Security analysis of linearly filtered NLFSRs

Non-linear feedback shift register (NLFSR) ciphers are cryptographic tools of choice of the industry especially for mobile communication. Their attractive feature is a high efficiency when implemented in hardware or software. However, the main problem of NLFSR ciphers is that their security is still not well investigated. The paper makes a progress in the study of the security of NLFSR ciphers. In particular, we show a distinguishing attack on linearly filtered NLFSR (or LF-NLFSR) ciphers. We extend the attack to a linear combination of LF-NLFSRs. We investigate the security of a modified version of the Grain stream cipher and show its vulnerability to both key recovery and distinguishing attacks.

The role of sleepiness, sleep disorders, and the work environment on heavy-vehicle crashes in 2 Australian states

Heavy-vehicle driving involves a challenging work environment and a high crash rate. We investigated the associations of sleepiness, sleep disorders, and work environment (including truck characteristics) with the risk of crashing between 2008 and 2011 in the Australian states of New South Wales and Western Australia. We conducted a case-control study of 530 heavy-vehicle drivers who had recently crashed and 517 heavy-vehicle drivers who had not. Drivers' crash histories, truck details, driving schedules, payment rates, sleep patterns, and measures of health were collected. Subjects wore a nasal flow monitor for 1 night to assess for obstructive sleep apnea. Driving schedules that included the period between midnight and 5:59 am were associated with increased likelihood of crashing (odds ratio = 3.42, 95% confidence interval: 2.04, 5.74), as were having an empty load (odds ratio = 2.61, 95% confidence interval: 1.72, 3.97) and being a less experienced driver (odds ratio = 3.25, 95% confidence interval: 2.37, 4.46). Not taking regular breaks and the lack of vehicle safety devices were also associated with increased crash risk. Despite the high prevalence of obstructive sleep apnea, it was not associated with the risk of a heavy-vehicle nonfatal, nonsevere crash. Scheduling of driving to avoid midnight-to-dawn driving and the use of more frequent rest breaks are likely to reduce the risk of heavy-vehicle nonfatal, nonsevere crashes by 2–3 times.

Design, implementation and multisite evaluation of a system suitability protocol for the quantitative assessment of instrument performance in liquid chromatography-multiple reaction monitoring-MS (LC-MRM-MS)

Multiple reaction monitoring (MRM) mass spectrometry coupled with stable isotope dilution (SID) and liquid chromatography (LC) is increasingly used in biological and clinical studies for precise and reproducible quantification of peptides and proteins in complex sample matrices. Robust LC-SID-MRM-MS-based assays that can be replicated across laboratories and ultimately in clinical laboratory settings require standardized protocols to demonstrate that the analysis platforms are performing adequately. We developed a system suitability protocol (SSP), which employs a predigested mixture of six proteins, to facilitate performance evaluation of LC-SID-MRM-MS instrument platforms, configured with nanoflow-LC systems interfaced to triple quadrupole mass spectrometers. The SSP was designed for use with low multiplex analyses as well as high multiplex approaches when software-driven scheduling of data acquisition is required. Performance was assessed by monitoring of a range of chromatographic and mass spectrometric metrics including peak width, chromatographic resolution, peak capacity, and the variability in peak area and analyte retention time (RT) stability. The SSP, which was evaluated in 11 laboratories on a total of 15 different instruments, enabled early diagnoses of LC and MS anomalies that indicated suboptimal LC-MRM-MS performance. The observed range in variation of each of the metrics scrutinized serves to define the criteria for optimized LC-SID-MRM-MS platforms for routine use, with pass/fail criteria for system suitability performance measures defined as peak area coefficient of variation <0.15, peak width coefficient of variation <0.15, standard deviation of RT <0.15 min (9 s), and the RT drift <0.5min (30 s). The deleterious effect of a marginally performing LC-SID-MRM-MS system on the limit of quantification (LOQ) in targeted quantitative assays illustrates the use and need for a SSP to establish robust and reliable system performance. Use of a SSP helps to ensure that analyte quantification measurements can be replicated with good precision within and across multiple laboratories and should facilitate more widespread use of MRM-MS technology by the basic biomedical and clinical laboratory research communities.

The molecular basis for selective inhibition of unconventional mRNA splicing by an IRE1-binding small molecule

IRE1 couples endoplasmic reticulum unfolded protein load to RNA cleavage events that culminate in the sequence-specific splicing of the Xbp1 mRNA and in the regulated degradation of diverse membrane-bound mRNAs. We report on the identification of a small molecule inhibitor that attains its selectivity by forming an unusually stable Schiff base with lysine 907 in the IRE1 endonuclease domain, explained by solvent inaccessibility of the imine bond in the enzyme-inhibitor complex. The inhibitor (abbreviated 4μ8C) blocks substrate access to the active site of IRE1 and selectively inactivates both Xbp1 splicing and IRE1-mediated mRNA degradation. Surprisingly, inhibition of IRE1 endonuclease activity does not sensitize cells to the consequences of acute endoplasmic reticulum stress, but rather interferes with the expansion of secretory capacity. Thus, the chemical reactivity and sterics of a unique residue in the endonuclease active site of IRE1 can be exploited by selective inhibitors to interfere with protein secretion in pathological settings.

Lattice-based certificateless public-key encryption in the standard model

The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.

Lattice-based completely non-malleable public-key encryption in the standard model

An encryption scheme is non-malleable if giving an encryption of a message to an adversary does not increase its chances of producing an encryption of a related message (under a given public key). Fischlin introduced a stronger notion, known as complete non-malleability, which requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti later proposed a comparison-based definition of this security notion, which is more in line with the well-studied definitions proposed by Bellare et al. The authors also provide additional feasibility results by proposing two constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Therefore, the only previously known completely non-malleable (and non-interactive) scheme in the standard model, is quite inefficient as it relies on generic NIZK approach. They left the existence of efficient schemes in the common reference string model as an open problem. Recently, two efficient public-key encryption schemes have been proposed by Libert and Yung, and Barbosa and Farshim, both of them are based on pairing identity-based encryption. At ACISP 2011, Sepahi et al. proposed a method to achieve completely non-malleable encryption in the public-key setting using lattices but there is no security proof for the proposed scheme. In this paper we review the mentioned scheme and provide its security proof in the standard model. Our study shows that Sepahi’s scheme will remain secure even for post-quantum world since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best known classical (i.e., non-quantum) algorithms.

Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Cryptanalysis of WG-7 : a lightweight stream cipher

WG-7 is a stream cipher based on WG stream cipher and has been designed by Luo et al. (2010). This cipher is designed for low cost and lightweight applications (RFID tags and mobile phones, for instance). This paper addresses cryptographic weaknesses of WG-7 stream cipher. We show that the key stream generated by WG-7 can be distinguished from a random sequence after knowing 213.5 keystream bits and with a negligible error probability. Also, we investigate the security of WG-7 against algebraic attacks. An algebraic key recovery attack on this cipher is proposed. The attack allows to recover both the internal state and the secret key with the time complexity about 2/27.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

Lattice-based threshold changeability for standard shamir sectret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (geometry of numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Truncated differential analysis of reduced-round LBlock

In this paper we present truncated differential analysis of reduced-round LBlock by computing the differential distribution of every nibble of the state. LLR statistical test is used as a tool to apply the distinguishing and key-recovery attacks. To build the distinguisher, all possible differences are traced through the cipher and the truncated differential probability distribution is determined for every output nibble. We concatenate additional rounds to the beginning and end of the truncated differential distribution to apply the key-recovery attack. By exploiting properties of the key schedule, we obtain a large overlap of key bits used in the beginning and final rounds. This allows us to significantly increase the differential probabilities and hence reduce the attack complexity. We validate the analysis by implementing the attack on LBlock reduced to 12 rounds. Finally, we apply single-key and related-key attacks on 18 and 21-round LBlock, respectively.