Consumer product-related injuries in Queensland children : A snapshot of current problem areas for potential action

This report presents a snapshot from work which was funded by the Queensland Injury Prevention Council in 2010-11 titled “Feasibility of Using Health Data Sources to Inform Product Safety Surveillance in Queensland children”. The project provided an evaluation of the current available evidence-base for identification and surveillance of product-related injuries in children in Queensland and Australia. A comprehensive 300 page report was produced (available at: http://eprints.qut.edu.au/46518/) and a series of recommendations were made which proposed: improvements in the product safety data system, increased utilisation of health data for proactive and reactive surveillance, enhanced collaboration between the health sector and the product safety sector, and improved ability of health data to meet the needs of product safety surveillance. At the conclusion of the project, a Consumer Product Injury Research Advisory group (CPIRAG) was established as a working party to the Queensland Injury Prevention Council (QIPC), to prioritise and advance these recommendations and to work collaboratively with key stakeholders to promote the role of injury data to support product safety policy decisions at the Queensland and national level. This group continues to meet monthly and is comprised of the organisations represented on the second page of this report. One of the key priorities of the CPIRAG group for 2012 was to produce a snapshot report to highlight problem areas for potential action arising out of the larger report. Subsequent funding to write this snapshot report was provided by the Institute for Health and Biomedical Innovation, Injury Prevention and Rehabilitation Domain at QUT in 2012. This work was undertaken by Dr Kirsten McKenzie and researchers from QUT's Centre for Accident Research and Road Safety - Queensland. This snapshot report provides an evidence base for potential further action on a range of children’s products that are significantly represented in injury data. Further information regarding injury hazards, safety advice and regulatory responses are available on the Office of Fair Trading (OFT) Queensland website and the Product Safety Australia websites. Links to these resources are provided for each product reviewed.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only 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 results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.

Security of Two-Party Identity-Based Key Agreement

Identity-based cryptography has become extremely fashionable in the last few years. As a consequence many proposals for identity-based key establishment have emerged, the majority in the two party case. We survey the currently proposed protocols of this type, examining their security and efficiency. Problems with some published protocols are noted.