Secure computation of the vector dominance problem

Suppose two parties, holding vectors A = (a 1,a 2,...,a n ) and B = (b 1,b 2,...,b n ) respectively, wish to know whether a i  > b i for all i, without disclosing any private input. This problem is called the vector dominance problem, and is closely related to the well-studied problem for securely comparing two numbers (Yao’s millionaires problem). In this paper, we propose several protocols for this problem, which improve upon existing protocols on round complexity or communication/computation complexity.

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.

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.

An on-line secure e-passport protocol

The first generation e-passport standard is proven to be insecure and prone to various attacks. To strengthen, the European Union (EU) has proposed an Extended Access Control (EAC) mechanism for e-passports that intends to provide better security in protecting biometric information of the e-passport bearer. But, our analysis shows, the EU proposal fails to address many security and privacy issues that are paramount in implementing a strong security mechanism. In this paper we propose an on-line authentication mechanism for electronic passports that addresses the weakness in existing implementations, of both The International Civil Aviation Organisation (ICAO) and EU. Our proposal utilises ICAO PKI implementation, thus requiring very little modifications to the existing infrastructure which is already well established.

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.

A new dynamic accumulator for batch updates

A dynamic accumulator is an algorithm, which gathers together a large set of elements into a constant-size value such that for a given element accumulated, there is a witness confirming that the element was indeed included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set such that the cost of an addition or deletion operation is independent of the number of accumulated elements. Although the first accumulator was presented ten years ago, there is still no standard formal definition of accumulators. In this paper, we generalize formal definitions for accumulators, formulate a security game for dynamic accumulators so-called Chosen Element Attack (CEA), and propose a new dynamic accumulator for batch updates based on the Paillier cryptosystem. Our construction makes a batch of update operations at unit cost. We prove its security under the extended strong RSA (es-RSA) assumption

Threshold privacy preserving keyword searches

We consider the following problem: users of an organization wish to outsource the storage of sensitive data to a large database server. It is assumed that the server storing the data is untrusted so the data stored have to be encrypted. We further suppose that the manager of the organization has the right to access all data, but a member of the organization can not access any data alone. The member must collaborate with other members to search for the desired data. In this paper, we investigate the notion of threshold privacy preserving keyword search (TPPKS) and define its security requirements. We construct a TPPKS scheme and show the proof of security under the assumptions of intractability of discrete logarithm, decisional Diffie-Hellman and computational Diffie-Hellman problems.

A game theoretical approach to construction safety in the Repair, Maintenance, Alteration and Addition (RMAA) sector

Safety has long been a problem in the construction industry. Repair, maintenance, alteration and addition (RMAA) sector has emerged to play an important role in the construction industry. It accounted for 53% of the total construction market in Hong Kong in 2007. Safety performance of the RMAA words has been alarming. Statistics indicate that the percentage of fatal industrial accidents arising from RMAA work in Hong Kong was over 56% in 2006 while the remaining 44% was from new works. Effective safety measures to address the safety problems and improve safety performance of the RMAA sector are urgently needed. Unsafe behaviour has been attributed to one of the major causes of accidents. Traditional cost-benefit analysis of workers' safety behaviour seems to be inadequate. This paper proposes to adopt a game theoretical approach to analyse safety behaviour of RMAA workers. Game theory is concerned with the decision-making process in situations where outcomes depend upon choices made by one or more players. A game theoretical model between contractor and worker has been proffered. Mathematical analysis of this game model has been done and implications of the analysis have been discussed.

Effect of trash on the coagulation and flocculation of sugarcane juice

The processing of juice expressed from whole green sugarcane crop (stalk and trash) leads to poor clarification performance, reduced sugar yield and poor raw sugar quality. The cause of these adverse effects is linked to the disproportionate contribution of impurities from the trash component of the crop. This paper reports on the zeta (ζ) potential, average size distribution (d50) and fractal dimension (Df) of limed juice particles derived from various juice types using laser diffraction and dynamic light scattering techniques. The influence of non-sucrose impurities on the interactive energy contributions between sugarcane juice particles was examined on the basis of Derjaguin-Landau-Verwey-Overbeek (DLVO) theory. Results from these investigations have provided evidence (in terms of particle stability) on why juice particles derived from whole green sugarcane crop are relatively difficult to coagulate (and flocculate). The presence of trash reduces the van der Waals forces of attraction between particles, thereby reducing coagulation and flocculation processes. It is anticipated that further fundamental work will lead to strategies that could be adopted for clarifying juices expressed from whole green sugarcane crop.

Effect of trash on the coagulation and flocculation of sugarcane juice

The processing of juice expressed from whole green sugarcane crop (stalk and trash) leads to poor clarification performance, reduced sugar yield and poor raw sugar quality. The cause of these adverse effects is linked to the disproportionate contribution of impurities from the trash component of the crop. This paper reports on the zeta (?) potential, average size distribution (d50) and fractal dimension (Df) of limed juice particles derived from various juice types using laser diffraction and dynamic light scattering techniques. The influence of non-sucrose impurities on the interactive energy contributions between sugarcane juice particles was examined on the basis of Derjaguin-Landau-Verwey-Overbeek (DLVO) theory. Results from these investigations have provided evidence (in terms of particle stability) on why juice particles derived from whole green sugarcane crop are relatively difficult to coagulate (and flocculate). The presence of trash reduces the van der Waals forces of attraction between particles, thereby reducing coagulation and flocculation processes. It is anticipated that further fundamental work will lead to strategies that could be adopted for clarifying juices expressed from whole green sugarcane crop.

Investigation of air quality at Lithgow Correctional Centre

This project was conducted at Lithgow Correctional Centre (LCC), NSW, Australia. Air quality field measurements were conducted on two occasions (23-27 May 2012, and 3-8 December 2012), just before and six months after the introduction of smoke free buildings policies (28 May 2012) at the LCC, respectively. The main aims of this project were to: (1) investigate the indoor air quality; (2) quantify the level of exposure to environmental tobacco smoke (ETS); (3) identify the main indoor particle sources; (4) distinguish between PM2.5 / particle number from ETS, as opposed to other sources; and (5) provide recommendations for improving indoor air quality and/or minimising exposure at the LCC. The measurements were conducted in Unit 5.2A, Unit 5.2B, Unit 1.1 and Unit 3.1, together with personal exposure measurements, based on the following parameters: -Indoor and outdoor particle number (PN) concentration in the size range 0.005-3 µm -Indoor and outdoor PM2.5 particle mass concentration -Indoor and outdoor VOC concentrations -Personal particle number exposure levels (in the size range 0.01-0.3 µm) -Indoor and outdoor CO and CO2 concentrations, temperature and relative humidity In order to enhance the outcomes of this project, the indoor and outdoor particle number (PN) concentrations were measured by two additional instruments (CPC 3787) which were not listed in the original proposal.

A meshfree-based local Galerkin method with condensation of degree of freedom for elastic dynamic analysis

Condensation technique of degree of freedom is first proposed to improve the computational efficiency of meshfree method with Galerkin weak form for elastic dynamic analysis. In the present method, scattered nodes without connectivity are divided into several subsets by cells with arbitrary shape. Local discrete equation is established over each cell by using moving Kriging interpolation, in which the nodes that located in the cell are used for approximation. Then local discrete equations can be simplified by condensation of degree of freedom, which transfers equations of inner nodes to equations of boundary nodes based on cells. The global dynamic system equations are obtained by assembling all local discrete equations and are solved by using the standard implicit Newmark’s time integration scheme. In the scheme of present method, the calculation of each cell is carried out by meshfree method, and local search is implemented in interpolation. Numerical examples show that the present method has high computational efficiency and good accuracy in solving elastic dynamic problems.

Matrix metalloproteinase-9 of tubular and macrophage origin contributes to the pathogenesis of renal fibrosis via macrophage recruitment through osteopontin cleavage

A pro-fibrotic role of matrix metalloproteinase-9 (MMP-9) in tubular cell epithelial-mesenchymal transition (EMT) is well established in renal fibrosis; however studies from our group and others have demonstrated some previously unrecognized complexity of MMP-9 that has been overlooked in renal fibrosis. Therefore, the aim of this study was to determine the expression pattern, origin and the exact mechanism underlying the contribution of MMP-9 to unilateral ureteral obstruction (UUO), a well-established model of renal fibrosis via MMP-9 inhibition. Renal MMP-9 expression in BALB/c mice with UUO was examined on day 1, 3, 5, 7, 9, 11 and 14. To inhibit MMP-9 activity, MMP-2/9 inhibitor or MMP-9-neutralizing antibody was administered daily for 4 consecutive days from day 0-3, 6-9 or 10-13 and tissues harvested at day 14. In UUO, there was a bi-phasic early- and late-stage upregulation of MMP-9 activity. Interestingly, tubular epithelial cells (TECs) were the predominant source of MMP-9 during early stage, whereas TECs, macrophages and myofibroblasts produced MMP-9 during late-stage UUO. Early- and late-stage inhibition of MMP-9 in UUO mice significantly reduced tubular cell EMT and renal fibrosis. Moreover, MMP-9 inhibition caused a significant reduction in MMP-9-cleaved osteopontin and macrophage infiltration in UUO kidney. Our in vitro study showed MMP-9-cleaved osteopontin enhanced macrophage transwell migration and MMP-9 of both primary TEC and macrophage induced tubular cell EMT. In summary, our result suggests that MMP-9 of both TEC and macrophage origin may directly or indirectly contribute to the pathogenesis of renal fibrosis via osteopontin cleavage, which, in turn further recruit macrophage and induce tubular cell EMT. Our study also highlights the time dependency of its expression and the potential of stage-specific inhibition strategy against renal fibrosis.

Homologs of FT, CEN and FD respond to developmental and environmental signals affecting growth and flowering in the perennial vine kiwifruit

FLOWERING LOCUS T (FT) and CENTRORADIALIS (CEN) homologs have been implicated in regulation of growth, determinacy and flowering. The roles of kiwifruit FT and CEN were explored using a combination of expression analysis, protein interactions, response to temperature in high-chill and low-chill kiwifruit cultivars and ectopic expression in Arabidopsis and Actinidia. The expression and activity of FT was opposite from that of CEN and incorporated an interaction with a FLOWERING LOCUS D (FD)-like bZIP transcription factor. Accumulation of FT transcript was associated with plant maturity and particular stages of leaf, flower and fruit development, but could be detected irrespective of the flowering process and failed to induce precocious flowering in transgenic kiwifruit. Instead, transgenic plants demonstrated reduced growth and survival rate. Accumulation of FT transcript was detected in dormant buds and stem in response to winter chilling. In contrast, FD in buds was reduced by exposure to cold. CEN transcript accumulated in developing latent buds, but declined before the onset of dormancy and delayed flowering when ectopically expressed in kiwifruit. Our results suggest roles for FT, CEN and FD in integration of developmental and environmental cues that affect dormancy, budbreak and flowering in kiwifruit.

An ancient duplication of apple MYB transcription factors is responsible for novel red fruit-flesh phenotyp

Anthocyanin accumulation is coordinated in plants by a number of conserved transcription factors. In apple (Malus × domestica), an R2R3 MYB transcription factor has been shown to control fruit flesh and foliage anthocyanin pigmentation (MYB10) and fruit skin color (MYB1). However, the pattern of expression and allelic variation at these loci does not explain all anthocyanin-related apple phenotypes. One such example is an open-pollinated seedling of cv Sangrado that has green foliage and develops red flesh in the fruit cortex late in maturity. We used methods that combine plant breeding, molecular biology, and genomics to identify duplicated MYB transcription factors that could control this phenotype. We then demonstrated that the red-flesh cortex phenotype is associated with enhanced expression of MYB110a, a paralog of MYB10. Functional characterization of MYB110a showed that it was able to up-regulate anthocyanin biosynthesis in tobacco (Nicotiana tabacum). The chromosomal location of MYB110a is consistent with a whole-genome duplication event that occurred during the evolution of apple within the Maloideae family. Both MYB10 and MYB110a have conserved function in some cultivars, but they differ in their expression pattern and response to fruit maturity.