The Nagle Royal Commission 25 years on : gaining perspective on two and a half decades of NSW prison reform

This article attempts an audit of changes in the NSW penal system over the last nearly 30 years. Taking the 1978 Nagle Royal Commission findings and analysis as the starting point a comparison is made between the Nagle era and the contemporary scene across a range of practices including imprisonment rates, violence, drug use, deaths in custody, prison conditions, prisoners rights, legal regulation, and others. It is suggested that developments since Nagle are mixed and cannot be attributed to a single logic or force. Major changes include a doubling of imprisonment rates, significant increases in Indigenous and women's imprisonment rates, the apparent ending of institutionalised bashings and the centrality of drug use to imprisonment and to the culture, health and security practices which characterise the current prison experience. The article may constitute a useful starting point for broader attempts to relate current penal practices to far wider changes in the conditions of life under late modernity.

The Royal Commission into the NSW Police Service : process corruption and the limits of judicial reflexivity

This paper will offer an examination of the Reports of the Royal Commission into the NSW Police Service (Interim Report February 1996; Interim Report: Immediate Measures November 1996; Final Report Vol I: Corruption; Final Report Vol II: Reform; Final Report Vol III: Appendices May 1997) excluding the Report on Paedophilia, August 1997. The examination will be confined essentially to one question: to what extent do the published Reports consider the part played by the judiciary, prosecutors and lawyers, in the construction of a form of criminal justice revealed by the Commission itself, to be disfigured by serious process corruption? The examination will be conducted by way of a chronological trawl through the Reports of the Commission in an attempt to identify all references to the role of the judiciary, prosecutors and lawyers. The adequacy of any such treatment will then be considered. In order to set the scene a brief and generalised overview of the Wood Commission will be offered together with the Commission's definition of process corruption.

Breaking the code of silence : the Wood Royal Commission into New South Wales police : a brief overview

The three-volume Final Report of the Wood inquiry into NSW Police (Royal Commission Into the New South Wales Police Service, 'Final Report, Vol I: Corruption; Vol II: Reform; Vol III: Appendices', May 1997) was publicly released on 15 May 1997, to much media fanfare. The Sydney Morning Herald (SMH) devoted an 8-page special report on I May to the pending release of the Inquiry Report, headed The Police Purge. On the day of the public release of the Report, the SMH five-page 'Special Report' under the banner The Police Verdict was headlined Wood, Carr Split on Drugs. The Australian led with Call for Drug Law Revamp, Force Overhaul to Fight Corruption, Wood Attacks Culture of Greed, and the Daily Telegraph front page 'Final Verdict' was True Blue Strategy for an Honest Police Force...

A toothless chihuahua? : the Australian Competition and Consumer Commission, neoliberalism and supermarket power in Australia

During the Senate Inquiry into 'milk price wars' in 2011, Senator Nick Xenophon accused the Australian Competition and Consumer Commission (ACCC) of being 'less effective than a toothless Chihuahua'. This follows the ACCC's lack of action regarding the reported abuse of market power of Australia's supermarket duopoly, where an extensive inquiry into the competitiveness of retail prices in 2008 found grocery retailing to be 'workably competitive' despite numerous claims to the contrary. How can farmers' submissions to the inquiry that cite market abuse be reconciled with the ACCC's finding that all is well in the food supply chain? Following an in-depth examination of 53 farmer submissions to the inquiry, we conclude that the findings of the ACCC are commensurate with the neoliberal economisation of the political sphere, where commercial entities 'legitimately' govern beyond their corporate boundaries, often using disciplinary measures that were once exclusive to governments. We argue that such clear structural inequalities between farmers and major corporations is reason to re-regulate markets and reinsert a stronger role for government to 'level the playing field'.

How the royal commission can help Toowoomba to heal — again

In 2008 Toowoomba was rocked by a second paedophilia scandal in seven years. Local journalist Amanda Gearing says, maybe this time, the royal commission can help put the city back together.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

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.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Certified pseudonyms colligated with master secret key

A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.

Civil litigation limitation periods : submission to the Royal Commission into institutional responses to child sexual abuse

This submission makes one simple yet powerful recommendation for law reform to promote justice for survivors of child sexual abuse. It is informed by extensive analyses of the phenomenon of child sexual abuse and its psychological sequelae, legislative time limits and case law across Australia and internationally, the policy reasons underpinning statutory time limits generally, and the need for fairness, certainty and practicability in the legal system. The recommendation is that legislative reform is required in all Australian States and Territories to remove time limitations for civil claims for injuries caused by child sexual abuse.

Cheating immune secret sharing

We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ ¯= 1 n ⋅ 2 −n ∑ n c=1 ∑ α∈Vn ρ c,α , satisfies ρ ¯⩾ 1 2 , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.

Cheating prevention in linear secret sharing

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.

Cheating prevention in secret sharing over GF(pt)

The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.

Constructions of cheating immune secret sharing

The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. The paper investigates cryptographic properties of the defining function of secret sharing so the scheme is k-cheating immune. Constructions of secret sharing immune against k cheaters are given.