Cryptographic techniques for managing computational effort

Availability has become a primary goal of information security and is as significant as other goals, in particular, confidentiality and integrity. Maintaining availability of essential services on the public Internet is an increasingly difficult task in the presence of sophisticated attackers. Attackers may abuse limited computational resources of a service provider and thus managing computational costs is a key strategy for achieving the goal of availability. In this thesis we focus on cryptographic approaches for managing computational costs, in particular computational effort. We focus on two cryptographic techniques: computational puzzles in cryptographic protocols and secure outsourcing of cryptographic computations. This thesis contributes to the area of cryptographic protocols in the following ways. First we propose the most efficient puzzle scheme based on modular exponentiations which, unlike previous schemes of the same type, involves only a few modular multiplications for solution verification; our scheme is provably secure. We then introduce a new efficient gradual authentication protocol by integrating a puzzle into a specific signature scheme. Our software implementation results for the new authentication protocol show that our approach is more efficient and effective than the traditional RSA signature-based one and improves the DoSresilience of Secure Socket Layer (SSL) protocol, the most widely used security protocol on the Internet. Our next contributions are related to capturing a specific property that enables secure outsourcing of cryptographic tasks in partial-decryption. We formally define the property of (non-trivial) public verifiability for general encryption schemes, key encapsulation mechanisms (KEMs), and hybrid encryption schemes, encompassing public-key, identity-based, and tag-based encryption avors. We show that some generic transformations and concrete constructions enjoy this property and then present a new public-key encryption (PKE) scheme having this property and proof of security under the standard assumptions. Finally, we combine puzzles with PKE schemes for enabling delayed decryption in applications such as e-auctions and e-voting. For this we first introduce the notion of effort-release PKE (ER-PKE), encompassing the well-known timedrelease encryption and encapsulated key escrow techniques. We then present a security model for ER-PKE and a generic construction of ER-PKE complying with our security notion.

The 4C spectrum of fundamental behavioral relations for concurrent systems

The design of concurrent software systems, in particular process-aware information systems, involves behavioral modeling at various stages. Recently, approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that can be used to capture the behavior of concurrent systems, i.e., co-occurrence, conflict, causality, and concurrency. Besides the definition of the spectrum of behavioral relations, which we refer to as the 4C spectrum, we also show that our relations give rise to implication lattices. We further provide operationalizations of the proposed relations, starting by proposing techniques for computing relations in unlabeled systems, which are then lifted to become applicable in the context of labeled systems, i.e., systems in which state transitions have semantic annotations. Finally, we report on experimental results on efficiency of the proposed computations.

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.

Potential interstellar molecules : Formation of neutral C6CO from C6CO- in the gas phase

Computations at the RCCSD(T)/aug-cc-pVDZ//B3LYP/6-31G* level of theory indicate that neutral C6CO is a stable species. The ground state of this neutral is the singlet cumulene oxide :C=C=C=C=C=C=C=O. The adiabatic electron affinity and dipole moment of singlet C6CO are 2.47 eV and 4.13 D, respectively, at this level of theory. The anion (C6CO)(-.) should be a possible precursor to this neutral. It has been formed by an unequivocal synthesis in the ion source of a mass spectrometer by the S(N)2(Si) reaction between (CH3)(3)Si-C=C-C=C-C=C-CO-CMe3 and F- to form C-=C-C=C-C=C-CO-CMe3 which loses Me3C in the source to form C6CO-.. Charge stripping of this anion by vertical Franck-Condon oxidation forms C6CO, characterised by the neutralisation-reionisation spectrum (-NR+) of C6CO-., which is stable during the timeframe of this experiment (10(-6) s), Copyright (C) 2000 John Wiley & Sons, Ltd.

Computational aspects of probabilistic assessment of UAS robust autonomy

As the level of autonomy in Unmanned Aircraft Systems (UAS) increases, there is an imperative need for developing methods to assess robust autonomy. This paper focuses on the computations that lead to a set of measures of robust autonomy. These measures are the probabilities that selected performance indices related to the mission requirements and airframe capabilities remain within regions of acceptable performance.

Cryptanalysis of FORK-256

In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differentials existing for the step transformation. We show their possible uses in different attack scenarios by giving a 1-bit (resp. 2-bit) near collision attack against the full compression function of FORK-256 running with complexity of 2^125 (resp. 2^120) and with negligible memory, and by exhibiting a 22-bit near pseudo-collision. We also show that we can find collisions for the full compression function with a small amount of memory with complexity not exceeding 2^126.6 hash evaluations. We further show how to reduce this complexity to 2^109.6 hash computations by using 273 memory words. Finally, we show that this attack can be extended with no additional cost to find collisions for the full hash function, i.e. with the predefined IV.

A particle based model to simulate microscale morphological changes of plant tissues during drying

Fundamental understanding on microscopic physical changes of plant materials is vital to optimize product quality and processing techniques, particularly in food engineering. Although grid-based numerical modelling can assist in this regard, it becomes quite challenging to overcome the inherited complexities of these biological materials especially when such materials undergo critical processing conditions such as drying, where the cellular structure undergoes extreme deformations. In this context, a meshfree particle based model was developed which is fundamentally capable of handling extreme deformations of plant tissues during drying. The model is built by coupling a particle based meshfree technique: Smoothed Particle Hydrodynamics (SPH) and a Discrete Element Method (DEM). Plant cells were initiated as hexagons and aggregated to form a tissue which also accounts for the characteristics of the middle lamella. In each cell, SPH was used to model cell protoplasm and DEM was used to model the cell wall. Drying was incorporated by varying the moisture content, the turgor pressure, and cell wall contraction effects. Compared to the state of the art grid-based microscale plant tissue drying models, the proposed model can be used to simulate tissues under excessive moisture content reductions incorporating cell wall wrinkling. Also, compared to the state of the art SPH-DEM tissue models, the proposed model better replicates real tissues and the cell-cell interactions used ensure efficient computations. Model predictions showed good agreement both qualitatively and quantitatively with experimental findings on dried plant tissues. The proposed modelling approach is fundamentally flexible to study different cellular structures for their microscale morphological changes at dehydration.

Idealised simulation of downburst winds

Convectively driven downburst winds pose a threat to structures and communities in many regions of Australia not subject to tropical cyclones. Extreme value analysis shows that for return periods of interest to engineering design these events produce higher gust wind speeds than synoptic scale windstorms. Despite this, comparatively little is known of the near ground wind structure of these potentially hazardous windstorms. With this in mind, a series of idealised three-dimensional numerical simulations were undertaken to investigate convective storm wind fields. A dry, non-hydrostatic, sub-cloud model with parameterisation of the microphysics was used. Simulations were run with a uniform 20 m horizontal grid resolution and a variable vertical resolution increasing from 1 m. A systematic grid resolution study showed further refinement did not alter the morphological structure of the outflow. Simulations were performed for stationary downbursts in a quiescent air field, stationary downbursts embedded within environmental boundary layer winds, and also translating downbursts embedded within environmental boundary layer winds.

Nanofabrication of single-crystalline flat-panel display microemitters : a plasma-building unit approach

This contribution is focused on plasma-enhanced chemical vapor deposition systems and their unique features that make them particularly attractive for nanofabrication of flat panel display microemitter arrays based on ordered patterns of single-crystalline carbon nanotip structures. The fundamentals of the plasma-based nanofabrication of carbon nanotips and some other important nanofilms and nanostructures are examined. Specific features, challenges, and potential benefits of using the plasma-based systems for relevant nanofabrication processes are analyzed within the framework of the "plasma-building unit" approach that builds up on extensive experimental data on plasma diagnostics and nanofilm/nanostructure characterization, and numerical simulation of the species composition in the ionized gas phase (multicomponent fluid models), ion dynamics and interaction with ordered carbon nanotip patterns, and ab initio computations of chemical structure of single crystalline carbon nanotips. This generic approach is also applicable for nanoscale assembly of various carbon nanostructures, semiconductor quantum dot structures, and nano-crystalline bioceramics. Special attention is paid to most efficient control strategies of the main plasma-generated building units both in the ionized gas phase and on nanostructured deposition surfaces. The issues of tailoring the reactive plasma environments and development of versatile plasma nanofabrication facilities are also discussed.

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.

A meshfree particle based model for microscale shrinkage mechanisms of food materials in drying conditions

Cells are the fundamental building block of plant based food materials and many of the food processing born structural changes can fundamentally be derived as a function of the deformations of the cellular structure. In food dehydration the bulk level changes in porosity, density and shrinkage can be better explained using cellular level deformations initiated by the moisture removal from the cellular fluid. A novel approach is used in this research to model the cell fluid with Smoothed Particle Hydrodynamics (SPH) and cell walls with Discrete Element Methods (DEM), that are fundamentally known to be robust in treating complex fluid and solid mechanics. High Performance Computing (HPC) is used for the computations due to its computing advantages. Comparing with the deficiencies of the state of the art drying models, the current model is found to be robust in replicating drying mechanics of plant based food materials in microscale.

Relationship of lightning ground flashes to rainfall and wet bulb temperature

The close relationship between rain and lightning is well known. However, there are numerous documented observations of heavy rain accompanied by little or no lightning activity (Williams et al, 1992; Jayaratne, 1993). Kuleshov et al (2002) studied thunderstorm distribution and frequency in Australia and concluded that thunderstorm frequency (as expressed by number of thunder-days) in Australia does not, in general, appear to vary in any consistent way with rainfall. However, thunder-days describe occurrence of thunderstorms as heard by an observer, and therefore could be only proxy data to evaluate actual lightning activity (i.e. number of total or cloud-to-ground flashes). Field experiments have demonstrated a strong increase in lightning activity with convective available potential energy (CAPE). It has also been shown that CAPE increases linearly with potential wet bulb temperature, Tw (Williams et al, 1992). In this study, we examine the relationship between lightning ground flash incidence and the two parameters – surface rainfall and surface wet bulb maximum temperature for selected localities around Australia...

Graph theory based representation of building information models for access control applications

Building information models are increasingly being utilised for facility management of large facilities such as critical infrastructures. In such environments, it is valuable to utilise the vast amount of data contained within the building information models to improve access control administration. The use of building information models in access control scenarios can provide 3D visualisation of buildings as well as many other advantages such as automation of essential tasks including path finding, consistency detection, and accessibility verification. However, there is no mathematical model for building information models that can be used to describe and compute these functions. In this paper, we show how graph theory can be utilised as a representation language of building information models and the proposed security related functions. This graph-theoretic representation allows for mathematically representing building information models and performing computations using these functions.