Analysing governance categories used on project alliances in the construction industry

In Australia, collaborative contracts, and in particular, project alliances, have been increasingly used to govern infrastructure projects. These contracts use formal and informal governance mechanisms to manage the delivery of infrastructure projects. Formal mechanisms such as financial risk sharing are specified in the contract, while informal mechanisms such as integrated teams are not. Given that the literature contains a multiplicity of often untestable definitions, this paper reports on a review of the literature to operationalize the concepts of formal and informal governance. This work is the first phase of a study that will examine the optimal balance of formal and informal governance structures. Desk-top review of leading journals in the areas of construction management and business management, as well as recent government documents and industry guidelines, was undertaken to to conceptualise and operationalize formal and informal governance mechanisms. The study primarily draws on transaction-cost economics (e.g. Williamson 1979; Williamson 1991), relational contract theory (Feinman 2000; Macneil 2000) and social psychology theory (e.g. Gulati 1995). Content analysis of the literature was undertaken to identify key governance mechanisms. Content analysis is a commonly used methodology in the social sciences area. It provides rich data through the systematic and objective review of literature (Krippendorff 2004). NVivo 9, a qualitative data analysis software package, was used to assist in this process. A previous study by the authors identified that formal governance mechanisms can be classified into seven measurable categories: (1) negotiated cost, (2) competitive cost, (3) commercial framework, (4) risk and reward sharing, (5) qualitative performance, (6) collaborative multi-party agreement, and (7) early contractor involvement. Similarly, informal governance mechanisms can be classified into four measureable categories: (1) leadership structure, (2) integrated team, (3) team workshops, and (4) joint management system. This paper explores and further defines the key operational characteristics of each mechanism category, highlighting its impact on value for money in alliance project delivery. The paper’s contribution is that it provides the basis for future research to compare the impact of a range of individual mechanisms within each category, as a means of improving the performance of construction projects.

Nicklinson v Ministry of Justice [2012] 304 (QB) : further UK developments regarding a person's right to choose when and how to die : assisted termination of life

UK High Court decision - application for declarations legitimising third party assistance in voluntary termination of life - facts - moral, social and ethical issues - analysis.

Making arrangements in talk-in-interaction

Arrangement-making is understood to be a ‘closing-relevant action’ (Schegloff & Sacks 1973), but little attention has been given to how people arrive at mutually acceptable plans for the future. Telephone conversations between clients and staff of Community and Home Care (CHC) services were studied to identify how arrangements for future services were made. A recurrent sequence was observed in which clients were informed of future arrangement and were prompted to reply with ‘response solicitation’ (Jefferson 1981). Response solicitations were observed at two points: either tagged to the end of an informing, or following a recipient’s response to the informing. We show how response solicitations are routinely used in instances where recipients have some discretion in relation to the arrangement under discussion. They are a means by which an informing party can display to their interlocutor that they, as recipient, have some discretion to exercise in the matter. These findings are discussed with reference to prior research on arrangement-making in other settings, which suggests the general nature of this practice.

IL-23R is epigenetically regulated and modulated by chemotherapy in non-small cell lung cancer

The Interleukin-23 (IL-23)/IL-23R signaling axis is an important inflammatory pathway, involved in the stimulation and regulation of the T helper (Th) 17 lymphocytes, resulting in the production of IL-17. Aside from auto-immunity, this cytokine has also been linked to carcinogenesis and polymorphisms in the IL-23R gene are associated with an increased risk for the development of a number of different cancers. Activation of the IL-23 pathway results in the up-regulation of STAT3 and it is thought that the pathological consequences associated with this are in part due to the production of IL-17. We have previously identified IL-23A as pro-proliferative and epigenetically regulated in non-small cell lung cancer (NSCLC). The current study aims to evaluate IL-23R in greater detail in NSCLC. We demonstrate that IL-23R is expressed and epigenetically regulated in NSCLC through histone post-translation modifications and CpG island methylation. In addition, Gemcitabine treatment, a chemotherapy drug used in the treatment of NSCLC, resulted in the up-regulation of the IL-23R. Furthermore, Apilimod (STA 5326), a small molecule which blocks the expression of IL-23 and IL-12, reduced the proliferative capacity of NSCLC cells, particularly in the adenocarcinoma (A549) sub-type. Apilimod is currently undergoing investigation in a number of clinical trials for the treatment of auto-immune conditions such as Crohn's disease and Rheumatoid Arthritis. Our results may have implications for treating NSCLC patients with Gemcitabine or epigenetic targeted therapies. However, Apilimod may possibly provide a new treatment avenue for NSCLC patients. Work is currently ongoing to further delineate the IL-23/IL-23R axis in this disease.

Supermarkets and private standards : unintended consequences of the audit ritual

Recent scholarship has considered the implications of the rise of voluntary private standards in food and the role of private actors in a rapidly evolving, de-facto ‘mandatory’ sphere of governance. Standards are an important element of this globalising private sphere, but are an element that has been relatively peripheral in analyses of power in agri-food systems. Sociological thought has countered orthodox views of standards as simple tools of measurement, instead understanding their function as a governance mechanism that transforms many things, and people, during processes of standardisation. In a case study of the Australian retail supermarket duopoly and the proprietary standards required for market access this paper foregrounds retailers as standard owners and their role in third-party auditing and certification. Interview data from primary research into Australia’s food standards captures the multifaceted role supermarkets play as standard-owners, who are found to impinge on the independence of third-party certification while enforcing rigorous audit practices. We show how standard owners, in attempting to standardize the audit process, generate tensions within certification practices in a unique example of ritualism around audit. In examining standards to understand power in contemporary food governance, it is shown that retailers are drawn beyond standard-setting into certification and enforcement, that is characterized by a web of institutions and actors whose power to influence outcomes is uneven.

Retailer-driven agricultural restructuring - Australia, the UK and Norway in comparison

In recent decades, the governance of food safety, food quality, on-farm environmental management and animal welfare has been shifting from the realm of 'the government' to that of the private sector. Corporate entities, especially the large supermarkets, have responded to neoliberal forms of governance and the resultant 'hollowed-out' state by instituting private standards for food, backed by processes of certification and policed through systems of third party auditing. Today's food regime is one in which supermarkets impose 'private standards' along the food supply chain to ensure compliance with a range of food safety goals-often above and beyond those prescribed by government. By examining regulatory governance in Australia, Norway and the United Kingdom we highlight emerging trajectories of food governance. We argue that the imposition of the new private forms of monitoring and compliance continue the project of agricultural restructuring that began with government support for structural adjustment schemes in agriculture and that these are most evident in the UK and Australia where neoliberalism is an entrenched philosophy. However, despite Norway's identity as a social democracy, we also identify neoliberal 'creep' into the system of food governance. Small-scale producers in all three nations are finding themselves increasingly subject to governance through private, market-based mechanisms that, to varying degrees, are dominated by major supermarket chains. The result is agricultural restructuring not through the traditional avenues of elected governments, but via non-elected market operatives.

Modelling after-the-fact leakage for key exchange

Security models for two-party authenticated key exchange (AKE) protocols have developed over time to prove the security of AKE protocols even when the adversary learns certain secret values. In this work, we address more granular leakage: partial leakage of long-term secrets of protocol principals, even after the session key is established. We introduce a generic key exchange security model, which can be instantiated allowing bounded or continuous leakage, even when the adversary learns certain ephemeral secrets or session keys. Our model is the strongest known partial-leakage-based security model for key exchange protocols. We propose a generic construction of a two-pass leakage-resilient key exchange protocol that is secure in the proposed model, by introducing a new concept: the leakage-resilient NAXOS trick. We identify a special property for public-key cryptosystems: pair generation indistinguishability, and show how to obtain the leakage-resilient NAXOS trick from a pair generation indistinguishable leakage-resilient public-key cryptosystem.

The Politics and Legality of Prisoner Disenfranchisement in Australian Federal Elections

To remove the right of prisoners to vote does many things. … It signals that whatever the prisoner says is not of interest to those at the top, that you are not interested in talking to them or even listening to them, that you want to exclude them and that you have no interest in knowing about them. INTRODUCTION In June 2006, Australia passed legislation disenfranchising all prisoners serving full-time custodial sentences from voting in federal elections. This followed a succession of changes dating from 1983 that alternately extended and restricted the prisoner franchise. In 1989 and 1995, the Australian Labor Party (ALP) federal government prepared draft legislation removing any restrictions on prisoner voting rights in federal elections; the measures were defeated and withdrawn. With the 2006 legislation, the Howard Coalition government (composed of the Liberal and National parties) successfully achieved the total disenfranchisement it first sought in 1998. This chapter examines the politics and legality of the 2006 disenfranchisement. This will be approached, first, by briefly outlining the key provisions of the Commonwealth Electoral Act 1918, offering a short legislative history of prisoner franchise, and examining some of the key constitutional issues. Second, the 2006 disenfranchisement introduced in the Electoral and Referendum (Electoral Integrity and Other Measures) Act 2006 will be examined in greater detail, particularly in terms of the manner in which it was achieved and the arguments that were mobilized both in support of and against the change.

Iterative intersections

Iterative Intersectioning is a body of art works that comes out of the collaboration between author and electronic artist Jen Seevinck and a community of print artists, most particularly Elizabeth Saunders (EJ) and Robert Oakman. The work shown here is concerned with the creative process of collaboration, specifically as this informs visual forms. This is through our focus on process. This process has facilitated a 'conversational' exchange between all artists and a corresponding evolution in the artworks. In each case the dialogue is either between the author, Jen and EJ or between Jen and Robert. It consists of passing work between parties, interpreting it and working into it, before passing it back. The result is a series of art works including those shown here. The concept evolves in parallel to this. Importantly, at each of her iterations of creative work, the author Jen determines a similar 'treatment' or 'interpretation' across both print artists works at that time. A synthesis of EJ and Robert's creative interpretation -- at a high level -- occurs. In this sense the concept and works can be understood to intersect with one another.

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.

Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

Analysis of bilinear pairing-based accumulator for identity escrowing

An accumulator based on bilinear pairings was proposed at CT-RSA'05. Here, it is first demonstrated that the security model proposed by Lan Nguyen does lead to a cryptographic accumulator that is not collision resistant. Secondly, it is shown that collision-resistance can be provided by updating the adversary model appropriately. Finally, an improvement on Nguyen's identity escrow scheme, with membership revocation based on the accumulator, by removing the trusted third party is proposed.

Efficient disjointness tests for private datasets

We present efficient protocols for private set disjointness tests. We start from an intuition of our protocols that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the cardinality of the intersection. More specifically, it discloses its lower bound. By using the Lagrange interpolation we provide a protocol for the honest-but-curious case without revealing any additional information. Finally, we describe a protocol that is secure against malicious adversaries. The protocol applies a verification test to detect misbehaving participants. Both protocols require O(1) rounds of communication. Our protocols are more efficient than the previous protocols in terms of communication and computation overhead. Unlike previous protocols whose security relies on computational assumptions, our protocols provide information theoretic security. To our knowledge, our protocols are first ones that have been designed without a generic secure function evaluation. More importantly, they are the most efficient protocols for private disjointness tests for the malicious adversary case.

Distributed private matching and set operations

Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party’s dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

Continuous after-the-fact leakage-resilient key exchange

Security models for two-party authenticated key exchange (AKE) protocols have developed over time to provide security even when the adversary learns certain secret keys. In this work, we advance the modelling of AKE protocols by considering more granular, continuous leakage of long-term secrets of protocol participants: the adversary can adaptively request arbitrary leakage of long-term secrets even after the test session is activated, with limits on the amount of leakage per query but no bounds on the total leakage. We present a security model supporting continuous leakage even when the adversary learns certain ephemeral secrets or session keys, and give a generic construction of a two-pass leakage-resilient key exchange protocol that is secure in the model; our protocol achieves continuous, after-the-fact leakage resilience with not much more cost than a previous protocol with only bounded, non-after-the-fact leakage.