Private lawyers in contemporary society : Australia

Admission to practice law in Australia falls under the general supervisory power of supreme court judges in the various jurisdictions. The degree of supervision varies among jurisdictions, but the judiciary generally is responsible for setting the educational requirements for admission. A variety of admission boards perform a number of administrative and supervisory functions; for example, determining whether a particular law school's degree satisfies educational requirements for admission...

The economics of awards, status and performance: the John Bates Clark Medal and the Fellowship of the Econometric Society

This thesis investigates whether receiving an important award in academia raises recipients’ subsequent research productivity and status compared to a synthetic control group of non-recipient scholars with similar previous research performance. It examines the case of being awarded the John Bates Clark Medal and becoming a Fellow of the Econometric Society finding evidence of positive incentive and status effects that raise both productivity and citation levels.

Proteomics science and society :the role of knowledge translation in moving towards clinical applications

Gaining support for proteomics science requires effective knowledge translation. Knowledge translation (KT) processes turn the evidence generated by scientific discovery into recommendations for clinical applications, funding priorities, and policy/regulatory reforms. Clinicians, regulators, and funders need to understand why emerging proteomics knowledge is relevant, and what are the potential applications of that knowledge. A lack of clarity remains about what KT means.

Post-genomic science & society : Getting our fangs into omics science and its implications

Genomics and genetic findings have been hailed with promises of unlocked codes and new frontiers of personalized medicine. Despite cautions about gene hype, the strong cultural pull of genes and genomics has allowed consideration of genomic personhood. Populated by the complicated records of mass spectrometer, proteomics, which studies the human protein, has not achieved either the funding or the popular cultural appeal proteomics scientists had hoped it would. While proteomics, being focused on the proteins that actually indicate and create disease states, has a more direct potential for clinical applications than genomic risk predictions, culturally, it has not provided the material for identity creation. In our ethnographic research, we explore how proteomic scientists attempting to shape an appeal to personhood through which legitimacy may be defined.

Weak key-IV pairs in the A5/1 stream cipher

A5/1 is a shift register based stream cipher which provides privacy for the GSM system. In this paper, we analyse the loading of the secret key and IV during the initialisation process of A5/1. We demonstrate the existence of weak key-IV pairs in the A5/1 cipher due to this loading process; these weak key-IV pairs may generate one, two or three registers containing all-zero values, which may lead in turn to weak keystream sequences. In the case where two or three registers contain only zeros, we describe a distinguisher which leads to a complete decryption of the affected messages.

Twitter and society : an introduction

Since its launch in 2006, Twitter has turned from a niche service to a mass phenomenon. By the beginning of 2013, the platform claims to have more than 200 million active users, who “post over 400 million tweets per day” (Twitter, 2013). Its success is spreading globally; Twitter is now available in 33 different languages, and has significantly increased its support for languages that use non-Latin character sets. While Twitter, Inc. has occasionally changed the appearance of the service and added new features—often in reaction to users’ developing their own conventions, such as adding ‘#’ in front of important keywords to tag them—the basic idea behind the service has stayed the same: users may post short messages (tweets) of up to 140 characters and follow the updates posted by other users. This leads to the formation of complex follower networks with unidirectional as well as bidirectional connections between individuals, but also between media outlets, NGOs, and other organisations. While originally ‘microblogs’ were perceived as a new genre of online communication, of which Twitter was just one exemplar, the platform has become synonymous with microblogging in most countries. A notable exception is Sina Weibo, popular in China where Twitter is not available. Other similar platforms have been shut down (e.g., Jaiku), or are being used in slightly different ways (e.g., Tumblr), thus making Twitter a unique service within the social media landscape.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

Does counting still count? Revisiting the security of counting based user authentication protocols against statistical attacks

At NDSS 2012, Yan et al. analyzed the security of several challenge-response type user authentication protocols against passive observers, and proposed a generic counting based statistical attack to recover the secret of some counting based protocols given a number of observed authentication sessions. Roughly speaking, the attack is based on the fact that secret (pass) objects appear in challenges with a different probability from non-secret (decoy) objects when the responses are taken into account. Although they mentioned that a protocol susceptible to this attack should minimize this difference, they did not give details as to how this can be achieved barring a few suggestions. In this paper, we attempt to fill this gap by generalizing the attack with a much more comprehensive theoretical analysis. Our treatment is more quantitative which enables us to describe a method to theoretically estimate a lower bound on the number of sessions a protocol can be safely used against the attack. Our results include 1) two proposed fixes to make counting protocols practically safe against the attack at the cost of usability, 2) the observation that the attack can be used on non-counting based protocols too as long as challenge generation is contrived, 3) and two main design principles for user authentication protocols which can be considered as extensions of the principles from Yan et al. This detailed theoretical treatment can be used as a guideline during the design of counting based protocols to determine their susceptibility to this attack. The Foxtail protocol, one of the protocols analyzed by Yan et al., is used as a representative to illustrate our theoretical and experimental results.

Everything you do : young adult fiction and surveillance in an age of security

Espionage, surveillance and clandestine operations by secret agencies and governments were something of an East–West obsession in the second half of the twentieth century, a fact reflected in literature and film. In the twenty-first century, concerns of the Cold War and the threat of Communism have been rearticulated in the wake of 9/11. Under the rubric of ‘terror’ attacks, the discourses of security and surveillance are now framed within an increasingly global context. As this article illustrates, surveillance fiction written for young people engages with the cultural and political tropes that reflect a new social order that is different from the Cold War era, with its emphasis on spies, counter espionage, brainwashing and psychological warfare. While these tropes are still evident in much recent literature, advances in technology have transformed the means of tracking, profiling and accumulating data on individuals’ daily activities. Little Brother, The Hunger Games and Article 5 reflect the complex relationship between the real and the imaginary in the world of surveillance and, as this paper discusses, raise moral and ethical issues that are important questions for young people in our age of security.

Certified pseudonyms colligated with master secret key

A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.