Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.

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.

Applying threshold learning theory to teach sustainable business practice in post-graduate engineering education

This paper presents the results of a qualitative action-research inquiry into how a highly diverse cohort of post-graduate students could develop significant capacity in sustainable development within a single unit (course), in this case a compulsory component of four built environment masters programs. The method comprised applying threshold learning theory within the technical discipline of sustainable development, to transform student understanding of sustainable business practice in the built environment. This involved identifying a number of key threshold concepts, which once learned would provide a pathway to having a transformational learning experience. Curriculum was then revised, to focus on stepping through these targeted concepts using a scaffolded, problem-based-learning approach. Challenges included a large class size of 120 students, a majority of international students, and a wide span of disciplinary backgrounds across the spectrum of built environment professionals. Five ‘key’ threshold learning concepts were identified and the renewed curriculum was piloted in Semester 2 of 2011. The paper presents details of the study and findings from a mixed-method evaluation approach through the semester. The outcomes of this study will be used to inform further review of the course in 2012, including further consideration of the threshold concepts. In future, it is anticipated that this case study will inform a framework for rapidly embedding sustainability within curriculum.

Assessing the threshold temperatures among different age and cause-of-deaths

The relationship between temperature and mortality is non-linear and the effect estimates depend on the threshold temperatures selected. However, little is known about whether threshold temperatures differ with age or cause of deaths in the Southern Hemisphere. We conducted polynomial distributed lag non-linear models to assess the threshold temperatures for mortality from all ages (Dall), aged from 15 to 64 (D15-64), 65- 84(D65-84), ≥85 years (D85+), respiratory (RD) and cardiovascular diseases (CVD) in Brisbane, Australia, 1996–2004. We examined both hot and cold thresholds, and the lags of up to 15 days for cold effects and 3 days for hot effects. Results show that for the current day, the cold threshold was 20°C and the hot threshold was 28°C for the groups of Dall, D15-64 and D85+. The cold threshold was higher (23°C) for the group of D65-84 and lower (21°C) for the group of CVD. The hot threshold was higher (29°C) for the group of D65-84 and lower (27°C) for the group of RD. Compared to the current day, for the cold effects of up to 15-day lags, the threshold was lower for the group of D15-64, and the thresholds were higher for the groups of D65-84, D85+, RD and CVD; while for the hot effects of 3-day lags, the threshold was higher for the group of D15-64 and the thresholds were lower for the groups of D65-84 and RD. Temperature thresholds appeared to differ with age and death categories. The elderly and deaths from RD and CVD were more sensitive to temperature stress than the adult group. These findings may have implications in the assessment of temperature-related mortality and development of weather/health warning systems.

Hip and knee kinematics display complex and time-varying sagittal kinematics during repetitive stepping: Implications for design of a functional fatigue model of the knee extensors and flexors

The validity of fatigue protocols involving multi-joint movements, such as stepping, has yet to be clearly defined. Although surface electromyography can monitor the fatigue state of individual muscles, the effects of joint angle and velocity variation on signal parameters are well established. Therefore, the aims of this study were to i) describe sagittal hip and knee kinematics during repetitive stepping ii) identify periods of high inter-trial variability and iii) determine within-test reliability of hip and knee kinematic profiles. A group of healthy men (N = 15) ascended and descended from a knee-high platform wearing a weighted vest (10%BW) for 50 consecutive trials. The hip and knee underwent rapid flexion and extension during step ascent and descent. Variability of hip and knee velocity peaked between 20-40% of the ascent phase and 80-100% of the descent. Significant (p<0.05) reductions in joint range of motion and peak velocity during step ascent were observed, while peak flexion velocity increased during descent. Healthy individuals use complex hip and knee motion to negotiate a knee-high step with kinematic patterns varying across multiple repetitions. These findings have important implications for future studies intending to use repetitive stepping as a fatigue model for the knee extensors and flexors.

Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques

We first classify the state-of-the-art stream authentication problem in the multicast environment and group them into Signing and MAC approaches. A new approach for authenticating digital streams using Threshold Techniques is introduced. The new approach main advantages are in tolerating packet loss, up to a threshold number, and having a minimum space overhead. It is most suitable for multicast applications running over lossy, unreliable communication channels while, in same time, are pertain the security requirements. We use linear equations based on Lagrange polynomial interpolation and Combinatorial Design methods.

Characterisations of ideal threshold schemes

We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes, all ideal threshold schemes can be examined by new points of view and new results on ideal threshold schemes can be discovered.

Ideal threshold schemes from MDS codes

We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.

Ideal threshold schemes from orthogonal arrays

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.

An ideal and robust threshold RSA

We present a novel implementation of the threshold RSA. Our solution is conceptually simple, and leads to an easy design of the system. The signing key is shared in additive form, which is desirable for collaboratively performing cryptographic transformations, and its size, at all times, is logn, where n is the RSA modulus. That is, the system is ideal.

Crystalline Si nanoparticles below crystallization threshold : effects of collisional heating in non-thermal atmospheric-pressure microplasmas

Nucleation and growth of highly crystalline silicon nanoparticles in atmospheric-pressure low-temperature microplasmas at gas temperatures well below the Si crystallization threshold and within a short (100 μs) period of time are demonstrated and explained. The modeling reveals that collision-enhanced ion fluxes can effectively increase the heat flux on the nanoparticle surface and this heating is controlled by the ion density. It is shown that nanoparticles can be heated to temperatures above the crystallization threshold. These combined experimental and theoretical results confirm the effective heating and structure control of Si nanoparticles at atmospheric pressure and low gas temperatures.

Standards that we can 'own' : Threshold Learning Outcomes for Journalism, Public Relations, and Media & Communication Studies

This paper outlines the progress by the JoMeC (Journalism, Media & Communication) Network in developing TLO (Threshold Learning Outcome) statements for Bachelor-level university programs in the disciplines of Journalism, Public Relations and Media & Communications Studies. The paper presents the finalised TLO statement for Journalism, and outlines moves to engage discipline-based groups to further develop preliminary TLOs for Public Relations and Media & Communication Studies. The JoMeC Network was formed in 2011, in response to requirements that from 2014 all degrees and qualifications at Australian universities would be able to demonstrate that they comply with the threshold learning standards set by the Australian Qualifications Framework (AQF). The AQF’s threshold standards define the minimum types and levels of knowledge, skills and capabilities that a student must demonstrate in order to graduate. The Tertiary Education Quality and Standards Agency (TEQSA) will use the AQF’s threshold standards as a key tool in recording and assessing the performance of higher educational institutions, and determining whether they should be registered as Australian Higher Education Providers under the Higher Education Standards Framework. The Office of Learning & Teaching (OLT) places the onus on discipline communities to collaborate in order to develop and ‘own’ the threshold learning standards that can be considered the minimum learning outcomes of university-level programs in that field. With the support of an OLT Grant, the JoMeC Network’s prime goal has been to develop three sets of discipline-specific TLOs – one each for the Journalism, Public Relations, and Media & Communications Studies disciplines. This paper describes the processes of research, consultation, drafting and ongoing revision of the TLO for Journalism. It outlines the processes that the JoMeC Network has taken in developing a preliminary TLO draft to initiate discussion of Public Relations and Media & Communication Studies. The JoMeC Network plans to hand management of further development of these TLOs to scholars within the discipline who will engage with academics and other stakeholders to develop statements that the respective disciplines can embrace and ‘own’.

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.

Threshold MACs

The power of sharing computation in a cryptosystem is crucial in several real-life applications of cryptography. Cryptographic primitives and tasks to which threshold cryptosystems have been applied include variants of digital signature, identification, public-key encryption and block ciphers etc. It is desirable to extend the domain of cryptographic primitives which threshold cryptography can be applied to. This paper studies threshold message authentication codes (threshold MACs). Threshold cryptosystems usually use algebraically homomorphic properties of the underlying cryptographic primitives. A typical approach to construct a threshold cryptographic scheme is to combine a (linear) secret sharing scheme with an algebraically homomorphic cryptographic primitive. The lack of algebraic properties of MACs rules out such an approach to share MACs. In this paper, we propose a method of obtaining a threshold MAC using a combinatorial approach. Our method is generic in the sense that it is applicable to any secure conventional MAC by making use of certain combinatorial objects, such as cover-free families and their variants. We discuss the issues of anonymity in threshold cryptography, a subject that has not been addressed previously in the literature in the field, and we show that there are trade-offis between the anonymity and efficiency of threshold MACs.