The Melbourne Decision-Making Questionnaire : an instrument for measuring patterns for coping with decisional conflict

A study was conducted to examine the factorial validity of the Flinders Decision Making Questionnaire (Mann, 1982), a 31-item self-report inventory designed to measure tendencies to use three major coping patterns identified in the conflict theory of decision making (Janis and Mann, 1977): vigilance, hypervigilance, and defensive avoidance (procrastination, buck-passing, and rationalization). A sample of 2051 university students, comprising samples from Australia (n=262), New Zealand (n=260), the USA (n=475), Japan (n=359), Hong Kong (n=281) and Taiwan (n=414) was administered the DMQ. Factorial validity of the instrument was tested by confirmatory factor analysis with LISREL. Five different substantive models, representing different structural relationships between the decision-coping patterns had unsatisfactory fit to the data and could not be validated. A shortened instrument, containing 22 items, yielded a revised model comprising four identifiable factors-vigilance, hypervigilance, buck-passing, and procrastination. The revised model had adequate fit with data for each country sample and for the total sample, and was confirmed. It is recommended that the 22-item instrument, named the Melbourne DMQ, replace the Flinders DMQ for measurement of decision-coping patterns.

Research participation of individuals with dementia : decisional capacity, informed consent, and considerations for nurse investigators

Decisional capacity is a precious component of personhood and is progressively diminished in dementia. Conducting research with individuals with dementia demands a commitment to ensure the quest for knowledge does not overwhelm the rights of those it is intended to protect. The purposes of this article are to describe current understandings of the concept of decisional capacity, describe recent regulatory developments related to the consideration of additional protections for decisionally impaired adults, and provide recommendations for nurse investigators working with this vulnerable group.

Information for regulating action in sport : metastability and emergence of tactical solutions under ecological constraints

The aims of this chapter are twofold. First, we show how experiments related to nonlinear dynamical systems theory can bring about insights on the interconnectedness of different information sources for action. These include the amount of information as emphasised in conventional models of cognition and action in sport and the nature of perceptual information typically emphasised in the ecological approach. The second aim was to show how, through examining the interconnectedness of these information sources, one can study the emergence of novel tactical solutions in sport; and design experiments where tactical/decisional creativity can be observed. Within this approach it is proposed that perceptual and affective information can be manipulated during practice so that the athlete's cognitive and action systems can be transposed to a meta-stable dynamical performance region where the creation of novel action information may reside.

Towards a provably secure DoS-Resilient key exchange protocol with perfect forward secrecy

Just Fast Keying (JFK) is a simple, efficient and secure key exchange protocol proposed by Aiello et al. (ACM TISSEC, 2004). JFK is well known for its novel design features, notably its resistance to denial-of-service (DoS) attacks. Using Meadows’ cost-based framework, we identify a new DoS vulnerability in JFK. The JFK protocol is claimed secure in the Canetti-Krawczyk model under the Decisional Diffie-Hellman (DDH) assumption. We show that security of the JFK protocol, when reusing ephemeral Diffie-Hellman keys, appears to require the Gap Diffie-Hellman (GDH) assumption in the random oracle model. We propose a new variant of JFK that avoids the identified DoS vulnerability and provides perfect forward secrecy even under the DDH assumption, achieving the full security promised by the JFK protocol.

Understanding pedestrian behaviour at railway level crossings : is there a need for more research?

Aim Collisions between trains and pedestrians are the most likely to result in severe injuries and fatalities when compared to other types of rail crossing accidents. Currently, there is a growing emphasis towards developing effective interventions designed to reduce the prevalence of train–pedestrian collisions. This paper reviews what is currently known regarding the personal and environmental factors that contribute to train–pedestrian collisions, particularly among high-risk groups. Method Studies that reported on the prevalence and characteristics of pedestrian accidents at railway crossings up until June 2012 were searched in electronic databases. Results Males, school children and older pedestrians (and those with disabilities) are disproportionately represented in fatality databases. However, a main theme to emerge is that little is known about the origins of train–pedestrian collisions (especially compared to train–vehicle collisions). In particular, whether collisions result from engaging in deliberate violations versus making decisional errors. This subsequently limits the corresponding development of effective and targeted interventions for high-risk groups as well as crossing locations. Finally, it remains unclear what combination of surveillance and deterrence-based and education-focused campaigns are required to produce lasting reductions in train–pedestrian fatality rates. This paper provides direction for future research into the personal and environmental origins of collisions as well as the development of interventions that aim to attract pedestrians’ attention and ensure crossing rules are respected.

Efficient selective identity-based encryption without random oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in an adaptive-identity attack the adversary is allowed to choose this identity adaptively. Our first system—BB1—is based on the well studied decisional bilinear Diffie–Hellman assumption, and extends naturally to systems with hierarchical identities, or HIBE. Our second system—BB2—is based on a stronger assumption which we call the Bilinear Diffie–Hellman Inversion assumption and provides another approach to building IBE systems. Our first system, BB1, is very versatile and well suited for practical applications: the basic hierarchical construction can be efficiently secured against chosen-ciphertext attacks, and further extended to support efficient non-interactive threshold decryption, among others, all without using random oracles. Both systems, BB1 and BB2, can be modified generically to provide “full” IBE security (i.e., against adaptive-identity attacks), either using random oracles, or in the standard model at the expense of a non-polynomial but easy-to-compensate security reduction.

Shrinking the keys of discrete-log-type lossy trapdoor functions

To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ 2) group elements for a reduction from the decisional Diffie-Hellman assumption (where λ is a security parameter). We propose two realizations of lossy trapdoor functions that achieve public key size of only Θ(λ) group elements in bilinear groups, with a reduction from the decisional Bilinear Diffie-Hellman assumption. Our first construction achieves this result at the expense of a long common reference string of Θ(λ 2) elements, albeit reusable in multiple LTDF instantiations. Our second scheme also achieves public keys of size Θ(λ), entirely in the standard model and in particular without any reference string, at the cost of a slightly more involved construction. The main technical novelty, developed for the second scheme, is a compact encoding technique for generating compressed representations of certain sequences of group elements for the public parameters.

Strong cryptography from weak secrets

Distributed-password public-key cryptography (DPwPKC) allows the members of a group of people, each one holding a small secret password only, to help a leader to perform the private operation, associated to a public-key cryptosystem. Abdalla et al. recently defined this tool [1], with a practical construction. Unfortunately, the latter applied to the ElGamal decryption only, and relied on the DDH assumption, excluding any recent pairing-based cryptosystems. In this paper, we extend their techniques to support, and exploit, pairing-based properties: we take advantage of pairing-friendly groups to obtain efficient (simulation-sound) zero-knowledge proofs, whose security relies on the Decisional Linear assumption. As a consequence, we provide efficient protocols, secure in the standard model, for ElGamal decryption as in [1], but also for Linear decryption, as well as extraction of several identity-based cryptosystems [6,4]. Furthermore, we strenghten their security model by suppressing the useless testPwd queries in the functionality.

An efficient scheme of common secure indices for conjunctive keyword-based retrieval on encrypted data

We consider the following problem: members in a dynamic group retrieve their encrypted data from an untrusted server based on keywords and without any loss of data confidentiality and member’s privacy. In this paper, we investigate common secure indices for conjunctive keyword-based retrieval over encrypted data, and construct an efficient scheme from Wang et al. dynamic accumulator, Nyberg combinatorial accumulator and Kiayias et al. public-key encryption system. The proposed scheme is trapdoorless and keyword-field free. The security is proved under the random oracle, decisional composite residuosity and extended strong RSA assumptions.

Distributed private matching and set operations

Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party’s dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

Threshold privacy preserving keyword searches

We consider the following problem: users of an organization wish to outsource the storage of sensitive data to a large database server. It is assumed that the server storing the data is untrusted so the data stored have to be encrypted. We further suppose that the manager of the organization has the right to access all data, but a member of the organization can not access any data alone. The member must collaborate with other members to search for the desired data. In this paper, we investigate the notion of threshold privacy preserving keyword search (TPPKS) and define its security requirements. We construct a TPPKS scheme and show the proof of security under the assumptions of intractability of discrete logarithm, decisional Diffie-Hellman and computational Diffie-Hellman problems.

A randomized controlled trial protocol testing a decision support intervention for older patients with advanced kidney disease

Aim To assess the effectiveness of a decision support intervention using a pragmatic single blind Randomized Controlled Trial. Background Worldwide the proportion of older people (aged 65 years and over) is rising. This population is known to have a higher prevalence of chronic diseases including chronic kidney disease. The resultant effect of the changing health landscape is seen in the increase in older patients (aged ≥65 years) commencing on dialysis. Emerging evidence suggests that for some older patients dialysis may provide minimal benefit. In a majority of renal units non-dialysis management is offered as an alternative to undertaking dialysis. Research regarding decision-making support that is required to assist this population in choosing between dialysis or non-dialysis management is limited. Design. A multisite single blinded pragmatic randomized controlled trial is proposed. Methods Patients will be recruited from four Queensland public hospitals and randomizd into either the control or intervention group. The decision support intervention is multimodal and includes counselling provided by a trained nurse. The comparator is standard decision-making support. The primary outcomes are decisional regret and decisional conflict. Secondary outcomes are improved knowledge and quality of life. Ethics approval obtained November 2014. Conclusion This is one of the first randomized controlled trials assessing a decision support intervention in older people with advance chronic kidney disease. The results may provide guidance for clinicians in future approaches to assist this population in decision-making to ensure reduced decisional regret and decisional conflict.