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.

Learning routines used by firms during construction of infrastructure projects using the alliance procurement method

Collaborative contracting has emerged over the past 15 years as an innovative project delivery framework that is particularly suited to infrastructure projects. Australia leads the world in the development of project and program alliance approaches to collaborative delivery. These approaches are considered to promise superior project results. However, very little is known about the learning routines that are most widely used in support of collaborative projects in general and alliance projects in particular. The literature on absorptive capacity and dynamic capabilities indicates that such learning enhances project performance. The learning routines employed at corporate level during the operation of collaborative infrastructure projects in Australia were examined through a large survey conducted in 2013. This paper presents a descriptive summary of the preliminary findings. The survey captured the experiences of 320 practitioners of collaborative construction projects, including public and private sector clients, contractors, consultants and suppliers (three per cent of projects were located in New Zealand, but for brevity’s sake the sample is referred to as Australian). The majority of projects identified used alliances (78.6%); whilst 9% used Early Contractor Involvement (ECI) contracts and 2.7% used Early Tender Involvement contracts, which are ‘slimmer’ types of collaborative contract. The remaining 9.7% of respondents used traditional contracts that employed some collaborative elements. The majority of projects were delivered for public sector clients (86.3%), and/or clients experienced with asset procurement (89.6%). All of the projects delivered infrastructure assets; one third in the road sector, one third in the water sector, one fifth in the rail sector, and the rest spread across energy, building and mining. Learning routines were explored within three interconnected phases: knowledge exploration, transformation and exploitation. The results show that explorative and exploitative learning routines were applied to a similar extent. Transformative routines were applied to a relatively low extent. It was also found that the most highly applied routine is ‘regularly applying new knowledge to collaborative projects’; and the least popular routine was ‘staff incentives to encourage information sharing about collaborative projects’. Future research planned by the authors will examine the impact of these routines on project performance.

The distribution of absorptive capacity among construction supply chain participants

The absorptive capacity of organisations is one of the key drivers of innovation performance in any industry. This research seeks to refine our understanding of the relationship between absorptive capacity and innovation performance, with a focus on characterising the absorptive capacity of the different participant groups within the Australian road industry supply chain. One of the largest and most comprehensive surveys ever undertaken of innovation in road construction was completed in 2011 by the Queensland University of Technology (QUT), based on the Australian road industry. The survey of over 200 construction industry participants covered four sectors, comprising suppliers (manufacturers and distributors), consultants (engineering consultants), contractors (head and subcontractors) and clients (state government road agencies). The survey measured the absorptive capacity and innovation activity exhibited by organisations within each of these participant groups, using the perceived importance of addressing innovation obstacles as a proxy for innovation activity. One of the key findings of the survey is about the impact of participant competency on product innovation activity. The survey found that the absorptive capacity of industry participants had a significant and positive relationship with innovation activity. Regarding the distribution of absorptive capacity, the results indicate that suppliers are more likely to have high levels of absorptive capacity than the other participant groups, with 32% of suppliers showing high absorptive capacity, ahead of contractors (18%), consultants (11%), and clients (7%). These results support the findings of previous studies in the literature and suggest the importance of policies to enhance organisational learning, particularly in relation to openness to new product ideas.

A geometric construction of travelling wave solutions to the Keller–Segel model

We study a version of the Keller–Segel model for bacterial chemotaxis, for which exact travelling wave solutions are explicitly known in the zero attractant diffusion limit. Using geometric singular perturbation theory, we construct travelling wave solutions in the small diffusion case that converge to these exact solutions in the singular limit.

Rapid yet accurate speech indexing using dynamic match lattice spotting

The support for typically out-of-vocabulary query terms such as names, acronyms, and foreign words is an important requirement of many speech indexing applications. However, to date many unrestricted vocabulary indexing systems have struggled to provide a balance between good detection rate and fast query speeds. This paper presents a fast and accurate unrestricted vocabulary speech indexing technique named Dynamic Match Lattice Spotting (DMLS). The proposed method augments the conventional lattice spotting technique with dynamic sequence matching, together with a number of other novel algorithmic enhancements, to obtain a system that is capable of searching hours of speech in seconds while maintaining excellent detection performance

The construction of parents as learners about pre-school children’s development

The concept of the lifelong learner—the idea that people should be active learners throughout the lifespan—has since the 1990s gained importance in public policy. Governments in relatively wealthy countries have made the argument that the economic future of nations is tied to the ongoing participation of citizens in learning opportunities that will assist them to participate fully in society and increase their chances of employment in changing workforce conditions. More recently, policy attention has focused on the other end of the lifespan, the first years of life. With the early years now recognised as crucial for later educational success, policy attention has also focused on the importance of parenting in the early years. In the UK and Australia, for example, the effects of state interventions to facilitate ‘good parenting’ and pre-school children’s ‘readiness’ for formal schooling have been felt in a range of settings including community health services, the home and the pre-school (Gillies, 2005; Nichols & Jurvansuu, 2008; Millei & Lee, 2007; Vincent, Ball & Braun, 2010). In Australia, government policy has explicitly proposed a model of parenting as a learning process, and has urged people to cultivate their identities as learners in order to carry out their responsibilities as parents. In part the policy objectives have been to support parents to ensure that all children get a healthy and successful start to life...

Export readiness index : construction and analysis

The internationalisation process of firms has attracted much research interest since the 1970s. It is noted, however, that a significant research gap exists in studies with a primary focus on the pre-internationalisation behaviour of firms. This paper proposes the incorporation of a pre-internationalisation phase into the traditional Uppsala model of firm internationalisation to address the issue of export readiness. Through extensive literature review, the concepts fundamental to the ability of an Uppsala type firm to begin internationalisation through an export entry mode are identified: exposure to stimuli factors, attitudinal commitment of decision makers towards exporting, the firm’s resource capabilities, as well as the moderating effect of lateral rigidity. The concept of export readiness is operationalised in this study through the construction of an export readiness index (ERI) using exploratory and confirmatory factor analysis. The index is then applied to some representative cases and tested using logistic regression to establish its validity as a diagnostic tool. The proposed ERI presents not only a more practical approach towards analysing firms’ export readiness but has also major public policy implications as a possible tool for government export promotion agencies.

Key-private proxy re-encryption under LWE

Proxy re-encryption (PRE) is a highly useful cryptographic primitive whereby Alice and Bob can endow a proxy with the capacity to change ciphertext recipients from Alice to Bob, without the proxy itself being able to decrypt, thereby providing delegation of decryption authority. Key-private PRE (KP-PRE) specifies an additional level of confidentiality, requiring pseudo-random proxy keys that leak no information on the identity of the delegators and delegatees. In this paper, we propose a CPA-secure PK-PRE scheme in the standard model (which we then transform into a CCA-secure scheme in the random oracle model). Both schemes enjoy highly desirable properties such as uni-directionality and multi-hop delegation. Unlike (the few) prior constructions of PRE and KP-PRE that typically rely on bilinear maps under ad hoc assumptions, security of our construction is based on the hardness of the standard Learning-With-Errors (LWE) problem, itself reducible from worst-case lattice hard problems that are conjectured immune to quantum cryptanalysis, or “post-quantum”. Of independent interest, we further examine the practical hardness of the LWE assumption, using Kannan’s exhaustive search algorithm coupling with pruning techniques. This leads to state-of-the-art parameters not only for our scheme, but also for a number of other primitives based on LWE published the literature.

Functional encryption for threshold functions (or fuzzy IBE) from lattices

Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE).

Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE

We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two new hierarchical identity-based encryption (HIBE) schemes, with and without random oracles. The resulting systems are very different from earlier lattice-based HIBEs and in some cases result in shorter ciphertexts and private keys. We prove security from classic lattice hardness assumptions.

Lattice mixing and vanishing trapdoors : a framework for fully secure short signatures and more

We propose a framework for adaptive security from hard random lattices in the standard model. Our approach borrows from the recent Agrawal-Boneh-Boyen families of lattices, which can admit reliable and punctured trapdoors, respectively used in reality and in simulation. We extend this idea to make the simulation trapdoors cancel not for a specific forgery but on a non-negligible subset of the possible challenges. Conceptually, we build a compactly representable, large family of input-dependent “mixture” lattices, set up with trapdoors that “vanish” for a secret subset which we hope the forger will target. Technically, we tweak the lattice structure to achieve “naturally nice” distributions for arbitrary choices of subset size. The framework is very general. Here we obtain fully secure signatures, and also IBE, that are compact, simple, and elegant.

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.

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.

NTRUCCA : how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model

NTRUEncrypt is a fast and practical lattice-based public-key encryption scheme, which has been standardized by IEEE, but until recently, its security analysis relied only on heuristic arguments. Recently, Stehlé and Steinfeld showed that a slight variant (that we call pNE) could be proven to be secure under chosen-plaintext attack (IND-CPA), assuming the hardness of worst-case problems in ideal lattices. We present a variant of pNE called NTRUCCA, that is IND-CCA2 secure in the standard model assuming the hardness of worst-case problems in ideal lattices, and only incurs a constant factor overhead in ciphertext and key length over the pNE scheme. To our knowledge, our result gives the first IND-CCA2 secure variant of NTRUEncrypt in the standard model, based on standard cryptographic assumptions. As an intermediate step, we present a construction for an All-But-One (ABO) lossy trapdoor function from pNE, which may be of independent interest. Our scheme uses the lossy trapdoor function framework of Peikert and Waters, which we generalize to the case of (k − 1)-of-k-correlated input distributions.