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.

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.

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.

On cheating immune secret sharing

The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong boolean functions. In particular, we prove that for given secret sharing, the average cheating probability over all cheating vectors and all original vectors, i.e., 1/n 2n ∑c=1...n ∑α∈V n ρc,α , denoted by ρ, satisfies ρ ≥ ½, and the equality holds if and only if ρc,α satisfies ρc,α= ½ 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.

Antecedent factors of knowledge sharing in research supervision

Today’s economy is a knowledge-based economy in which knowledge is a crucial facilitator to individuals, as well as being an instigator of success. Due to the impact of globalisation, universities face new challenges and opportunities. Accordingly, they ought to be more innovative and have their own competitive advantages. One of the most important goals of universities is the promotion of students as professional knowledge workers. Therefore, knowledge sharing and transfer at the tertiary level between students and supervisors is vital in universities, as it decreases the budget and provides an affordable way to do research. Knowledge-sharing impact factors can be categorised in three groups, namely: organisational, individual, and technical factors. Individual barriers to knowledge sharing include: the lack of time and trust and the lack of communication skills and social networks. IT systems such as elearning, blogs and portals can increase the knowledge-sharing capability. However, it must be stated that IT systems are only tools and not solutions. Individuals are still responsible for sharing information and knowledge. This paper proposes a new research model to examine the effect of individual factors, organisational factors (learning strategy, trust culture, supervisory support) and technological factors on knowledge sharing in the research supervision process.

Homemade cookbooks : a recipe for sharing

In this paper we contribute to the growing body of research into the use and design of technology in the kitchen. This research aims to identify opportunities for designing technologies that may augment existing cooking traditions and in particular familial recipe sharing practices. Using ethnographic techniques, we identify the homemade cookbook as a significant material and cultural artifact in the family kitchen. We report on findings from our study by providing descriptive accounts of various homemade cookbooks, and offer design considerations for digitally augmenting homemade cookbooks.

Resistances, facilitators and influences on professionals' knowledge sharing behaviour : a case study

The centrality of knowledge sharing to organisations' sustainability has been established. This case study illustrates the influences on individual knowledge sharing decision-making and behaviour among professionals and paraprofessionals - specifically civil engineers and design drafters - in a large public sector organisation that provides transportation infrastructure. The case examines the ways in which overlapping sets of values and behavioural drivers affect knowledge sharing orientation and practices in a collective of experts and novices working in an environment that is largely project-based. The alignment among sector, profession and organisation values provides a supportive environment for knowledge sharing, however individual behaviour is found to be most strongly influenced by the presence and quality of relational capital.

Your Loss is Our Gain

2 x 2.5 metre text based wall painting with a hidden automatic air freshener timed to spray every 60 seconds. The work formed part of a group exhibition that dealt with Humour,Politics and Art. It was part of a series of ongoing works made under the pseudonym Eve Roleston. Roleston is part of a trio of pseudonyms I use, the others being Ernesto Love, and Ernest Olove, to explore the research potential of the fictocritical in a visual arts practice.This forms part of an ongoing body of practice-led research undertaken in my PhD dealing with reconfiguring the relationship between art and politics.

Sharing ink

Sharing Ink is a Guerrilla Kindness work by public artist Sayraphim Lothian. 30 handmade books will be given to 30 local writers and artists to inscribe with a lovely message to a stranger. From 1 – 10 August, 2013, these books will be left out in various places around the Melbourne CBD as a gift to whoever finds them.

Gain's in knowledge, attitude and skills of counselors across three trainings programs

The Global Fund to Fight AIDS, Tuberculosis and Malaria (GFATM) sponsored by the G20 nations has helped fund the development of training programs for HIV/AIDS counselors in India. To date no study has examined the effectiveness of these training programs. This study, therefore, aimed to examine the impact of a 12 training program in improving the knowledge of new HIV/AIDS counselors in West Bengal and compare benefits of three training programs. Pre and post measures were taken from 87 counsellors attending three training programs organized by the GFATM-7 team of the Department of Applied Psychology, University of Calcutta. Overall pre and post training scores of three training programs together show significant improvements in knowledge. The findings from this study provide confidence that the 12 day training program can be effectively implemented among West Bengal HIV/AIDS counsellors.

The effectiveness of information-sharing interventions to reduce anxiety in families waiting for surgical patients undergoing an elective surgical procedure: A systematic review

Background Whilst waiting for patients undergoing surgery, a lack of information regarding the patient’s status and the outcome of surgery, can contribute to the anxiety experienced by family members. Effective strategies for providing information to families are therefore required. Objectives To synthesize the best available evidence in relation to the most effective information-sharing interventions to reduce anxiety for families waiting for patients undergoing an elective surgical procedure. Inclusion criteria Types of participants All studies of family members over 18 years of age waiting for patients undergoing an elective surgical procedure were included, including those waiting for both adult and pediatric patients.   Types of intervention All information-sharing interventions for families of patients undergoing an elective surgical procedure were eligible for inclusion in the review. Types of studies All randomized controlled trials (RCTs) quasi-experimental studies, case-controlled and descriptive studies, comparing one information-sharing intervention to another or to usual care were eligible for inclusion in the review. Types of outcomes Primary outcome: The level of anxiety amongst family members or close relatives whilst waiting for patients undergoing surgery, as measured by a validated instrument such as the S-Anxiety portion of the State-Trait Anxiety Inventory (STAI). Secondary outcomes: Family satisfaction and other measurements that may be considered indicators of stress and anxiety, such as mean arterial pressure (MAP) and heart rate. Search strategy A comprehensive search, restricted to English language only, was undertaken of the following databases from 1990 to May 2013: Medline, CINAHL, EMBASE, ProQuest, Web of Science, PsycINFO, Scopus, Dissertation and Theses PQDT (via ProQuest), Current Contents, CENTRAL, Google Scholar, OpenGrey, Clinical Trials, Science.gov, Current Controlled Trials and National Institute for Clinical Studies (NHMRC). Methodological quality Two independent reviewers critically appraised retrieved papers for methodological quality using the standardized critical appraisal instruments for randomized controlled trials and descriptive studies from the Joanna Briggs Institute Meta Analysis of Statistics Assessment and Review Instruments (JBI-MAStARI). Data extraction Two independent reviewers extracted data from included papers using a customized data extraction form. Data synthesis Statistical pooling was not possible, mainly due to issues with data reporting in two of the studies, therefore the results are presented in narrative form. Results Three studies with a total of 357 participants were included in the review. In-person reporting to family members was found to be effective in comparison with usual care in which no reports were provided. Telephone reporting was also found to be effective at reducing anxiety, in comparison with usual care, although not as effective as in-person reporting. The use of paging devices to keep family members informed were found to increase, rather than decrease anxiety. Conclusions Due to the lack of high quality research in this area, the strength of the conclusions are limited. It appears that in-person and telephone reporting to family members decreases anxiety, however the use of paging devices increases anxiety.