A forward and backward secure key management in wireless sensor networks for PCS/SCADA

Process Control Systems (PCSs) or Supervisory Control and Data Acquisition (SCADA) systems have recently been added to the already wide collection of wireless sensor networks applications. The PCS/SCADA environment is somewhat more amenable to the use of heavy cryptographic mechanisms such as public key cryptography than other sensor application environments. The sensor nodes in the environment, however, are still open to devastating attacks such as node capture, which makes designing a secure key management challenging. In this paper, a key management scheme is proposed to defeat node capture attack by offering both forward and backward secrecies. Our scheme overcomes the pitfalls which Nilsson et al.'s scheme suffers from, and is not more expensive than their scheme.

Twisted Edwards curves revisited

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use . It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to . This implies an effective speed increase by the full factor of 4 over the sequential case. Our results allow faster implementation of elliptic curve scalar multiplication. In addition, the new point addition algorithm can be used to provide a natural protection from side channel attacks based on simple power analysis (SPA).

Jacobi quartic curves revisited

This paper provides new results about efficient arithmetic on Jacobi quartic form elliptic curves, y 2 = d x 4 + 2 a x 2 + 1. With recent bandwidth-efficient proposals, the arithmetic on Jacobi quartic curves became solidly faster than that of Weierstrass curves. These proposals use up to 7 coordinates to represent a single point. However, fast scalar multiplication algorithms based on windowing techniques, precompute and store several points which require more space than what it takes with 3 coordinates. Also note that some of these proposals require d = 1 for full speed. Unfortunately, elliptic curves having 2-times-a-prime number of points, cannot be written in Jacobi quartic form if d = 1. Even worse the contemporary formulae may fail to output correct coordinates for some inputs. This paper provides improved speeds using fewer coordinates without causing the above mentioned problems. For instance, our proposed point doubling algorithm takes only 2 multiplications, 5 squarings, and no multiplication with curve constants when d is arbitrary and a = ±1/2.

Faster group operations on elliptic curves

This paper improves implementation techniques of Elliptic Curve Cryptography. We introduce new formulae and algorithms for the group law on Jacobi quartic, Jacobi intersection, Edwards, and Hessian curves. The proposed formulae and algorithms can save time in suitable point representations. To support our claims, a cost comparison is made with classic scalar multiplication algorithms using previous and current operation counts. Most notably, the best speeds are obtained from Jacobi quartic curves which provide the fastest timings for most scalar multiplication strategies benefiting from the proposed 12M + 5S + 1D point doubling and 7M + 3S + 1D point addition algorithms. Furthermore, the new addition algorithm provides an efficient way to protect against side channel attacks which are based on simple power analysis (SPA). Keywords: Efficient elliptic curve arithmetic,unified addition, side channel attack.

Faster pairings on special Weierstrass curves

This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations.

An in-depth study of a teacher engaged in an innovative primary science trial professional development project

The implementation of effective science programmes in primary schools is of continuing interest and concern for professional developers. As part of the Australian Academy of Science's approach to creating an awareness of Primary Investigations, a project team trialled a series of satellite television broadcasts of lessons related to two units of the curriculum for Year 3 and 4 children in 48 participating schools. The professional development project entitled Simply Science, included a focused component for the respective classroom teachers, which was also conducted by satellite. This paper reports the involvement of a Year 4 teacher in the project and describes her professional growth. Already an experienced and confident teacher, no quantitative changes in science teaching self efficacy were detected. However, her pedagogical content knowledge and confidence to teach science in the concept areas of matter and energy were enhanced. Changes in the teacher's views about the co-operative learning strategies espoused by Primary Investigations were also evident. Implications for the design of professional development programmes for primary science teachers are discussed.

How to extract and expand randomness : a summary and explanation of existing results

We examine the use of randomness extraction and expansion in key agreement (KA) pro- tocols to generate uniformly random keys in the standard model. Although existing works provide the basic theorems necessary, they lack details or examples of appropriate cryptographic primitives and/or parameter sizes. This has lead to the large amount of min-entropy needed in the (non-uniform) shared secret being overlooked in proposals and efficiency comparisons of KA protocols. We therefore summa- rize existing work in the area and examine the security levels achieved with the use of various extractors and expanders for particular parameter sizes. The tables presented herein show that the shared secret needs a min-entropy of at least 292 bits (and even more with more realistic assumptions) to achieve an overall security level of 80 bits using the extractors and expanders we consider. The tables may be used to �nd the min-entropy required for various security levels and assumptions. We also �nd that when using the short exponent theorems of Gennaro et al., the short exponents may need to be much longer than they suggested.

Document clustering with K-tree

This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of Technology. We introduce the K-tree clustering algorithm in an Information Retrieval context by adapting it for document clustering. Many large scale problems exist in document clustering. K-tree scales well with large inputs due to its low complexity. It offers promising results both in terms of efficiency and quality. Document classification was completed using Support Vector Machines.

Supporting mature-aged students from a low socioeconomic background

The aim of the current study was to examine mature-aged student perceptions of university support services and barriers to study. Using a mixed methods approach, interviews and focus groups were conducted with mature-aged students to identify barriers to study, knowledge and use of current student support services, and suggestions to improve upon these services. From these data and an audit of university support services, an online survey was created to examine study barriers and patterns of support service use, as well as, perceptions of proposed support services not currently offered by the university within a larger sample of mature-aged students. Analysis of survey data indicated distinct patterns of barriers and support service use according to socioeconomic status as well as other demographic factors such as, age and enrolment status. Study findings are discussed in terms of generating support services for the retention of mature-aged students of low socioeconomic status and for the retention of mature-aged students in general.

The Order Fulfillment Process Model

This appendix describes the Order Fulfillment process followed by a fictitious company named Genko Oil. The process is freely inspired by the VICS (Voluntary Inter-industry Commerce Solutions) reference model1 and provides a demonstration of YAWL’s capabilities in modelling complex control-flow, data and resourcing requirements.

Process configuration in YAWL

This chapter describes how the YAWL meta-model was extended to support the definition of variation points. These variation points can be used to describe different variants of a YAWL process model in a unified, configurable model. The model can then be configured to suit the needs of specific settings, e.g. for a new organization of project.

Measuring school-related stressors in adolescents

Some 1620 high school students responded to 68 items that measure adolescent stressors. Thirty-five of the items were based on J. P. Kohn and G. H. Frazer's Academic Stress Scale [1(1986) An Academic Stress Scale: Identification and Rated Importance of Academic Stressors, Psychological Reports, Vol. 59, pp. 415–426] developed in the United States, while the remaining 33 items were developed from P. Strutynski's [(1985) A Survey of Queensland Year 10, 11 and 12 Student Attitudes to Schools and Schooling, State Planning Committee, International Youth Year, Brisbane] lists of the most frequently named problems of 2336 Australian high school students. Confirmatory Factor Analysis was used to test and develop a measurement model developed from an extensive review of previous scales. The High School Stressors Scale emerged from the analytic process and measures nine school-related stressors. For researchers focusing on school-related problems and stressors among adolescents, the HSSS promises to be a very useful instrument. It has sound construct and predictive validity and adequate reliability, as demonstrated by the goodness-of-fit indices the squared multiple correlations.

The YAWL Architecture

The YAWL system is structured as a service-oriented architecture. It is composed of an extensible set of YAWL Services [1], each of which is deployed at a certain endpoint and offers one or multiple interfaces. Some of these services are userfacing, meaning that they offer interfaces to end users, while others offer interfaces to applications or other services.

Self-talk in upper primary school children : its relationship with irrational beliefs, self-esteem and depression

Self-talk, irrational beliefs, self-esteem and depression were measured in a sample of 105 elementary school children in Grades 4 to 7. Sex and grade differences in positive self-talk were found. The pattern of correlation coefficients for positive self-talk supported the substantive position that positive self-talk is positively related to self-esteem and negatively related to irrational beliefs and depression in a non-clinical sample of children. However, the same support was not forthcoming for the reverse relationships for negative self-talk. Therapeutic implications are outlined as are suggestions for future research in the area of children's self-talk.