Caring for emergency service personnel : does what we do work?

Most emergency service organisations have some form of staff support program that share general aims of promoting and maintaining the mental health of their workforce. Yet few of these services have been subject to evaluation and fewer still have commissioned external professional researchers to scrutinise their programs. The Queensland Ambulance (QAS) Service provides a comprehensive and multifaceted program that is both proactive and reactive in design and with the support of the Commissioner, was the subject of a rigorous evaluation throughout 2013. In this paper the program services are briefly outlined and the considered approach to the evaluation is presented within the context of existing scientific literature. Using focus groups, information regarding the uptake of the program’s various ‘arms’, and survey data, results suggest the program is widely used and that staff are very satisfied with the services provided. Further, analysis of established psychometric measures demonstrated organisational and interpersonal factors that are important in the promotion of mental health and in warding off the deleterious impacts that frontline emergency service staff can endure. Data presented in this paper indicate how best to ensure a professional quality of life for ambulance personnel, how to promote resilience to the sometimes extremely challenging aspects of the work role, and ways in which difficulties such as depression may be minimised.

Rehabilitation counsellor competency studies : a review of praxis in a human service profession

Competency research in the rehabilitation profession and that of rehabilitation counseling in particular has an extensive pedigree. This article reviews the significant research in the field and details several of the instruments used in competency research to dat. Issues concerning the current use of competency research and the future role of such research is discussed.

Cheating immune secret sharing

We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ ¯= 1 n ⋅ 2 −n ∑ n c=1 ∑ α∈Vn ρ c,α , satisfies ρ ¯⩾ 1 2 , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.

Cheating prevention in linear secret sharing

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.

Cheating prevention in secret sharing over GF(pt)

The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.

Constructions of cheating immune secret sharing

The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. The paper investigates cryptographic properties of the defining function of secret sharing so the scheme is k-cheating immune. Constructions of secret sharing immune against k cheaters are given.

Generalised cumulative arrays in secret sharing

Cumulative arrays have played an important role in the early development of the secret sharing theory. They have not been subject to extensive study so far, as the secret sharing schemes built on them generally result in much larger sizes of shares, when compared with other conventional approaches. Recent works in threshold cryptography show that cumulative arrays may be the appropriate building blocks in non-homomorphic threshold cryptosystems where the conventional secret sharing methods are generally of no use. In this paper we study several extensions of cumulative arrays and show that some of these extensions significantly improve the performance of conventional cumulative arrays. In particular, we derive bounds on generalised cumulative arrays and show that the constructions based on perfect hash families are asymptotically optimal. We also introduce the concept of ramp perfect hash families as a generalisation of perfect hash families for the study of ramp secret sharing schemes and ramp cumulative arrays.

Ideal secret sharing schemes from permutations

The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restriction of regular mappings to permutations gives a convenient tool for investigation of the relation between permutations and ideal secret sharing generated by them.

The transformation of bureaucracy? Structural change in the Commonwealth public service 1983-93

Commentators have predicted bureaucratic organisations would undergo substantial change as a result of social and economic pressures. We ask whether reforms to the Australian public service over the 1983–93 period exemplify this process. We use the methods of organisational analysis to characterise the direction of change, basing our assessment on the standard structural variables of complexity, formalisation and centralisation, together with a cultural variable. We find evidence that, overall, departments of state in the APS were becoming less bureaucratic in their structure, culture and internal function in the 1983–93 period. However, the effect was not uniform across departments, or unambiguous — formalisation, for example, increased in some respects and decreased in others. Centralisation increased overall, despite devolution of some decision-making.

Balancing organizational and professional commitments in professional service firms : the HR practices that matter

Due to their potential to positively influence sales quality and performance and reduce employee turnover in service organizations, HR practices targeting employee commitment have received considerable attention in the HRM literature in recent years. Parallel to this, there has been increasing focus on the nature of commitment, and in particular the existence of multiple commitment foci. In this paper, we examine how HR practices influence professionals' commitment to their organization, to their profession or to both organization and profession, in a qualitative study of three Danish financial investment firms. Our findings suggest that in professional service firms, HR practices encourage high levels of organizational commitment primarily and most often through their influence on professional commitment and that HR practices related to flexible work design are essential in creating balance between an employee's commitment to organization and commitment to their profession. Further, the findings suggest that these same HR practices may foster such high levels of professional commitment that labor turnover will increase when opportunities for pursuing professional goals afforded by work design are restricted.

Exploring innovation driven value creation in B2B service firms : The roles of the manager, employees, and customers in value creation

This study adopts the premise that innovation capability underpins a service firm's value creation ability and that management style, employee behaviors and marketing underpin its innovation capability. This study examines the role of managers and employees in the creation and delivery of superior value to customers via the firm's innovation capability. To test this premise the current study examines the role of transformational leadership (TFL) as an aspect of the service firm's management style in creating and delivering value to customers through its services. This study adopts a multi-level study, collecting data from managers, employees and customers of service firms in a Southeast-Asian country, Cambodia. The results show that a service firm's innovation capability has a positive effect on the firm's value offering (VO), the VO has a positive relationship with customer perceived value-in use (PVI), and PVI has a positive relationship with firm performance. This study also finds moderating effects of TFL on the relationship between service innovation capability and VO, and of service marketing capability on the relationship between VO and PVI respectively.

Lattice-based threshold-changeability for standard CRT secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.

Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Understanding service firms brand value creation : a multilevel perspective including the overarching role of service brand marketing capability

Purpose This study seeks to extend the existing literature on value creation by specifically focusing on service brand value creation (SBVC) and the role of brand marketing. Design/methodology/approach The authors first develop a model of SBVC and simultaneously investigate SBVC from the firm perspective (service brand value offering – SBVO) and from the customer perspective (service brand perceive value-in use – SBPVI). Subsequently, they investigate the effects of SBVO on SBPVI and integrate the moderation role of service brand marketing capability (SBMC) on the relationship between SBVO-SBPVI outcomes. SBVO is viewed as the firms' interpretation of and responsiveness to customer requirements via the delivery of superior performance the value offering through the service brand and SBPVI customers' perceived value from the firms' service brand. The contributions of SBVC to customer-based performance outcomes are then investigated. Hypotheses were tested using a sample of the senior managers of service firms in Cambodia and their customers. A survey was used to gather data via a drop-and-collect approach. Findings Results indicated that SBVO is positively related to SBPVI and SBPVI is positively related to customer-based performance. Noticeably, the results revealed that SBMC enhances the positive relationship between the firm SBVO and the customers SBPVI. Originality/value The paper extends the previous literature on value creation to capture SBVC. More significantly, the premise of the theoretical framework provides a breakthrough in the current SBVC literature which has so far neglected to take into account the dyadic approach (firm-customer) in understanding value creation and more specifically SBVC. The model is expanded by looking at the contingency role of SBMC in communicating value to customers.

Nonlinear secret sharing immune against cheating

The paper investigates the design of secret sharing that is immune against cheating (as defined by the Tompa-Woll attack). We examine secret sharing with binary shares and secrets. Bounds on the probability of successful cheating are given for two cases. The first case relates to secret sharing based on bent functions and results in a non-perfect scheme. The second case considers perfect secret sharing built on highly nonlinear balanced Boolean functions.