SCOOT game event : families as partners in learning

How games can be designed to engage families in learning spaces outside of the classroom. SCOOT Game has been played by families in various science museums and art galleries in Australian capital cities since 2004. Families form groups to collaborate in the game that takes them on an SMS quest through these places engaging them with artworks, historic facts, landmarks, puzzles, street performances etc.

An integrated approach to cryptographic mitigation of denial-of-service attacks

Gradual authentication is a principle proposed by Meadows as a way to tackle denial-of-service attacks on network protocols by gradually increasing the confidence in clients before the server commits resources. In this paper, we propose an efficient method that allows a defending server to authenticate its clients gradually with the help of some fast-to-verify measures. Our method integrates hash-based client puzzles along with a special class of digital signatures supporting fast verification. Our hash-based client puzzle provides finer granularity of difficulty and is proven secure in the puzzle difficulty model of Chen et al. (2009). We integrate this with the fast-verification digital signature scheme proposed by Bernstein (2000, 2008). These schemes can be up to 20 times faster for client authentication compared to RSA-based schemes. Our experimental results show that, in the Secure Sockets Layer (SSL) protocol, fast verification digital signatures can provide a 7% increase in connections per second compared to RSA signatures, and our integration of client puzzles with client authentication imposes no performance penalty on the server since puzzle verification is a part of signature verification.

Towards a provably secure DoS-Resilient key exchange protocol with perfect forward secrecy

Just Fast Keying (JFK) is a simple, efficient and secure key exchange protocol proposed by Aiello et al. (ACM TISSEC, 2004). JFK is well known for its novel design features, notably its resistance to denial-of-service (DoS) attacks. Using Meadows’ cost-based framework, we identify a new DoS vulnerability in JFK. The JFK protocol is claimed secure in the Canetti-Krawczyk model under the Decisional Diffie-Hellman (DDH) assumption. We show that security of the JFK protocol, when reusing ephemeral Diffie-Hellman keys, appears to require the Gap Diffie-Hellman (GDH) assumption in the random oracle model. We propose a new variant of JFK that avoids the identified DoS vulnerability and provides perfect forward secrecy even under the DDH assumption, achieving the full security promised by the JFK protocol.

Wilkins Hill : on the cusp of meaning

If contemporary artworks are often considered to be puzzles or riddles, then Wilkins Hill take this to a new level. Their recent exhibition Windows impersonating other windows, confronts viewers with an extremely ludic configuration: a spa bath full of almonds, towel racks placed before photos of Martin Heidegger distorted in neat grids, a video of a water tower in a Hamburg park, wooden cut-out speech bubbles and monitors that continuously play interviews with the artists themselves. What does it all mean?

Introductory Chapter to The Economics of Nonprofit Enterprises

Nonprofit organizations present the analyst with a slew of puzzles. To an economist conditioned to think in terms of objectives and constraints, even the mathematical definition of the beast is a problem. What is a nonprofit organization? How does this definition shape the elaboration of objectives and constraints?

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.

In and out of preschool learning with iPads

In this chapter we describe and explain the ways we negotiated these same epistemological tensions and structural realities as we implemented the iPad loan component of the project reported in this book (hereafter: “iPad loan program”).Children who participated in the iPad loan program were able to take home one of the project iPads used in their preschool centre, much as they were able to take home books and puzzles. This component was one reflection of the ethos of “digital inclusion” that infused the project. As we noted in the introduction to this book, there is international recognition of the role that schools can play in ensuring all communities can participate in digital culture and the digital economy (e.g., European Commission, 2014; United States Government, 2013). Accordingly, we conducted the project in preschool centres where at least some groups of children were thought to enjoy less access to learning on digital platforms than others. Our goal was to put the iPad into the hands of children who might not otherwise have had access to it, while supporting teachers and parents in capitalising on the learning potential of the device for all the children. Centres nominated for the project by administrators in the preschool system all served communities that were either affected by poverty and/or diverse in language and culture.

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.

A Monte-Carlo tree search in argumentation

Monte-Carlo Tree Search (MCTS) is a heuristic to search in large trees. We apply it to argumentative puzzles where MCTS pursues the best argumentation with respect to a set of arguments to be argued. To make our ideas as widely applicable as possible, we integrate MCTS to an abstract setting for argumentation where the content of arguments is left unspecified. Experimental results show the pertinence of this integration for learning argumentations by comparing it with a basic reinforcement learning.