Computationally sound automated proofs of cryptographic schemes

Proving security of cryptographic schemes, which normally are short algorithms, has been known to be time-consuming and easy to get wrong. Using computers to analyse their security can help to solve the problem. This thesis focuses on methods of using computers to verify security of such schemes in cryptographic models. The contributions of this thesis to automated security proofs of cryptographic schemes can be divided into two groups: indirect and direct techniques. Regarding indirect ones, we propose a technique to verify the security of public-key-based key exchange protocols. Security of such protocols has been able to be proved automatically using an existing tool, but in a noncryptographic model. We show that under some conditions, security in that non-cryptographic model implies security in a common cryptographic one, the Bellare-Rogaway model [11]. The implication enables one to use that existing tool, which was designed to work with a different type of model, in order to achieve security proofs of public-key-based key exchange protocols in a cryptographic model. For direct techniques, we have two contributions. The first is a tool to verify Diffie-Hellmanbased key exchange protocols. In that work, we design a simple programming language for specifying Diffie-Hellman-based key exchange algorithms. The language has a semantics based on a cryptographic model, the Bellare-Rogaway model [11]. From the semantics, we build a Hoare-style logic which allows us to reason about the security of a key exchange algorithm, specified as a pair of initiator and responder programs. The other contribution to the direct technique line is on automated proofs for computational indistinguishability. Unlike the two other contributions, this one does not treat a fixed class of protocols. We construct a generic formalism which allows one to model the security problem of a variety of classes of cryptographic schemes as the indistinguishability between two pieces of information. We also design and implement an algorithm for solving indistinguishability problems. Compared to the two other works, this one covers significantly more types of schemes, but consequently, it can verify only weaker forms of security.

Radiotherapy Monte Carlo simulation using cloud computing technology

Cloud computing allows for vast computational resources to be leveraged quickly and easily in bursts as and when required. Here we describe a technique that allows for Monte Carlo radiotherapy dose calculations to be performed using GEANT4 and executed in the cloud, with relative simulation cost and completion time evaluated as a function of machine count. As expected, simulation completion time decreases as 1=n for n parallel machines, and relative simulation cost is found to be optimal where n is a factor of the total simulation time in hours. Using the technique, we demonstrate the potential usefulness of cloud computing as a solution for rapid Monte Carlo simulation for radiotherapy dose calculation without the need for dedicated local computer hardware as a proof of principal. Funding source Cancer Australia (Department of Health and Ageing) Research Grant 614217

Setting up a platform for plant-based influenza virus vaccine production in South Africa

Background During a global influenza pandemic, the vaccine requirements of developing countries can surpass their supply capabilities, if these exist at all, compelling them to rely on developed countries for stocks that may not be available in time. There is thus a need for developing countries in general to produce their own pandemic and possibly seasonal influenza vaccines. Here we describe the development of a plant-based platform for producing influenza vaccines locally, in South Africa. Plant-produced influenza vaccine candidates are quicker to develop and potentially cheaper than egg-produced influenza vaccines, and their production can be rapidly upscaled. In this study, we investigated the feasibility of producing a vaccine to the highly pathogenic avian influenza A subtype H5N1 virus, the most generally virulent influenza virus identified to date. Two variants of the haemagglutinin (HA) surface glycoprotein gene were synthesised for optimum expression in plants: these were the full-length HA gene (H5) and a truncated form lacking the transmembrane domain (H5tr). The genes were cloned into a panel of Agrobacterium tumefaciens binary plant expression vectors in order to test HA accumulation in different cell compartments. The constructs were transiently expressed in tobacco by means of agroinfiltration. Stable transgenic tobacco plants were also generated to provide seed for stable storage of the material as a pre-pandemic strategy. Results For both transient and transgenic expression systems the highest accumulation of full-length H5 protein occurred in the apoplastic spaces, while the highest accumulation of H5tr was in the endoplasmic reticulum. The H5 proteins were produced at relatively high concentrations in both systems. Following partial purification, haemagglutination and haemagglutination inhibition tests indicated that the conformation of the plant-produced HA variants was correct and the proteins were functional. The immunisation of chickens and mice with the candidate vaccines elicited HA-specific antibody responses. Conclusions We managed, after synthesis of two versions of a single gene, to produce by transient and transgenic expression in plants, two variants of a highly pathogenic avian influenza virus HA protein which could have vaccine potential. This is a proof of principle of the potential of plant-produced influenza vaccines as a feasible pandemic response strategy for South Africa and other developing countries.

Bouncing back : homegrown. Curated exhibition of student work and design workshop

Bouncing Back Architecture Exhibition: This exhibition showcases interpretations of urban resiliency by 2nd and 4th Year undergraduate architecture students who explore the notion of Bouncing Back from the 2011 Queensland floods, in the context of contemporary Brisbane built environment. Design solutions have been expressed in a variety of forms including emergency shelters, flood-proof housing and a range of urban designs, some of which address extreme environmental conditions. Design Process Workshop | Architecture Workshop with Queensland Academy of Creative Industries Students: In collaboration with Homegrown Facilitator Natalie Wright, Lindy Osborne and Glenda Caldwell and some of their architecture students from the QUT School of Design, extended the university design studio experience to 18 Secondary School students, who brainstormed and designed emergency food distribution shelters for those affected by floods. Designs and models created in the workshop were subsequently included in the Bouncing Back Architecture Exhibition.

Maximal structuring of acyclic process models

This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models.

Problem solving in the primary school (K-2)

This article focuses on problem solving activities in a first grade classroom in a typical small community and school in Indiana. But, the teacher and the activities in this class were not at all typical of what goes on in most comparable classrooms; and, the issues that will be addressed are relevant and important for students from kindergarten through college. Can children really solve problems that involve concepts (or skills) that they have not yet been taught? Can children really create important mathematical concepts on their own – without a lot of guidance from teachers? What is the relationship between problem solving abilities and the mastery of skills that are widely regarded as being “prerequisites” to such tasks?Can primary school children (whose toolkits of skills are limited) engage productively in authentic simulations of “real life” problem solving situations? Can three-person teams of primary school children really work together collaboratively, and remain intensely engaged, on problem solving activities that require more than an hour to complete? Are the kinds of learning and problem solving experiences that are recommended (for example) in the USA’s Common Core State Curriculum Standards really representative of the kind that even young children encounter beyond school in the 21st century? … This article offers an existence proof showing why our answers to these questions are: Yes. Yes. Yes. Yes. Yes. Yes. And: No. … Even though the evidence we present is only intended to demonstrate what’s possible, not what’s likely to occur under any circumstances, there is no reason to expect that the things that our children accomplished could not be accomplished by average ability children in other schools and classrooms.

Order conditions of stochastic Runge-Kutta methods by B-series

In this paper, general order conditions and a global convergence proof are given for stochastic Runge Kutta methods applied to stochastic ordinary differential equations ( SODEs) of Stratonovich type. This work generalizes the ideas of B-series as applied to deterministic ordinary differential equations (ODEs) to the stochastic case and allows a completely general formalism for constructing high order stochastic methods, either explicit or implicit. Some numerical results will be given to illustrate this theory.

A lightweight biometric signature scheme for user authentication over networks

We introduce a lightweight biometric solution for user authentication over networks using online handwritten signatures. The algorithm proposed is based on a modified Hausdorff distance and has favorable characteristics such as low computational cost and minimal training requirements. Furthermore, we investigate an information theoretic model for capacity and performance analysis for biometric authentication which brings additional theoretical insights to the problem. A fully functional proof-of-concept prototype that relies on commonly available off-the-shelf hardware is developed as a client-server system that supports Web services. Initial experimental results show that the algorithm performs well despite its low computational requirements and is resilient against over-the-shoulder attacks.

Multi-device key management using visual side channels in pervasive computing environments

In the modern connected world, pervasive computing has become reality. Thanks to the ubiquity of mobile computing devices and emerging cloud-based services, the users permanently stay connected to their data. This introduces a slew of new security challenges, including the problem of multi-device key management and single-sign-on architectures. One solution to this problem is the utilization of secure side-channels for authentication, including the visual channel as vicinity proof. However, existing approaches often assume confidentiality of the visual channel, or provide only insufficient means of mitigating a man-in-the-middle attack. In this work, we introduce QR-Auth, a two-step, 2D barcode based authentication scheme for mobile devices which aims specifically at key management and key sharing across devices in a pervasive environment. It requires minimal user interaction and therefore provides better usability than most existing schemes, without compromising its security. We show how our approach fits in existing authorization delegation and one-time-password generation schemes, and that it is resilient to man-in-the-middle attacks.

A trusted ecosystem for Android applications based on context-aware access control

Private data stored on smartphones is a precious target for malware attacks. A constantly changing environment, e.g. switching network connections, can cause unpredictable threats, and require an adaptive approach to access control. Context-based access control is using dynamic environmental information, including it into access decisions. We propose an "ecosystem-in-an-ecosystem" which acts as a secure container for trusted software aiming at enterprise scenarios where users are allowed to use private devices. We have implemented a proof-of-concept prototype for an access control framework that processes changes to low-level sensors and semantically enriches them, adapting access control policies to the current context. This allows the user or the administrator to maintain fine-grained control over resource usage by compliant applications. Hence, resources local to the trusted container remain under control of the enterprise policy. Our results show that context-based access control can be done on smartphones without major performance impact.

Optical techniques for real-time binary multiplication

An optical system which performs the multiplication of binary numbers is described and proof-of-principle experiments are performed. The simultaneous generation of all partial products, optical regrouping of bit products, and optical carry look-ahead addition are novel features of the proposed scheme which takes advantage of the parallel operations capability of optical computers. The proposed processor uses liquid crystal light valves (LCLVs). By space-sharing the LCLVs one such system could function as an array of multipliers. Together with the optical carry look-ahead adders described, this would constitute an optical matrix-vector multiplier.

Mapping quantitative trait loci in a wild population using linkage and linkage disequilibrium analyses

Historical information can be used, in addition to pedigree, traits and genotypes, to map quantitative trait locus (QTL) in general populations via maximum likelihood estimation of variance components. This analysis is known as linkage disequilibrium (LD) and linkage mapping, because it exploits both linkage in families and LD at the population level. The search for QTL in the wild population of Soay sheep on St. Kilda is a proof of principle. We analysed the data from a previous study and confirmed some of the QTLs reported. The most striking result was the confirmation of a QTL affecting birth weight that had been reported using association tests but not when using linkage-based analyses. Copyright © Cambridge University Press 2010.

Stealing and “Dishonest Application” : defining the difference in Queensland

The 1st July 1997 heralded the implementation of a number of amendments to the Queensland Criminal Code including some intriguing changes affecting the principal property offences of stealing (section 398) and dishonest application (section 408C). This article discusses the impact of the changes. It examines the extent of the amendments and then aims to delineate the ambit of each offence drawing on some of the more recent judgments in the area. It concludes that the offences are moving closer together while retaining many of the complexities of proof experienced in the past.

The phosphate mineral sigloite Fe3+Al2(PO4)2(OH)3·7(H2O), an exception to the paragenesis rule – a vibrational spectroscopic study

The secondary phosphate mineral sigloite Fe3+Al2(PO4)2(OH)3·7H2O is the exception to the rule that phosphate mineral paragenesis is related to the final phase of hydrothermal mineralization at low temperatures. Sigloite was formed as an oxidation pseudomorph after paravauxite, during the last supergene paragenetic stage. We have studied the secondary phosphate mineral sigloite Fe3+Al2(PO4)2(OH)3·7H2O using vibrational spectroscopic techniques. Because the mineral is a phosphate mineral, it is readily studied by spectroscopic techniques as the phosphate and hydrogen phosphate units are readily measured. Indeed, sigloite shows the presence of both phosphate and hydrogen phosphate units in its structure. Raman bands at 1009 cm−1 with shoulders at 993 and 1039 cm−1 are assigned to stretching vibrations of and units. The Raman band at 993 cm−1 is assigned to the ν1 symmetric stretching mode of the POH units, whereas the Raman band at 1009 cm−1 is assigned to the ν1 symmetric stretching mode. Raman bands observed at 506, 528, 571, 596, 619 and 659 cm−1 are attributed to the ν4 out of plane bending modes of the PO4 and H2PO4 units. The Raman bands at 2988, 3118 and 3357 cm−1 are assigned to water stretching vibration. The series of bands at 3422, 3449, 3493, 3552 and 3615 cm−1 are assigned to the OH stretching vibrations of the hydroxyl units. The observation of multiple bands gives credence to the non-equivalence of the OH units in the sigloite structure.

Factors influencing funding decisions by elected politicians at the state/provincial level : a case study of public libraries in Canada

The purpose of this study was to determine factors (internal and external) that influenced Canadian provincial (state) politicians when making funding decisions about public libraries. Using the case study methodology, Canadian provincial/state level funding for public libraries in the 2009-10 fiscal year was examined. After reviewing funding levels across the country, three jurisdictions were chosen for the case: British Columbia's budget revealed dramatically decreased funding, Alberta's budget showed dramatically increased funding, and Ontario's budget was unchanged from the previous year. The primary source of data for the case was a series of semi-structured interviews with elected officials and senior bureaucrats from the three jurisdictions. An examination of primary and secondary documents was also undertaken to help set the political and economic context as well as to provide triangulation for the case interviews. The data were analysed to determine whether Cialdini's theory of influence (2001) and specifically any of the six tactics of influence (i.e, commitment and consistency, authority, liking, social proof, scarcity and reciprocity) were instrumental in these budget processes. Findings show the principles of "authority", "consistency and commitment" and "liking" were relevant, and that "liking" were especially important to these decisions. When these decision makers were considering funding for public libraries, they most often used three distinct lenses: the consistency lens (what are my values? what would my party do?), the authority lens (is someone with hierarchical power telling me to do this? are the requests legitimate?), and most importantly, the liking lens (how much do I like and know about the requester?). These findings are consistent with Cialdini's theory, which suggests the quality of some relationships is one of six factors that can most influence a decision maker. The small number of prior research studies exploring the reasons for increases or decreases in public library funding allocation decisions have given little insight into the factors that motivate those politicians involved in the process and the variables that contribute to these decisions. No prior studies have examined the construct of influence in decision making about funding for Canadian public libraries at any level of government. Additionally, no prior studies have examined the construct of influence in decision making within the context of Canadian provincial politics. While many public libraries are facing difficult decisions in the face of uncertain funding futures, the ability of the sector to obtain favourable responses to requests for increases may require a less simplistic approach than previously thought. The ability to create meaningful connections with individuals in many communities and across all levels of government should be emphasised as a key factor in influencing funding decisions.