Continuous monitoring of reservoir water quality: The Wivenhoe Project

The Lake Wivenhoe Integrated Wireless Sensor Network is conceptually similar to traditional SCADA monitoring and control approaches. However, it is applied in an open system using wireless devices to monitor processes that affect water quality at both a high spatial and temporal frequency. This monitoring assists scientists to better understand drivers of key processes that influence water quality and provide the operators with an early warning system if below standard water enters the reservoir. Both of these aspects improve the safety and efficient delivery of drinking water to the end users.

Continuous production of Bi-2212 thick film on silver tape

Bi-2212 thick film on silver tapes are seen as a simple and low cost alternative to high temperature superconducting wires produced by the Powder In Thbe (PIT) technique, particularly in react and wind applications. A rig for the continuous production of Bi-2212 tapes for use in react and wind component manufacture has been developed and commissioned. The rig consists of several sections, each fully automatic, for task specific duties in the production of HTS tape. The major sections are: tape coating, sintering and annealing. High temperature superconducting tapes with engineering critical current densities of 10 kA/cm2 (77 K, self field), and lengths of up to 100 m have been produced using the rig. Properties of the finished tape are discussed and results are presented for current density versus bend radius and applied strain. Depending on tape content and thickness, irreversible strain tirrm varies between 0.04 and 0.1 %. Cyclic bending tests when applied strain does not exceed Eirrm showed negligible reduction in J c along the length of the tape.

Continuous remote emissions monitoring – the lynchpin for air quality management

Diesel particulate matter (DPM), in particular, has been likened in a somewhat inflammatory manner to be the ‘next asbestos’. From the business change perspective, there are three areas holding the industry back from fully engaging with the issue: 1. There is no real feedback loop in any operational sense to assess the impact of investment or application of controls to manage diesel emissions. 2. DPM are getting ever smaller and more numerous, but there is no practical way of measuring them to regulate them in the field. Mass, the current basis of regulation, is becoming less and less relevant. 3. Diesel emissions management is generally wholly viewed as a cost, yet there are significant areas of benefit available from good management. This paper discusses a feedback approach to address these three areas to move the industry forward. The six main areas of benefit from providing a feedback loop by continuously monitoring diesel emissions have been identified: 1. Condition-based maintenance. Emissions change instantaneously if engine condition changes. 2. Operator performance. An operator can use a lot more fuel for little incremental work output through poor technique or discipline. 3. Vehicle utilisation. Operating hours achieved and ratios of idling to under power affect the proportion of emissions produced with no economic value. 4. Fuel efficiency. This allows visibility into other contributing configuration and environmental factors for the vehicle. 5. Emission rates. This allows scope to directly address the required ratio of ventilation to diesel emissions. 6. Total carbon emissions - for NGER-type reporting requirements, calculating the emissions individually from each vehicle rather than just reporting on fuel delivered to a site.

Continuous appearance-based localisation and mapping

This thesis presents a novel approach to mobile robot navigation using visual information towards the goal of long-term autonomy. A novel concept of a continuous appearance-based trajectory is proposed in order to solve the limitations of previous robot navigation systems, and two new algorithms for mobile robots, CAT-SLAM and CAT-Graph, are presented and evaluated. These algorithms yield performance exceeding state-of-the-art methods on public benchmark datasets and large-scale real-world environments, and will help enable widespread use of mobile robots in everyday applications.

Continuous positive air pressure treatment for obstructive sleep apnoea patients : effects on sleep quality and quantity as measured by actigraphy

Objectives Actigraphy can reliably assess sleep in healthy adults and be used to estimate total sleep time in suspected obstructive sleep apnoea (OSA) patients. We compared sleep quality for Continuous Positive Air Pressure (CPAP) treated OSA patients and controls, evaluating the impact of stopping CPAP for one night. Methods 11 men, aged 51–75 years (m = 65.6 years), compliant CPAP users, treated for 1–19 years (m = 7.8 years) wore Cambridge Neurotechnology Ltd actiwatches for one night while using CPAP and for one night sleeping without CPAP. A control group of 11 healthy men, aged 63–74 years (m = 64.1 years) slept normally whilst wearing an actiwatch. Subsequent daytime sleepiness was recorded using Karolinska sleepiness scores (KSS). Results Actimetry showed no significant differences between actual sleep time, sleep efficiency, sleep disturbance index or number of wake bouts when comparing OSA participants using CPAP, with controls; there was no difference in subsequent daytime sleepiness, control KSS = 4.21, OSA KSS = 4.17. Without CPAP there was no significant difference in sleep length or sleep onset latency compared with using CPAP, but there was a significant impact on sleep quality as shown by: increased sleep disturbance index from 7.9 to 13.8 [t(10) = 3.510, P < 0.05], decreased percent of actual sleep from 92.05% to 86.15% [t(10) = 3.51, P < 0.05], decreased sleep efficiency from 86.6% to 81% [t(10) = 2.204, P < 0.05] and increased number of wake bouts from 29 to 42.5 [t(10) = 3.877, P < 0.05]. Daytime sleepiness became significantly worse increasing from KSS 4.17 to 6.27 [t(10) = )4.96, P < 0.05]. Conclusion There was no disparity in sleep quality or KSS scores between CPAP treated OSA patients and healthy controls of a similar age. Treated OSA patients obtained quality sleep with no elevated day time sleepiness. However, cessation of treatment for one night caused sleep quality to deteriorate despite a comparable sleep time; the deterioration in sleep quality could explain the increase in daytime sleepiness. OSA patients need to know that even short-term noncompliance with CPAP treatment significantly impairs sleep quality, leading to excessive sleepiness during monotonous tasks such as driving. Actigraphy successfully identified nights of non-compliance in treated OSA patients; but did not differentiate between the sleep of CPAP treated OSA patients and healthy controls.

Continuous disclosure compliance: Does corporate governance matter?

Our study investigates the quality of firms’ continuous disclosure compliance during mandatory continuous disclosure reform, and whether the compliance quality is impacted by corporate governance, using the New Zealand market as the setting. We use a novel coding of different categories of disclosures (nonroutine, non-procedural and internal), which represents the extent of proprietary insider information inherent in disclosures, to evaluate firms’compliance quality. Our findings provide evidence that firms’ compliance quality improved after the reform, and this improvement is inconsistently impacted by corporate gvernance. Our findings provide important implications for regulators in their quest for a superior disclosure regime

HPAKE : Password authentication secure against cross-site user impersonation

We propose a new kind of asymmetric mutual authentication from passwords with stronger privacy against malicious servers, lest they be tempted to engage in “cross-site user impersonation” to each other. It enables a person to authenticate (with) arbitrarily many independent servers, over adversarial channels, using a memorable and reusable single short password. Beside the usual PAKE security guarantees, our framework goes to lengths to secure the password against brute-force cracking from privileged server information.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Does counting still count? Revisiting the security of counting based user authentication protocols against statistical attacks

At NDSS 2012, Yan et al. analyzed the security of several challenge-response type user authentication protocols against passive observers, and proposed a generic counting based statistical attack to recover the secret of some counting based protocols given a number of observed authentication sessions. Roughly speaking, the attack is based on the fact that secret (pass) objects appear in challenges with a different probability from non-secret (decoy) objects when the responses are taken into account. Although they mentioned that a protocol susceptible to this attack should minimize this difference, they did not give details as to how this can be achieved barring a few suggestions. In this paper, we attempt to fill this gap by generalizing the attack with a much more comprehensive theoretical analysis. Our treatment is more quantitative which enables us to describe a method to theoretically estimate a lower bound on the number of sessions a protocol can be safely used against the attack. Our results include 1) two proposed fixes to make counting protocols practically safe against the attack at the cost of usability, 2) the observation that the attack can be used on non-counting based protocols too as long as challenge generation is contrived, 3) and two main design principles for user authentication protocols which can be considered as extensions of the principles from Yan et al. This detailed theoretical treatment can be used as a guideline during the design of counting based protocols to determine their susceptibility to this attack. The Foxtail protocol, one of the protocols analyzed by Yan et al., is used as a representative to illustrate our theoretical and experimental results.

A coding approach to the multicast stream authentication problem

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.

On the security of PAS (predicate-based authentication service)

Recently a new human authentication scheme called PAS (predicate-based authentication service) was proposed, which does not require the assistance of any supplementary device. The main security claim of PAS is to resist passive adversaries who can observe the whole authentication session between the human user and the remote server. In this paper we show that PAS is insecure against both brute force attack and a probabilistic attack. In particular, we show that its security against brute force attack was strongly overestimated. Furthermore, we introduce a probabilistic attack, which can break part of the password even with a very small number of observed authentication sessions. Although the proposed attack cannot completely break the password, it can downgrade the PAS system to a much weaker system similar to common OTP (one-time password) systems.

Continuous after-the-fact leakage-resilient key exchange

Security models for two-party authenticated key exchange (AKE) protocols have developed over time to provide security even when the adversary learns certain secret keys. In this work, we advance the modelling of AKE protocols by considering more granular, continuous leakage of long-term secrets of protocol participants: the adversary can adaptively request arbitrary leakage of long-term secrets even after the test session is activated, with limits on the amount of leakage per query but no bounds on the total leakage. We present a security model supporting continuous leakage even when the adversary learns certain ephemeral secrets or session keys, and give a generic construction of a two-pass leakage-resilient key exchange protocol that is secure in the model; our protocol achieves continuous, after-the-fact leakage resilience with not much more cost than a previous protocol with only bounded, non-after-the-fact leakage.

Double-authentication-preventing signatures

Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a certain piece of information existed at a certain time. Traditional digital signature schemes however impose no uniqueness conditions, so a trusted authority could make multiple certifications for the same subject but different objects, be it intentionally, by accident, or following a (legal or illegal) coercion. We propose the notion of a double-authentication-preventing signature, in which a value to be signed is split into two parts: a subject and a message. If a signer ever signs two different messages for the same subject, enough information is revealed to allow anyone to compute valid signatures on behalf of the signer. This double-signature forgeability property discourages signers from misbehaving---a form of self-enforcement---and would give binding authorities like CAs some cryptographic arguments to resist legal coercion. We give a generic construction using a new type of trapdoor functions with extractability properties, which we show can be instantiated using the group of sign-agnostic quadratic residues modulo a Blum integer.

Authentication of concast communication

In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is signi.- cantly large and the verifier is relatively weak. In particular, we tackle the problem of message authentication in many-to-one communication networks known as concast communication. The paper presents three signature screening algorithms for a variant of ElGamal-type digital signatures. The cost for these schemes is n applications of hash functions, 2n modular multiplications, and n modular additions plus the verification of one digital signature, where n is the number of signatures. The paper also presents a solution to the open problem of finding a fast screening signature for non-RSA digital signature schemes.