G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.

Prevalence and developmental course of 'secret language'.

The prevalence and developmental course of supposed ‘secret language’ was examined in a cohort of twins and closely spaced singletons pairs, with systematic assessments at 20 months and again at 36 months. Two forms of apparent ‘secret language’ were examined: (1) shared understanding—speech directed generally but unintelligible to the parent, although apparently clearly understood within the child pair, and (2) private language directed exclusively to the other twin/sibling—not intelligible to the parent, but apparently clearly understood and used only within the child pair. Both occurred in singleton pairs, but the rate was much higher in twins. In most cases it seemed to be a developmental phenomenon occurring in the second year of life with the emergence of immature speech, and decreasing considerably over the next 16 months. A small group of children, primarily male twins, was reported to use a private language at 36 months. This group had poorer cognitive and language functioning, and was characterized by highly dependent relationships. Some aspects of the twins’ home environment were less stimulating and less responsive, most probably reflecting the abilities and relationships of the children. A follow-up of these children when they were ~6 years of age showed that language outcome was poor for the subgroup (n = 4) who did not develop normal language alongside the use of a private language.

Secret Squirrel Stuff in the Australian Curriculum English: The genesis of the ‘new’ grammar

In much the same way that a squirrel stores a range of food in a range of places, the Australian Curriculum, Assessment and Reporting Authority’s (ACARA) Australian Curriculum: English (ACARA, 2015) stores references to grammar in a range of places. This paper explores some seemingly ‘hidden’ grammars within the AC:E to (re)discover their genesis and how they unfold across Foundation to Year 6. The first ‘Secret Squirrel’ moment centres on the introduction of a new grammar which weaves traditional Latin-based and Systemic Functional Linguistics (SFL) theory. The second ‘Secret Squirrel’ moment centres on the use of one sub-system of SFL Theory, the System of Appraisal, and its potential to provide an analytical lens for ‘reading’ the interpersonal meaning within narratives. The remainder of the paper draws on Goodson’s (1990) notion of curriculum as a social construction, paying attention to the levels of processes and (potential) practice. This part of the paper focuses on the System of Appraisal as it is introduced in the AC:E and then translates the Content Descriptions to an example analysis. One stimulus text, Melanie Watt’s (2012) children’s picture book ‘Scaredy Squirrel at the Beach’, is introduced then analysed using the System of Appraisal as an analytical lens for identifying how language choices ‘go to work’ (Macken-Horarik, 2003, p. 285) on readers, that is how Watt’s language choices are crafted so a ‘compliant’ child reader (Martin & White, 2005, p. 62) has the opportunity to ‘feel with’ and thus ‘adjudicate’ the behaviour of characters in particular ways (Macken-Horarik, 2003, p. 285).

An extended verifiable secret redistribution protocol for archival systems

Existing protocols for archival systems make use of verifiability of shares in conjunction with a proactive secret sharing scheme to achieve high availability and long term confidentiality, besides data integrity. In this paper, we extend an existing protocol (Wong et al. [9]) to take care of more realistic situations. For example, it is assumed in the protocol of Wong et al. that the recipients of the secret shares are all trustworthy; we relax this by requiring that only a majority is trustworthy.

On the secret key capacity of the harary graph PIN model

A pairwise independent network (PIN) model consists of pairwise secret keys (SKs) distributed among m terminals. The goal is to generate, through public communication among the terminals, a group SK that is information-theoretically secure from an eavesdropper. In this paper, we study the Harary graph PIN model, which has useful fault-tolerant properties. We derive the exact SK capacity for a regular Harary graph PIN model. Lower and upper bounds on the fault-tolerant SK capacity of the Harary graph PIN model are also derived.

Fault-tolerant secret key generation

Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol. We formulate a new notion of fault-tolerant secret key capacity, and present an upper bound on it. This upper bound is shown to be tight when the random variables corresponding to the observations of nodes are exchangeable. Further, it is shown that one round of interaction achieves the fault-tolerant secret key capacity in this case. The upper bound is also tight for the case of a pairwise independent network model consisting of a complete graph, and can be attained by a noninteractive protocol.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Converses For Secret Key Agreement and Secure Computing

We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

What we have discovered about the Cold War is what we already knew : Julius Mader and the Western secret services during the Cold War

Maddrell, John, 'What we have discovered about the Cold War is what we already knew: Julius Mader and Western Espionage during the Cold War', Cold War History (2005) 5(2) pp.235-258 RAE2008

Secret Intelligence, Covert Action and Clandestine Diplomacy

Scott, L. (2004). Secret Intelligence, Covert Action and Clandestine Diplomacy. Intelligence and National Security. 19(2), pp.322-341 RAE2008

Eating secret [at Kingston University]

The conference took place at the Penrhyn Road Campus, between 6 and 8 July 2009. This international conference on 'Performing Lives' followed the inaugural conference of the Centre for Life Narratives, 'The Spirit of the Age', the focus of which was 'Writing Lives' (2007). Our second biennial conference 'Performing Lives' (2009) invited analysis and debate on the relationship between life histories and the ways in which they are embodied and enacted in performance, across a range of cultures and a variety of media: drama, dance, film, TV and video.

Eating secret [at Whitstable Biennale Satellite]

Research around ingesting /public perceptions of ‘secret’ and exploring other narratives around our perceptions of food and eating.