Modeling key compromise impersonation attacks on group key exchange protocols

A key exchange protocol allows a set of parties to agree upon a secret session key over a public network. Two-party key exchange (2PKE) protocols have been rigorously analyzed under various models considering different adversarial actions. However, the analysis of group key exchange (GKE) protocols has not been as extensive as that of 2PKE protocols. Particularly, the security attribute of key compromise impersonation (KCI) resilience has so far been ignored for the case of GKE protocols. We first model the security of GKE protocols addressing KCI attacks by both outsider and insider adversaries. We then show that a few existing protocols are not secure even against outsider KCI attacks. The attacks on these protocols demonstrate the necessity of considering KCI resilience for GKE protocols. Finally, we give a new proof of security for an existing GKE protocol under the revised model assuming random oracles.

Modeling key compromise impersonation attacks on group key exchange protocols

Two-party key exchange (2PKE) protocols have been rigorously analyzed under various models considering different adversarial actions. However, the analysis of group key exchange (GKE) protocols has not been as extensive as that of 2PKE protocols. Particularly, an important security attribute called key compromise impersonation (KCI) resilience has been completely ignored for the case of GKE protocols. Informally, a protocol is said to provide KCI resilience if the compromise of the long-term secret key of a protocol participant A does not allow the adversary to impersonate an honest participant B to A. In this paper, we argue that KCI resilience for GKE protocols is at least as important as it is for 2PKE protocols. Our first contribution is revised definitions of security for GKE protocols considering KCI attacks by both outsider and insider adversaries. We also give a new proof of security for an existing two-round GKE protocol under the revised security definitions assuming random oracles. We then show how to achieve insider KCIR in a generic way using a known compiler in the literature. As one may expect, this additional security assurance comes at the cost of an extra round of communication. Finally, we show that a few existing protocols are not secure against outsider KCI attacks. The attacks on these protocols illustrate the necessity of considering KCI resilience for GKE protocols.

Et tu, George? Campaign journalism and the politics of compromise

There is a category of film about journalism in which journalism is not the star, but the supporting player, and journalists not the protagonists but the Greek chorus, commenting on and also changing the realities they report. In such films the news media are a structuring presence driving the plot, shaping the narrative, constructing what we might think of as a pseudo-reality. Like Daniel Boorstin’s notion of the pseudo-event (introduced in his still-relevant book The Image, 1962), this pseudo-reality is so-named because it would not exist were it not for the demands of the news media’s hunger for stories, and knowledge of the damage they can do with those stories, on the calculations and actions of the key actors. Pseudo-realities form as responses to what political actors think journalists and their organisations need and want, or as efforts to shape journalistic accounts in ways favourable to themselves. Films about politics often feature pseudorealities of this kind, in which the events and actions driving the plot have only a tenuous relationship with important things going on in the everyday world beyond the political arena. Everything we see is about image, perception, appearance.

Federal Court Rules O23 r 11 - offers of compromise - offer for dismissal of claim and to forego recovery of costs.

In Uniline Australia Ltd ACN 010752057 v S Briggs Pty Ltd ACN 007415518 (No 2) [2009] FCA 920 Greenwood J considered a number of principles guiding the exercise of discretion in relation to costs, particularly when offers of compromise have been made under the formal process provided by the Federal Court Rules.

Practice and Procedure - offers to settle - no costs benefit if no compromise

In Jones v Millward [2005]QCA76 the Queensland Court of Appeal held that an offer to settle under the UCPR will not attract a costs benefit unless it involves some element of compromise

A happy compromise: Collaborative approaches to school library designing

Designing a school library is a complex, costly and demanding process with important educational and social implications for the whole school community. Drawing upon recent research, this paper presents contrasting snapshots of two school libraries to demonstrate the impacts of greater and lesser collaboration in the designing process. After a brief literature review, the paper outlines the research design (qualitative case study, involving collection and inductive thematic analysis of interview data and student drawings). The select findings highlight the varying experiences of each school’s teacher-librarian through the four designing phases of imagining, transitioning, experiencing and reimagining. Based on the study’s findings, the paper concludes that design outcomes are enhanced through collaboration between professional designers and key school stakeholders including teacher-librarians, teachers, principals and students. The findings and recommendations are of potential interest to teacher-librarians, school principals, education authorities, information professionals and library managers, to guide user-centred library planning and resourcing.

Conditions of Compromise and Failure (The Dickensian Aspect)

‘Conditions of Compromise and Failure (The Dickensian Aspect)' acts as a re-enactment of the common trope of television detective dramas. A result of the artist’s repeated immersions in the television program ‘The Wire’, the work forms a node-map of all the named characters featured on the show. While each coloured thread represents and connects together the Byzantine narrative between all of the characters, the sheer mass of connections obfuscates any clear reading at all.

Preexisting compensatory amino acids compromise fitness costs of a HIV-1 T cell escape mutation.

BACKGROUND: Fitness costs and slower disease progression are associated with a cytolytic T lymphocyte (CTL) escape mutation T242N in Gag in HIV-1-infected individuals carrying HLA-B*57/5801 alleles. However, the impact of different context in diverse HIV-1 strains on the fitness costs due to the T242N mutation has not been well characterized. To better understand the extent of fitness costs of the T242N mutation and the repair of fitness loss through compensatory amino acids, we investigated its fitness impact in different transmitted/founder (T/F) viruses. RESULTS: The T242N mutation resulted in various levels of fitness loss in four different T/F viruses. However, the fitness costs were significantly compromised by preexisting compensatory amino acids in (Isoleucine at position 247) or outside (glutamine at position 219) the CTL epitope. Moreover, the transmitted T242N escape mutant in subject CH131 was as fit as the revertant N242T mutant and the elimination of the compensatory amino acid I247 in the T/F viral genome resulted in significant fitness cost, suggesting the fitness loss caused by the T242N mutation had been fully repaired in the donor at transmission. Analysis of the global circulating HIV-1 sequences in the Los Alamos HIV Sequence Database showed a high prevalence of compensatory amino acids for the T242N mutation and other T cell escape mutations. CONCLUSIONS: Our results show that the preexisting compensatory amino acids in the majority of circulating HIV-1 strains could significantly compromise the fitness loss due to CTL escape mutations and thus increase challenges for T cell based vaccines.

Two-machine shop scheduling: Compromise between flexibility and makespan value

In this paper, we consider the problem of providing flexibility to solutions of two-machine shop scheduling problems. We use the concept of group-scheduling to characterize a whole set of schedules so as to provide more choice to the decision-maker at any decision point. A group-schedule is a sequence of groups of permutable operations defined on each machine where each group is such that any permutation of the operations inside the group leads to a feasible schedule. Flexibility of a solution and its makespan are often conflicting, thus we search for a compromise between a low number of groups and a small value of makespan. We resolve the complexity status of the relevant problems for the two-machine flow shop, job shop and open shop. A number of approximation algorithms are developed and their worst-case performance is analyzed. For the flow shop, an effective heuristic algorithm is proposed and the results of computational experiments are reported.