Practical client puzzles in the standard model

Client puzzles are cryptographic problems that are neither easy nor hard to solve. Most puzzles are based on either number theoretic or hash inversions problems. Hash-based puzzles are very efficient but so far have been shown secure only in the random oracle model; number theoretic puzzles, while secure in the standard model, tend to be inefficient. In this paper, we solve the problem of constucting cryptographic puzzles that are secure int he standard model and are very efficient. We present an efficient number theoretic puzzle that satisfies the puzzle security definition of Chen et al. (ASIACRYPT 2009). To prove the security of our puzzle, we introduce a new variant of the interval discrete logarithm assumption which may be of independent interest, and show this new problem to be hard under reasonable assumptions. Our experimental results show that, for 512-bit modulus, the solution verification time of our proposed puzzle can be up to 50x and 89x faster than the Karame-Capkum puzzle and the Rivest et al.'s time-lock puzzle respectively. In particular, the solution verification tiem of our puzzle is only 1.4x slower than that of Chen et al.'s efficient hash based puzzle.

Cryptographic techniques for managing computational effort

Availability has become a primary goal of information security and is as significant as other goals, in particular, confidentiality and integrity. Maintaining availability of essential services on the public Internet is an increasingly difficult task in the presence of sophisticated attackers. Attackers may abuse limited computational resources of a service provider and thus managing computational costs is a key strategy for achieving the goal of availability. In this thesis we focus on cryptographic approaches for managing computational costs, in particular computational effort. We focus on two cryptographic techniques: computational puzzles in cryptographic protocols and secure outsourcing of cryptographic computations. This thesis contributes to the area of cryptographic protocols in the following ways. First we propose the most efficient puzzle scheme based on modular exponentiations which, unlike previous schemes of the same type, involves only a few modular multiplications for solution verification; our scheme is provably secure. We then introduce a new efficient gradual authentication protocol by integrating a puzzle into a specific signature scheme. Our software implementation results for the new authentication protocol show that our approach is more efficient and effective than the traditional RSA signature-based one and improves the DoSresilience of Secure Socket Layer (SSL) protocol, the most widely used security protocol on the Internet. Our next contributions are related to capturing a specific property that enables secure outsourcing of cryptographic tasks in partial-decryption. We formally define the property of (non-trivial) public verifiability for general encryption schemes, key encapsulation mechanisms (KEMs), and hybrid encryption schemes, encompassing public-key, identity-based, and tag-based encryption avors. We show that some generic transformations and concrete constructions enjoy this property and then present a new public-key encryption (PKE) scheme having this property and proof of security under the standard assumptions. Finally, we combine puzzles with PKE schemes for enabling delayed decryption in applications such as e-auctions and e-voting. For this we first introduce the notion of effort-release PKE (ER-PKE), encompassing the well-known timedrelease encryption and encapsulated key escrow techniques. We then present a security model for ER-PKE and a generic construction of ER-PKE complying with our security notion.

The missing puzzle : birth of a format

The art of storytelling is one of the oldest forms of creative discourse. Apart from finding stories, the most important job in television is the construction of stories to have a broad audience appeal. This first-hand review of Missing Persons Unit, hereafter referred to as MPU, a prime time program on the Nine Network in Australia with immense audience appeal, is an original work by the executive producer (development and series producer Series One, executive producer Series Two and Three) based on an overview of two-and-a-half years of production on three series. Through a case study approach, this Masters project explores how story is constructed into a television format. The thesis comprises two parts: the creative component (weighted 50%) is demonstrated through two programs of MPU (one program for evaluation) and the academic component through a written exegesis (50%). This case study aims to demonstrate how observational hybrid series such as MPU can be managed to quick turn-around schedules with precise skill sets that cut across a number of traditional genre styles. With the advent of radio and then television, storytelling found a home and a series of labels called genres to help place them in a schedule for listeners and viewers to choose. Over recent years, with the advent of digital technology and the rush to collect the masses of content required to feed the growing television slate, storytelling has often been replaced by story gathering. Today even in factual series where a clear story construct is important, third party ‘quick fix’ specialists are hired to shape raw content shot by a field team, who never put their own work together and may never come into the edit suite during a project. This thesis explores the art of storytelling in fast turn-around television. In particular it explores the layer cake approach used in the production process of MPU, that enables producers of fast turn-around television to shepherd their own stories from field through to post-production. While each new hybrid series will require its own particular sets of skills, the exploration of the genesis of MPU will demonstrate the building blocks required to successfully produce this type of factual series. This study is also intended as a ‘road map’ for producers who wish to develop similar series.

Play a role in the patent puzzle

Discusses the contentious issues surrounding computer software patents and patenting in connection with the Peer-to-Patent Australia project, a joint initiative of Queensland University of Technology (QUT) and New York Law School (NYLS) that operates with the support and endorsement of IP Australia, the government body housing Australia's patent office. Explains that the project is based on the successful Peer-to-Patent pilots run recently in the USA and Japan that are designed to improve the quality of issued patents and the patent examination process by facilitating community participation in that process. Describes how members of the public are allowed to put forward prior art references that will be considered by IP Australia's patent examiners when determining whether participating applications are novel and inventive, and therefore deserving of a patent. Concludes that, while Peer-to-Patent Australia is not a complete solution to the problems besetting patent law, the model has considerable advantages over the traditional model of patent examination

The impact of holding costs in the housing affordability puzzle

Research is now emerging which exposes the significance and extent to which even small shifts in the regulatory assessment period, and other factors, affect housing affordability. It suggests that the extent of its significance has not been hitherto completely demonstrated.

Efficient modular exponentiation-based puzzles for denial-of-service protection

Client puzzles are moderately-hard cryptographic problems neither easy nor impossible to solve that can be used as a counter-measure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such as non-parallelisability, deterministic solving time, and linear granularity. We propose an efficient client puzzle based on modular exponentiation. Our puzzle requires only a few modular multiplications for puzzle generation and verification. For a server under denial of service attack, this is a significant improvement as the best known non-parallelisable puzzle proposed by Karame and Capkun (ESORICS 2010) requires at least 2k-bit modular exponentiation, where k is a security parameter. We show that our puzzle satisfies the unforgeability and difficulty properties defined by Chen et al. (Asiacrypt 2009). We present experimental results which show that, for 1024-bit moduli, our proposed puzzle can be up to 30 times faster to verify than the Karame-Capkun puzzle and 99 times faster than the Rivest et al.'s time-lock puzzle.

Piecing together an integrative taxonomic puzzle: microsatellite, wing shape and aedeagus length analyses of Bactrocera dorsalis s.l. (Diptera: Tephritidae) find no evidence of multiple lineages in a proposed contact zone along the Thai/Malay Peninsula

Bactrocera dorsalis (Hendel) and B. papayae Drew & Hancock represent a closely related sibling species pair for which the biological species limits are unclear; i.e., it is uncertain if they are truely two biological species, or one biological species which has been incorrectly taxonomically split. The geographic ranges of the two taxa are thought to abut or overlap on or around the Isthmus of Kra, a recognised biogeographic barrier located on the narrowest portion of the Thai Peninsula. We collected fresh material of B. dorsalis sensu lato (i.e., B. dorsalis sensu stricto + B. papayae) in a north-south transect down the Thai Peninsula, from areas regarded as being exclusively B. dorsalis s.s., across the Kra Isthmus, and into regions regarded as exclusively B. papayae. We carried out microsatellite analyses and took measurements of male genitalia and wing shape. Both the latter morphological tests have been used previously to separate these two taxa. No significant population structuring was found in the microsatellite analysis and results were consistent with an interpretation of one, predominantly panmictic population. Both morphological datasets showed consistent, clinal variation along the transect, with no evidence for disjunction. No evidence in any tests supported historical vicariance driven by the Isthmus of Kra, and none of the three datasets supported the current taxonomy of two species. Rather, within and across the area of range overlap or abutment between the two species, only continuous morphological and genetic variation was recorded. Recognition that morphological traits previously used to separate these taxa are continuous, and that there is no genetic evidence for population segregation in the region of suspected species overlap, is consistent with a growing body of literature that reports no evidence of biological differentiation between these taxa.

Brothers in arms – An experiment on the alliance puzzle

The generic alliance game considers players in an alliance who fight against an external enemy. After victory, the alliance may break up, and its members may fight against each other over the spoils of the victory. Our experimental analysis of this game shows: In-group solidarity vanishes after the break-up of the alliance. Former ‘brothers in arms’ fight even more vigorously against each other than strangers do. Furthermore, this vigorous internal fighting is anticipated and reduces the ability of the alliance to mobilize the joint fighting effort, compared to a situation in which victorious alliance members share the spoils of victory equally and peacefully

Exosomes in prostate cancer: Putting together the pieces of a puzzle

Exosomes have been shown to act as mediators for cell to cell communication and as a potential source of biomarkers for many diseases, including prostate cancer. Exosomes are nanosized vesicles secreted by cells and consist of proteins normally found in multivesicular bodies, RNA, DNA and lipids. As a potential source of biomarkers, exosomes have attracted considerable attention, as their protein content resembles that of their cells of origin, even though it is noted that the proteins, miRNAs and lipids found in the exosomes are not a reflective stoichiometric sampling of the contents from the parent cells. While the biogenesis of exosomes in dendritic cells and platelets has been extensively characterized, much less is known about the biogenesis of exosomes in cancer cells. An understanding of the processes involved in prostate cancer will help to further elucidate the role of exosomes and other extracellular vesicles in prostate cancer progression and metastasis. There are few methodologies available for general isolation of exosomes, however validation of those methodologies is necessary to study the role of exosomal-derived biomarkers in various diseases. In this review, we discuss “exosomes” as a member of the family of extracellular vesicles and their potential to provide candidate biomarkers for prostate cancer.

Crossword puzzle attack on NLS

NLS is one of the stream ciphers submitted to the eSTREAM project. We present a distinguishing attack on NLS by Crossword Puzzle (CP) attack method which is introduced in this paper. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we present the graph showing how the bias of distinguisher vary with Konst. In result, we estimate the bias of the distinguisher to be around O(2^−30). Therefore, we claim that NLS is distinguishable from truly random cipher after observing O(2^60) keystream words. The experiments also show that our distinguishing attack is successful on 90.3% of Konst among 2^32 possible values. We extend the CP attack to NLSv2 which is a tweaked version of NLS. In result, we build a distinguisher which has the bias of around 2− 48. Even though this attack is below the eSTREAM criteria (2^−40), the security margin of NLSv2 seems to be too low.

Multiple modular additions and crossword puzzle attack on NLSv2

NLS is a stream cipher which was submitted to the eSTREAM project. A linear distinguishing attack against NLS was presented by Cho and Pieprzyk, which was called Crossword Puzzle (CP) attack. NLSv2 is a tweak version of NLS which aims mainly at avoiding the CP attack. In this paper, a new distinguishing attack against NLSv2 is presented. The attack exploits high correlation amongst neighboring bits of the cipher. The paper first shows that the modular addition preserves pairwise correlations as demonstrated by existence of linear approximations with large biases. Next, it shows how to combine these results with the existence of high correlation between bits 29 and 30 of the S-box to obtain a distinguisher whose bias is around 2^−37. Consequently, we claim that NLSv2 is distinguishable from a random cipher after observing around 2^74 keystream words.

Piecing the puzzle together : enhancing the quality of road trauma surveillance through linkage of police and health data

This program of research linked police and health data collections to investigate the potential benefits for road safety in terms of enhancing the quality of data. This research has important implications for road safety because, although police collected data has historically underpinned efforts in the area, it is known that many road crashes are not reported to police and that these data lack specific injury severity information. This research shows that data linkage provides a more accurate quantification of the severity and prevalence of road crash injuries which is essential for: prioritising funding; targeting interventions; and estimating the burden and cost of road trauma.

A framework for analysing creative activity within puzzle-game play experiences

This thesis is an analyzing creative processes that can be fostered through computer gaming. Outcomes from the research build on our knowledge of how computer games foster creative thinking. The research proposes guidelines that build upon our understanding of the relationship between the creative processes that players undertake during a game and the components of the game that allow these processes to occur. These guidelines may be used in the game design process to better facilitate creative gameplay activity. A significant research contribution is the ability to create games that facilitate creative thinking through engaging interactions with technology.

Monte Carlo analysis of a puzzle game

When a puzzle game is created, its design parameters must be chosen to allow solvable and interesting challenges to be created for the player. We investigate the use of random sampling as a computationally inexpensive means of automated game analysis, to evaluate the BoxOff family of puzzle games. This analysis reveals useful insights into the game, such as the surprising fact that almost 100% of randomly generated challenges have a solution, but less than 10% will be solved using strictly random play, validating the inventor’s design choices. We show the 1D game to be trivial and the 3D game to be viable.