The professional identity of child care practitioners : self-authorship as a theoretical framework

This research contributes new understandings about the development of the professional identity of child care practitioners and how professional identity changes during the transition from student to practitioner. Self-authorship theory was used as the framework to investigate the development of professional identity through exploration of beliefs about practice, sense of self, and capabilities for collaborative engagement. Students recruited for this research were completing their qualifications to work with young children in child care settings. Data from initial and follow-up interviews were analysed to understand change over time in professional identity. Findings indicated a need for training institutions and workplaces to move beyond competency-based training approaches to include more critically reflective learning opportunities. Such a focus on critical reflection has implications for improving the skills, status, and recognition of child care practitioners as educators.

Why not the best schools? What we have learned from outstanding schools around the world

Why not the Best Schools? offers a ten-point, ten-year plan for an education revolution that will result in the transformation of Australia’s schools. Expectations have been raised in Australia and comparable countries for an ‘education revolution’ that will secure success for all students in all settings. Such a revolution must ensure the alignment of educational outcomes, the skills required for a strong economy, and the needs of a harmonious society. Why not the Best Schools? goes beyond system characteristics to provide an in-depth account of how transformation occurs in schools. Fifty indicators are provided to help shape strategies for policy makers and practitioners in schools and school systems. Guidelines for leadership and governance ensure a future-focus for those who are determined to ensure that all students will succeed in the twentieth-first century. This book draws on a five-year study culminating in the International Project to Frame the Transformation of Schools conducted in Australia, China, England, Finland, the United States and Wales. The findings are consistent with the McKinsey & Company report on the world’s best performing school systems and those arising from OECD’s PISA.

Functional encryption for threshold functions (or fuzzy IBE) from lattices

Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE).

Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE

We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two new hierarchical identity-based encryption (HIBE) schemes, with and without random oracles. The resulting systems are very different from earlier lattice-based HIBEs and in some cases result in shorter ciphertexts and private keys. We prove security from classic lattice hardness assumptions.

Efficient lattice (H)IBE in the standard model

We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor enables the real system to generate short vectors in all lattices in the family. The other trapdoor enables the simulator to generate short vectors for all lattices in the family except for one. We extend this basic technique to an adaptively-secure IBE and a Hierarchical IBE.

Strong cryptography from weak secrets

Distributed-password public-key cryptography (DPwPKC) allows the members of a group of people, each one holding a small secret password only, to help a leader to perform the private operation, associated to a public-key cryptosystem. Abdalla et al. recently defined this tool [1], with a practical construction. Unfortunately, the latter applied to the ElGamal decryption only, and relied on the DDH assumption, excluding any recent pairing-based cryptosystems. In this paper, we extend their techniques to support, and exploit, pairing-based properties: we take advantage of pairing-friendly groups to obtain efficient (simulation-sound) zero-knowledge proofs, whose security relies on the Decisional Linear assumption. As a consequence, we provide efficient protocols, secure in the standard model, for ElGamal decryption as in [1], but also for Linear decryption, as well as extraction of several identity-based cryptosystems [6,4]. Furthermore, we strenghten their security model by suppressing the useless testPwd queries in the functionality.

Distributed public-key cryptography from weak secrets

We introduce the notion of distributed password-based public-key cryptography, where a virtual high-entropy private key is implicitly defined as a concatenation of low-entropy passwords held in separate locations. The users can jointly perform private-key operations by exchanging messages over an arbitrary channel, based on their respective passwords, without ever sharing their passwords or reconstituting the key. Focusing on the case of ElGamal encryption as an example, we start by formally defining ideal functionalities for distributed public-key generation and virtual private-key computation in the UC model. We then construct efficient protocols that securely realize them in either the RO model (for efficiency) or the CRS model (for elegance). We conclude by showing that our distributed protocols generalize to a broad class of “discrete-log”-based public-key cryptosystems, which notably includes identity-based encryption. This opens the door to a powerful extension of IBE with a virtual PKG made of a group of people, each one memorizing a small portion of the master key.

Flexible IBE and beyond in the commutative-blinding framework

The cryptographic community has, of late, shown much inventiveness in the creation of powerful new IBE-like primitives that go beyond the basic IBE notion and extend it in many new directions. Virtually all of these “super-IBE” schemes rely on bilinear pairings for their implementation, which they tend to use in a surprisingly small number of different ways: three of them as of this writing. What is interesting is that, among the three main frameworks that we know of so far, one has acted as a veritable magnet for the construction of many of these “generalized IBE” primitives, whereas the other two have not been nearly as fruitful in that respect. This refers to the Commutative Blinding framework defined by the Boneh-Boyen [Bscr ][Bscr ]1 IBE scheme from 2004. The aim of this chapter is to try to shed some light on this approach's popularity, first by comparing its key properties with those of the competing frameworks, and then by providing a number of examples that illustrate how those properties have been used.

"The Stratified Record upon Which We Set Our Feet" : The Spatial Turn and the Multilayering of History, Geography, and Geology

In Thomas Mann’s tetralogy of the 1930s and 1940s, Joseph and His Brothers, the narrator declares history is not only “that which has happened and that which goes on happening in time,” but it is also “the stratified record upon which we set our feet, the ground beneath us.” By opening up history to its spatial, geographical, and geological dimensions Mann both predicts and encapsulates the twentieth-century’s “spatial turn,” a critical shift that divested geography of its largely passive role as history’s “stage” and brought to the fore intersections between the humanities and the earth sciences. In this paper, I draw out the relationships between history, narrative, geography, and geology revealed by this spatial turn and the questions these pose for thinking about the disciplinary relationship between geography and the humanities. As Mann’s statement exemplifies, the spatial turn itself has often been captured most strikingly in fiction, and I would argue nowhere more so than in Graham Swift’s Waterland (1983) and Anne Michaels’s Fugitive Pieces (1996), both of which present space, place, and landscape as having a palpable influence on history and memory. The geographical/geological line that runs through both Waterland and Fugitive Pieces continues through Tim Robinson’s non-fictional, two-volume “topographical” history Stones of Aran. Robinson’s Stones of Aran—which is not history, not geography, and not literature, and yet is all three—constructs an imaginative geography that renders inseparable geography, geology, history, memory, and the act of writing.

Imaginative cinematic geographies of Australia : the mapped view in Charles Chauvel's Jedda and Baz Luhrmann's Australia

Cinema is central to the mediation of history and the construction of imaginative geographies that offer a politicized view of the land and its people. This article investigates cinematic representations of landscape and analyses the ways in which maps and journeys in Charles Chauvel’s film Jedda (1955) and Baz Luhrmann’s Australia (2008)—both set in the far North of Australia—articulate conceptions of “Australianness” in relationship to Indigeneity and the land. We argue the exotic tropics and arid outback regions of northern Australia function metonymically as representative of the nation in these films, working to naturalize ideological values and affirm dominant narratives of history, identity, and entitlement.

Lattice-based certificateless public-key encryption in the standard model

The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.

Lattice-based completely non-malleable public-key encryption in the standard model

An encryption scheme is non-malleable if giving an encryption of a message to an adversary does not increase its chances of producing an encryption of a related message (under a given public key). Fischlin introduced a stronger notion, known as complete non-malleability, which requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti later proposed a comparison-based definition of this security notion, which is more in line with the well-studied definitions proposed by Bellare et al. The authors also provide additional feasibility results by proposing two constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Therefore, the only previously known completely non-malleable (and non-interactive) scheme in the standard model, is quite inefficient as it relies on generic NIZK approach. They left the existence of efficient schemes in the common reference string model as an open problem. Recently, two efficient public-key encryption schemes have been proposed by Libert and Yung, and Barbosa and Farshim, both of them are based on pairing identity-based encryption. At ACISP 2011, Sepahi et al. proposed a method to achieve completely non-malleable encryption in the public-key setting using lattices but there is no security proof for the proposed scheme. In this paper we review the mentioned scheme and provide its security proof in the standard model. Our study shows that Sepahi’s scheme will remain secure even for post-quantum world since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best known classical (i.e., non-quantum) algorithms.

Socio-technological phishing prevention

Phishing is deceptive collection of personal information leading to embezzlement, identity theft, and so on. Preventive and combative measures have been taken by banking institutions, software vendors, and network authorities to fight phishing. At the forefront of this resilience are consortiums such as APWG (Anti-Phishing Working Group) and PhishTank, the latter being a collaborative platform where everyone can submit potentially phishing web-pages and classify web-pages as either phish or genuine. PhishTank also has an API that the browsers use to notify users when she tries to load a phishing page. There are some organizations and individuals who are very active and highly accurate in classifying web-pages on PhishTank. In this paper, we propose a defense model that uses these experts to fight phishing.

Settling the Pop Score : Pop Texts and Identity Politics [Book Review]

Review(s) of: Settling the Pop Score: Pop Texts and Identity Politics, Stan Hawkins, Aldershot, Hants. : Ashgate, 2002, ISBN 0 7546 0352 0; pb, 234pp, ill, music exx, bibl. , discog. , index. The scholarly study of popular music has its origins in sociology and cultural studies, disciplinary areas in which musical meaning is often attributed to aspects of economical and sociological function. Against this tradition, recent writers have offered what is now referred to as ‘popular musicology’: a method or approach that tends towards a specific engagement with ‘pop texts’ on aesthetic, and perhaps even ‘musical’ terms. Stan Hawkins uses the term popular musicology ‘at his own peril,’ clearly recognising the implicit scholarly danger in his approach, whereby ‘formalist questions of musical analysis’ are dealt with ‘alongside the more intertextual discursive theorisations of musical expression’ (p. xii). In other words, popular musicologists dare to tread that fine line between text and context. As editor of the journal Popular Musicology Online, Hawkins is a leading advocate of this practice, specifically in the application of music-analytical techniques to popular music. His methodology attests to the influence of other leading figures in the area, notably Richard Middleton, Allan F. Moore and Derek Scott (general editor of the Ashgate Popular and Folk Music Series in which this book is published).