Automated proof for formal indistinguishability and its applications

Bana et al. proposed the relation formal indistinguishability (FIR), i.e. an equivalence between two terms built from an abstract algebra. Later Ene et al. extended it to cover active adversaries and random oracles. This notion enables a framework to verify computational indistinguishability while still offering the simplicity and formality of symbolic methods. We are in the process of making an automated tool for checking FIR between two terms. First, we extend the work by Ene et al. further, by covering ordered sorts and simplifying the way to cope with random oracles. Second, we investigate the possibility of combining algebras together, since it makes the tool scalable and able to cover a wide class of cryptographic schemes. Specially, we show that the combined algebra is still computationally sound, as long as each algebra is sound. Third, we design some proving strategies and implement the tool. Basically, the strategies allow us to find a sequence of intermediate terms, which are formally indistinguishable, between two given terms. FIR between the two given terms is then guaranteed by the transitivity of FIR. Finally, we show applications of the work, e.g. on key exchanges and encryption schemes. In the future, the tool should be extended easily to cover many schemes. This work continues previous research of ours on use of compilers to aid in automated proofs for key exchange.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Juvenile justice and truancy legislation : The move towards parental responsibilisation in Queensland

Much current Queensland media rhetoric, government policy and legislation on truancy and youth justice appears to be based on ideas of responsibilisation – of sheeting responsibility for children’s behaviour back onto their parents. This article examines the evidence of parental responsibility provisions in juvenile justice and truancy legislation in Queensland and the drivers behind this approach. It considers recent legislative initiatives as part of an international trend toward making parents ‘responsible’ for the wrongs of their children. It identifies the parental responsibility rhetoric appearing in recent ministerial statements and associated media reports. It then asks the questions – are these legislative provisions being enforced? And if so, are they successful? Are they simply adding to the administrative burdens placed on teachers and schools, and the socioeconomic burdens placed on already disadvantaged parents? Parental responsibility provisions have been discussed at length in the context of juvenile offending and research suggests that punishing parents for the acts of their children does not decrease delinquency. The paper asks how, as a society, we intend to evaluate these punitive measures against parents?

Parental responsibility and Australian legislative attempts to curb truancy

Statistical and anecdotal evidence suggests that truancy is a significant problem for Australian schools. This paper considers the efficacy of legislative attempts to curb truancy, focussing in particular on the Queensland experience. Both Queensland legislation and the Commonwealth Improving School Enrolment and Attendance Through Welfare reform Measure (SEAM) pilot program are explained and evaluated. The paper considers in particular the utility of parental responsibility strategies as a response to truancy - under the Education (General Provisions) Act 12006 (Queensland) parents of persistent truants may be prosecuted and fined; under the SEAM initiative parents may have their social security payments suspended. Despite the availability of these seemingly draconian penalties, there is a reluctance, in practice, to hold parents accountable. The paper attempts to explain this reluctance and asks whether parental responsibility legislation can deliver a solution to truancy.

A communitarian theory of the education rights of students with disabilities

There is a lack of writing on the issue of the education rights of people with disabilities by authors of any theoretical persuasion. While the deficiency of theory may be explained by a variety of historical, philosophical and practical considerations, it is a deficiency which must be addressed. Otherwise, any statement of rights rings out as hollow rhetoric unsupported by sound reason and moral rectitude. This paper attempts to address this deficiency in education rights theory by postulating a communitarian theory of the education rights of people with disabilities. The theory is developed from communitarian writings on the role of education in democratic society. The communitarian school, like the community within which it nests, is inclusive. Schools both reflect and model the shape of communitarian society and have primary responsibility for teaching the knowledge and virtues which will allow citizens to belong to and function within society. Communitarians emphasise responsibilities, however, as the corollary of rights and require the individual good to yield to community good when the hard cases arise. The article not only explains the basis of the right to an inclusive education, therefore, but also engages with the difficult issue of when such a right may not be enforceable.

Reasonable adjustment and the assessment of students with disabilities: Australian legal issues and trends

Student assessment is particularly important, and particularly controversial, because it is the means by which student achievement is determined. Reasonable adjustment to student assessment is of equal importance as the means of ensuring the mitigation, or even elimination, of disability related barriers to the demonstration of student achievement. The significance of reasonable adjustment is obvious in the later years of secondary school, and in the tertiary sector, because failure to adjust assessment may be asserted as the reason a student did not achieve as well as anticipated or as the reason a student was excluded from a course and, as a result, from future study and employment opportunities. Even in the early years of schooling, however, assessment and its management are a critical issue for staff and students, especially in an education system like Australia’s with an ever increasing emphasis on national benchmarks testing. This paper will explain the legislation which underpins the right to reasonable adjustment in education in Australian schools. It will give examples of the kinds of adjustment which may be made to promote equality of opportunity in the area of assessment. It will also consider some of the controversies which have confronted, or which, it may be speculated, are likely to confront Australian education institutions as they work towards compliance with reasonable adjustment laws.

Group law computations on Jacobians of hyperelliptic Curves

We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor’s general composition involves arithmetic in the polynomial ring F_q[x], the algorithm we propose solves a linear system over the base field which can be written down directly from the Mumford coordinates of the group elements. We apply this method to give more efficient formulas for group operations in both affine and projective coordinates for cryptographic systems based on Jacobians of genus 2 hyperelliptic curves in general form.

PySSM : a Python module for Bayesian inference of linear Gaussian state space models

PySSM is a Python package that has been developed for the analysis of time series using linear Gaussian state space models (SSM). PySSM is easy to use; models can be set up quickly and efficiently and a variety of different settings are available to the user. It also takes advantage of scientific libraries Numpy and Scipy and other high level features of the Python language. PySSM is also used as a platform for interfacing between optimised and parallelised Fortran routines. These Fortran routines heavily utilise Basic Linear Algebra (BLAS) and Linear Algebra Package (LAPACK) functions for maximum performance. PySSM contains classes for filtering, classical smoothing as well as simulation smoothing.