Empirical approaches in knowledge city research

In the 21st century, it has become apparent that ‘knowledge’ is a major factor of postmodern production (Yigitcanlar et al., 2007). Beyond this, in today’s rapidly globalizing world, knowledge, along with the social and technological settings, is seen as a key to secure economic prosperity and quality of life (Yigitcanlar et al., 2008a). However, limiting the benefits of a ‘knowledge-based development’ to only economic gains—and to a degree to social ones—is quite a narrow sighted view (Yigitcanlar et al., 2008b). Thus, the concept of ‘knowledge-based urban development’ is coined to bring economic prosperity, environmental sustainability, a just socio-spatial order and good governance to cities, and as a result producing a purposefully designed city—i.e., ‘knowledge city’—generating positive environmental and governance outcomes as well as economic and societal ones (Yigitcanlar, 2011; Carrillo et al., 2014).

Forming a joint venture project team for multi-discipline engineering services in Australia

Joint venture design teams are formed to combine resources and expertise in order to secure multi-discipline engineering design services on major projects. Bringing together resources from two ordinarily competing companies to form one joint team is however challenging as each parent company brings to the project its own organisational culture, processes and team attitudes. This study examined the factors that impact on forming a successful joint venture project team. Three critical areas were identified from an extensive literature review; Joint Venture Arrangements, Parent Companies and Forming the Team; and a survey was conducted with professionals who have worked in joint venture project teams in the Australian building industry in order to identify factors that affected successful joint venture team formation, and the common lessons learnt. This study reinforced the importance of three key criteria - trust, commitment and compatibility - for partner alignment. The results also identified four key lessons learnt which included; selecting the right resources, enabling a collaborative working environment by way of project office, implementing an independent Joint Venture Manager, and allocating work which is best for project with fees reflecting risk where risk is disproportionate.

Sustainable creative career development pathways for young people in Tanzania : a case study

Tanzania has a rich and diverse cultural history based in community cultural life. However, at present, young people have limited opportunity to exploit this richness of traditional knowledge and engage in creative jobs as their means of future sustainable employment. Hence, the significant challenge remains: how to integrate and enhance the traditional knowledge in a learning strategy, while there is no “inter-ministerial action and institutional mechanisms” (United Nations 2008, 33-35) to promote creative employment for young people. This article reports on a case study that examined how the two Ministries of Culture and Education might work together to support Tanzania’s young people to secure, and engage successfully in creative jobs. The case study employed mixed methods, incorporating questionnaires, interviews and focus groups. The study was undertaken in Dar-Es-Salaam, Mwanza, Bagamoyo, Dodoma, Lindi and Morogoro from July to October, 2012. This paper discusses some of the issues and argues that there is no practical utilization of traditional knowledge and skills in “putting education to work” (UNESCO 2012, 170) for the better prospects of young people and to reveal the story of their lives. Although this study is specific to Tanzania, the case may also apply to other developing countries.

The Chidiac case : another miscarriage of justice?

On 25 March 1997 the Witness program on Channel 7 screened a story about the conviction of Neil Chidiac in February 1989 for conspiracy to import a trafficable quantity of heroin in NSW. The program questioned the justice of Chidiac's conviction and filmed his recent release from prison on parole after serving over eight years in prison, still protesting his innocence. Witness featured an interview with the chief Crown witness against Chidiac, Alfred Oti, in which Oti completely repudiated the testimony he gave at the trial and admitted to lying at the behest of the police in order to secure advantages for himself...

Food in the city : urban food movements and the (re)imagining of urban spaces

Ethical food movements are growing in number throughout Australia. Amongst these diverse movements are urban agriculture initiatives, which articulate a multitude of social and environmental values. Yet, despite the long history of production and exchange of food in urban areas, planners (and others) often overlook its significance. To assist in addressing this oversight, we take the case study of Melbourne to examine the ways in which participants in urban agriculture are re-imagining urban spaces and the future of agriculture and food systems in Australia. We demonstrate that urban food advocates' politics and practices both challenge and resist the enclosure of urban spaces. This creates new frontiers that transgress social, political, ecological and economic boundaries and edges. These transgressions or counter-enclosures articulate new visions for secure and just food systems and, in so doing, offer insights to assist planners in ensuring Australian cities support socially just and environmentally responsible food systems.

Modelling after-the-fact leakage for key exchange

Security models for two-party authenticated key exchange (AKE) protocols have developed over time to prove the security of AKE protocols even when the adversary learns certain secret values. In this work, we address more granular leakage: partial leakage of long-term secrets of protocol principals, even after the session key is established. We introduce a generic key exchange security model, which can be instantiated allowing bounded or continuous leakage, even when the adversary learns certain ephemeral secrets or session keys. Our model is the strongest known partial-leakage-based security model for key exchange protocols. We propose a generic construction of a two-pass leakage-resilient key exchange protocol that is secure in the proposed model, by introducing a new concept: the leakage-resilient NAXOS trick. We identify a special property for public-key cryptosystems: pair generation indistinguishability, and show how to obtain the leakage-resilient NAXOS trick from a pair generation indistinguishable leakage-resilient public-key cryptosystem.

Key-private proxy re-encryption under LWE

Proxy re-encryption (PRE) is a highly useful cryptographic primitive whereby Alice and Bob can endow a proxy with the capacity to change ciphertext recipients from Alice to Bob, without the proxy itself being able to decrypt, thereby providing delegation of decryption authority. Key-private PRE (KP-PRE) specifies an additional level of confidentiality, requiring pseudo-random proxy keys that leak no information on the identity of the delegators and delegatees. In this paper, we propose a CPA-secure PK-PRE scheme in the standard model (which we then transform into a CCA-secure scheme in the random oracle model). Both schemes enjoy highly desirable properties such as uni-directionality and multi-hop delegation. Unlike (the few) prior constructions of PRE and KP-PRE that typically rely on bilinear maps under ad hoc assumptions, security of our construction is based on the hardness of the standard Learning-With-Errors (LWE) problem, itself reducible from worst-case lattice hard problems that are conjectured immune to quantum cryptanalysis, or “post-quantum”. Of independent interest, we further examine the practical hardness of the LWE assumption, using Kannan’s exhaustive search algorithm coupling with pruning techniques. This leads to state-of-the-art parameters not only for our scheme, but also for a number of other primitives based on LWE published the literature.

Security metrics for Java bytecode programs

Although there are many approaches for developing secure programs, they are not necessarily helpful for evaluating the security of a pre-existing program. Software metrics promise an easy way of comparing the relative security of two programs or assessing the security impact of modifications to an existing one. Most studies in this area focus on high level source code but this approach fails to take compiler-specific code generation into account. In this work we describe a set of object-oriented Java bytecode security metrics which are capable of assessing the security of a compiled program from the point of view of potential information flow. These metrics can be used to compare the security of programs or assess the effect of program modifications on security using a tool which we have developed to automatically measure the security of a given Java bytecode program in terms of the accessibility of distinguished ‘classified’ attributes.

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.

Why not the best schools? [The series]

"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? offers a ten-point, ten-year plan for an education revolution that will result in the transformation of Australia's schools. 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."--publisher website

Efficient selective identity-based encryption without random oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in an adaptive-identity attack the adversary is allowed to choose this identity adaptively. Our first system—BB1—is based on the well studied decisional bilinear Diffie–Hellman assumption, and extends naturally to systems with hierarchical identities, or HIBE. Our second system—BB2—is based on a stronger assumption which we call the Bilinear Diffie–Hellman Inversion assumption and provides another approach to building IBE systems. Our first system, BB1, is very versatile and well suited for practical applications: the basic hierarchical construction can be efficiently secured against chosen-ciphertext attacks, and further extended to support efficient non-interactive threshold decryption, among others, all without using random oracles. Both systems, BB1 and BB2, can be modified generically to provide “full” IBE security (i.e., against adaptive-identity attacks), either using random oracles, or in the standard model at the expense of a non-polynomial but easy-to-compensate security reduction.

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).

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.

Short signature without random oracles and the SDH assumption in bilinear groups

We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability assumption we call Strong Diffie-Hellman (SDH), by analogy to the Strong RSA assumption with which it shares many properties. Signature generation in our system is fast and the resulting signatures are as short as DSA signatures for comparable security. We give a tight reduction proving that our scheme is secure in any group in which the SDH assumption holds, without relying on the random oracle model.