Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽the idea behind the Micali–Sidney scheme is to generate and distribute secret seeds S={s1,…,sd} of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Weaknesses in the initialisation process of the Common Scrambling Algorithm Stream Cipher

The Common Scrambling Algorithm Stream Cipher (CSASC) is a shift register based stream cipher designed to encrypt digital video broadcast. CSA-SC produces a pseudo-random binary sequence that is used to mask the contents of the transmission. In this paper, we analyse the initialisation process of the CSA-SC keystream generator and demonstrate weaknesses which lead to state convergence, slid pairs and shifted keystreams. As a result, the cipher may be vulnerable to distinguishing attacks, time-memory-data trade-off attacks or slide attacks.

CHURNs : freshness assurance for humans

We present CHURNs, a method for providing freshness and authentication assurances to human users. In computer-to-computer protocols, it has long been accepted that assurances of freshness such as random nonces are required to prevent replay attacks. Typically, no such assurance of freshness is presented to a human in a human-and-computer protocol. A Computer–HUman Recognisable Nonce (CHURN) is a computer-aided random sequence that the human has a measure of control over and input into. Our approach overcomes limitations such as ‘humans cannot do random’ and that humans will follow the easiest path. Our findings show that CHURNs are significantly more random than values produced by unaided humans; that humans may be used as a second source of randomness, and we give measurements as to how much randomness can be gained from humans using our approach; and that our CHURN-generator makes the user feel more in control, thus removing the need for complete trust in devices and underlying protocols. We give an example of how a CHURN may be used to provide assurances of freshness and authentication for humans in a widely used protocol.

The Soldier's Wife (LP)

Audio recording of 10 tracks funded by Legacy, The Australia Council, and Arts Queensland. The recordings explore the untold stories of soldiers' wives through song. It features the vocal and songwriting talents of Jackie Marshall, Bertie Page, Sahara Beck, Emma Bosworth, Roz Pappalardo, and Kristy Apps. Recorded, Mixed, Mastered, and Co-Produced by Phil Graham.

Human glutathione S-transferase T1-1 enhances mutagenicity of 1,2-dibromoethane, dibromomethane and 1,2,3,4-diepoxybutane in Salmonella typhimurium

The rat theta class glutathione S-transferase (GST) 5-5 has been shown to affect the mutagenicity of halogenated alkanes and epoxides. In Salmonella typhimurium TA1535 expressing the rat GST5-5 the number of revertants was increased compared to the control strain by CH2Br2, ethylene dibromide (EDB) and 1,2,3,4-diepoxybutane (BDE); in contrast, mutagenicity of 1,2-epoxy-3-(4'-nitrophenoxy)propane (EPNP) was reduced. S.typhimurium TA1535 cells were transformed with an expression plasmid carrying the cDNA of the human theta ortholog GST1-1 either in sense or antisense orientation, the latter being the control. These transformed bacteria were utilized for mutagenicity assays. Mutagenicity of EDB, BDE, CH2Br2, epibromohydrin and 1,3-dichloroacetone was higher in the S.typhimurium TA1535 expressing GSTT1-1 than in the control strain. The expression of active enzyme did not affect the mutagenicity of 1,2-epoxy-3-butene or propylene oxide, GSTT1-1 expression reduced the mutagenicity of EPNP. Glutathione S-transferase 5-5 and GSTT1-1 modulate genotoxicity of several industrially important chemicals in the same way. Polymorphism of the GSTT1 locus in humans may therefore cause differences in cancer susceptibility between the two phenotypes.

Uninhabited

"A young couple go to a remote and deserted coral island for a camping holiday, only to find that the island is inhabited by a ghost seeking retribution for a past outrage. - Written by Bill Bennett " "Synopsis: Based on actual events…. Harry and Beth want a different kind of holiday. So they charter a boat to drop them off on a remote coral island on the Great Barrier Reef. The island is idyllic – surrounded by a wide reef, covered in palms and full of birds and other wildlife, small and totally deserted. Or is it? The young lovers soon come to believe there is someone else on the island. Things go missing from their camp – and then they discover someone else’s footprints in the sand. What they didn’t realise was that the island has a ghost – a young girl who had died in shocking circumstances some eighty years earlier. The ghost at first plays mischievously with the young couple, but then turns malevolent. And their idyllic island holiday becomes a nightmare."

Decriminalization of Health and Safety at Work in Australia

ABOUT THE BOOK As the title Safety or Profit? suggests, health and safety at work needs to be understood in the context of the wider political economy. This book brings together contributions informed by this view from internationally recognized scholars. It reviews the governance of health and safety at work, with special reference to Australia, Canada, Sweden, and the United Kingdom. Three main aspects are discussed. The restructuring of the labor market: this is considered with respect to precarious work and to gender issues and their implications for the health and safety of workers. The neoliberal agenda: this is examined with respect to the diminished power of organized labor, decriminalization, and new governance theory, including an examination of how well the health-and-safety-at-work regimes put in place in many industrial societies about forty years ago have fared and how distinctive the recent emphasis on self-regulation in several countries really is. The role of evidence: there is a dearth of evidence-based policy. The book examines how policy on health and safety at work is formulated at both company and state levels. Cases considered include the scant regard paid to evidence by an official inquiry into future strategy in Canada; the lack of evidence-based policy and the reluctance to observe the precautionary principle with respect to work-related cancer in the United Kingdom; and the failure to learn from past mistakes in the Deepwater Horizon disaster in the Gulf of Mexico. Intended Audience: Researchers; policymakers, trade union representatives, and officials interested in OHS; postgraduate students of OHS; OHS professionals; regulatory and socio-legal scholars.

Correcting flaws in Mitchell’s analysis of EPBC

Efficient error-Propagating Block Chaining (EPBC) is a block cipher mode intended to simultaneously provide both confidentiality and integrity protection for messages. Mitchell’s analysis pointed out a weakness in the EPBC integrity mechanism that can be used in a forgery attack. This paper identifies and corrects a flaw in Mitchell’s analysis of EPBC, and presents other attacks on the EPBC integrity mechanism.

Toward the adaptive generation of bespoke game content

In this chapter, we explore methods for automatically generating game content—and games themselves—adapted to individual players in order to improve their playing experience or achieve a desired effect. This goes beyond notions of mere replayability and involves modeling player needs to maximize their enjoyment, involvement, and interest in the game being played. We identify three main aspects of this process: generation of new content and rule sets, measurement of this content and the player, and adaptation of the game to change player experience. This process forms a feedback loop of constant refinement, as games are continually improved while being played. Framed within this methodology, we present an overview of our recent and ongoing research in this area. This is illustrated by a number of case studies that demonstrate these ideas in action over a variety of game types, including 3D action games, arcade games, platformers, board games, puzzles, and open-world games. We draw together some of the lessons learned from these projects to comment on the difficulties, the benefits, and the potential for personalized gaming via adaptive game design.