On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Threshold MACs

The power of sharing computation in a cryptosystem is crucial in several real-life applications of cryptography. Cryptographic primitives and tasks to which threshold cryptosystems have been applied include variants of digital signature, identification, public-key encryption and block ciphers etc. It is desirable to extend the domain of cryptographic primitives which threshold cryptography can be applied to. This paper studies threshold message authentication codes (threshold MACs). Threshold cryptosystems usually use algebraically homomorphic properties of the underlying cryptographic primitives. A typical approach to construct a threshold cryptographic scheme is to combine a (linear) secret sharing scheme with an algebraically homomorphic cryptographic primitive. The lack of algebraic properties of MACs rules out such an approach to share MACs. In this paper, we propose a method of obtaining a threshold MAC using a combinatorial approach. Our method is generic in the sense that it is applicable to any secure conventional MAC by making use of certain combinatorial objects, such as cover-free families and their variants. We discuss the issues of anonymity in threshold cryptography, a subject that has not been addressed previously in the literature in the field, and we show that there are trade-offis between the anonymity and efficiency of threshold MACs.

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

kmth price sealed-bid auctions with general independent values and equilibrium linear mark-ups

A generalised bidding model is developed to calculate a bidder’s expected profit and auctioners expected revenue/payment for both a General Independent Value and Independent Private Value (IPV) kmth price sealed-bid auction (where the mth bidder wins at the kth bid payment) using a linear (affine) mark-up function. The Common Value (CV) assumption, and highbid and lowbid symmetric and asymmetric First Price Auctions and Second Price Auctions are included as special cases. The optimal n bidder symmetric analytical results are then provided for the uniform IPV and CV models in equilibrium. Final comments concern implications, the assumptions involved and prospects for further research.

Further development of discrete computational techniques for calculation of restricted diffusion propagators in porous media

Magnetic resonance is a well-established tool for structural characterisation of porous media. Features of pore-space morphology can be inferred from NMR diffusion-diffraction plots or the time-dependence of the apparent diffusion coefficient. Diffusion NMR signal attenuation can be computed from the restricted diffusion propagator, which describes the distribution of diffusing particles for a given starting position and diffusion time. We present two techniques for efficient evaluation of restricted diffusion propagators for use in NMR porous-media characterisation. The first is the Lattice Path Count (LPC). Its physical essence is that the restricted diffusion propagator connecting points A and B in time t is proportional to the number of distinct length-t paths from A to B. By using a discrete lattice, the number of such paths can be counted exactly. The second technique is the Markov transition matrix (MTM). The matrix represents the probabilities of jumps between every pair of lattice nodes within a single timestep. The propagator for an arbitrary diffusion time can be calculated as the appropriate matrix power. For periodic geometries, the transition matrix needs to be defined only for a single unit cell. This makes MTM ideally suited for periodic systems. Both LPC and MTM are closely related to existing computational techniques: LPC, to combinatorial techniques; and MTM, to the Fokker-Planck master equation. The relationship between LPC, MTM and other computational techniques is briefly discussed in the paper. Both LPC and MTM perform favourably compared to Monte Carlo sampling, yielding highly accurate and almost noiseless restricted diffusion propagators. Initial tests indicate that their computational performance is comparable to that of finite element methods. Both LPC and MTM can be applied to complicated pore-space geometries with no analytic solution. We discuss the new methods in the context of diffusion propagator calculation in porous materials and model biological tissues.

Spatial governance: The metalanguage of spatiotemporal information and its infrastructure

‘Spatial governance’ involves a large number of situations where knowledge of place and time is important in achieving acceptable organisational outcomes. This paper argues that spatial governance calls for information-intensive activity in three main areas. The first establishes ‘authority’ in a legal entity to decide issues regarding resources within a territorial jurisdiction. The second involves planning the future use of resources. It engages a language of design, purpose, modeling, visualization, expectations and risk. The third involves monitoring of outcomes to see if expectations are met; and whether changes to authority and planning regimes need to be made in the light of experience. This engages a language of observing, recording, accounting, auditing, statistical indicators and accountability. ‘Authority’, ‘planning’ and ‘monitoring’ regimes can be constructed using a relatively small number of elements, in much the same way that a large number of words with recognisable meanings can be created using a relatively few standardised letters of the alphabet. Words can combine in a similar process of combinatorial explosion to create any message that can be imagined. Similarly, combining authority, planning and monitoring regimes can create a metalanguage of ‘spatial governance’ to give purpose, meaning and value to any spatiotemporal information system that can be imagined, described, interpreted and understood.

A laboratory assessment of the choice of vessel size under individual transferable quota regimes

This paper examines the effect of individual transferable quota regimes on technology choice, such as choice of vessel size, by using the laboratory experiment method. We find that even if vessel sizes change over time, the quota price can converge to the fundamental value conditioned on the vessels chosen. We also find that subjects choose their vessel type to maximise their profits based on the quota trading prices in the previous period. This result implies that the efficiency of quota markets in the beginning period is important because any inefficiency in quota markets may affect vessel sizes in ensuing periods. Moreover, we find that the initial allocations may significantly influence vessel sizes through two channels: first, a higher initial allocation to a subject increases the likelihood that the subject invests in a large-sized vessel; second, the quota price may be higher and more unstable under unequal allocation than under equal allocation; thus, whether the allocation is equal influences subjects' choice of vessel type. © 2014 Australian Agricultural and Resource Economics Society Inc.

A new approach to the cloud-based heterogeneous MapReduce placement problem

Guaranteeing Quality of Service (QoS) with minimum computation cost is the most important objective of cloud-based MapReduce computations. Minimizing the total computation cost of cloud-based MapReduce computations is done through MapReduce placement optimization. MapReduce placement optimization approaches can be classified into two categories: homogeneous MapReduce placement optimization and heterogeneous MapReduce placement optimization. It is generally believed that heterogeneous MapReduce placement optimization is more effective than homogeneous MapReduce placement optimization in reducing the total running cost of cloud-based MapReduce computations. This paper proposes a new approach to the heterogeneous MapReduce placement optimization problem. In this new approach, the heterogeneous MapReduce placement optimization problem is transformed into a constrained combinatorial optimization problem and is solved by an innovative constructive algorithm. Experimental results show that the running cost of the cloud-based MapReduce computation platform using this new approach is 24:3%-44:0% lower than that using the most popular homogeneous MapReduce placement approach, and 2:0%-36:2% lower than that using the heterogeneous MapReduce placement approach not considering the spare resources from the existing MapReduce computations. The experimental results have also demonstrated the good scalability of this new approach.

Breakfast at Tiffany's': eBay Inc., trade mark law, and counterfeiting

In an exploration of intellectual property and fashion, this article examines the question of the intermediary liability of online auction-houses for counterfeiting. In the United States, the illustrious jewellery store, Tiffany & Co, brought a legal action against eBay Inc, alleging direct trademark infringement, contributory trademark infringement, false advertising, unfair competition and trademark dilution. The luxury store depicted the online auction-house as a pirate bazaar, a flea-market and a haven for counterfeiting. During epic litigation, eBay Inc successfully defended itself against these allegations in a United States District Court and the United States Court of Appeals for the Second Circuit. Tiffany & Co made a desperate, unsuccessful effort to appeal the matter to the Supreme Court of the United States. The matter featured a number of interventions from amicus curiae — Tiffany was supported by Coty, the Fashion Designer's Guild, and the International Anticounterfeiting Coalition, while eBay was defended by publicly-spirited civil society groups such as Electronic Frontier Foundation, Public Citizen, and Public Knowledge as well as Yahoo!, Google Inc, Amazon.com, and associations representing telecommunications carriers and internet service providers. The litigation in the United States can be counterpointed with the fusillade of legal action against eBay in the European Union. In contrast to Tiffany & Co, Louis Vuitton triumphed over eBay in the French courts — claiming its victory as vindication of the need to protect the commercial interests and cultural heritage of France. However, eBay has fared somewhat better in a dispute with L’Oréal in Great Britain and the European Court of Justice. It is argued that, in a time of flux and uncertainty, Australia should follow the position of the United States courts in Tiffany & Co v eBay Inc. The final part examines the ramifications of this litigation over online auction-houses for trade mark law reform and consumer rights; parallel disputes over intermediary liability and safe harbours in the field of copyright law and the Anti-Counterfeiting Trade Agreement 2010. The conclusion calls for a revision of trade mark law, animated by a respect for consumers’ rights and interests in the electronic marketplace.

Balancing exploration and exploitation in particle swarm optimization on search tasking

In this study we present a combinatorial optimization method based on particle swarm optimization and local search algorithm on the multi-robot search system. Under this method, in order to create a balance between exploration and exploitation and guarantee the global convergence, at each iteration step if the distance between target and the robot become less than specific measure then a local search algorithm is performed. The local search encourages the particle to explore the local region beyond to reach the target in lesser search time. Experimental results obtained in a simulated environment show that biological and sociological inspiration could be useful to meet the challenges of robotic applications that can be described as optimization problems.

A Submission to the Inquiry into the Resale Royalty Right for Visual Artists Bill 2008 (Cth)

A right of resale, or droit de suite (a right to follow), is a legislative instrument under intellectual property law, which enables artists to receive a percentage of the sale price whenever artistic works are resold. A French legal scholar, Albert Vaunois, first articulated the need for a 'droit de suite' in connection with fine art back in 1893. The French Government introduced a scheme to protect the right of resale in 1920, after controversy over artists living in poverty, while public auction houses were profiting from the resale of their artistic creations. In the United States, there has been less support for a right of resale amongst legislatures. After lobbying from artists such as the king of pop art, Robert Rauschenberg, the state of California passed the Resale Royalties Act in 1977. At a Federal level, the United States Congress has shown some reluctance in providing national recognition for a right of resale in the United States. A number of other European countries have established a right of resale. In 2001, the European Council adopted the Artists' Resale directive and recognised that the 'artist's resale right forms an integral part of copyright and is an essential prerogative for authors.' In 2006, the United Kingdom promulgated regulations, giving effect to a right of resale in that jurisdiction. However, a number of Latin American and African countries have established a right of resale. The New Zealand Parliament has debated a bill on a right of resale.

A right of resale? Indigenous art under the hammer

This week, Sotheby's sold the late Clifford Possum Tjapaltjarri's painting, Warlugulong. The auction-house's spokesman, Tim Klingender, was enthusiastic about the high price commanded by the art work: "The painting was a really great painting and it deserved to make a really fantastic price, and it made that price."

Phagotopes derived by antibody screening of phage-displayed random peptide libraries vary in immunoreactivity: Studies using an exemplary monoclonal antibody, CII-C1, to type II collagen

Antibody screening of phage-displayed random peptide libraries to identify mimotopes of conformational epitopes is promising. However, because interpretations can be difficult, an exemplary system has been used in the present study to investigate whether variation in the peptide sequences of selected phagotopes corresponded with variation in immunoreactivity. The phagotopes, derived using a well-characterized monoclonal antibody, CII-C1, to a known conformational epitope on type II collagen, C1, were tested by direct and inhibition ELISA for reactivity with CII-C1. A multiple sequence alignment algorithm, PILEUP, was used to sort the peptides expressed by the phagotopes into clusters. A model was prepared of the C1 epitope on type II collagen. The 12 selected phagotopes reacted with CII-C1 by both direct ELISA (titres from < 100-11 200) and inhibition ELISA (20-100% inhibition); the reactivity varied according to the peptide sequence and assay format. The differences in reactivity between the phagotopes were mostly in accord with the alignment, by PILEUP, of the peptide sequences. The finding that the phagotopes functionally mimicked the C1 epitope on collagen was validated in that amino acids RRL at the amino terminal of many of the peptides were topographically demonstrable on the model of the C1 epitope. Notably, one phagotope that expressed the widely divergent peptide C-IAPKRHNSA-C also mimicked the C1 epitope, as judged by reactivity in each of the assays used: these included cross-inhibition of CII-C1 reactivity with each of the other phagotopes and inhibition by a synthetic peptide corresponding to that expressed by the most frequently selected phagotope, RRLPFGSQM. Thus, it has been demonstrated that multiple phage-displayed peptides can mimic the same epitope and that observed immunoreactivity of selected phagotopes with the selecting mAb can depend on the primary sequence of the expressed peptide and also on the assay format used.

Estimates on the coverage of parameter space using populations of models

In this paper we provide estimates for the coverage of parameter space when using Latin Hypercube Sampling, which forms the basis of building so-called populations of models. The estimates are obtained using combinatorial counting arguments to determine how many trials, k, are needed in order to obtain specified parameter space coverage for a given value of the discretisation size n. In the case of two dimensions, we show that if the ratio (Ø) of trials to discretisation size is greater than 1, then as n becomes moderately large the fractional coverage behaves as 1-exp-ø. We compare these estimates with simulation results obtained from an implementation of Latin Hypercube Sampling using MATLAB.

Architecture Optimization of Aerospace Computing Systems

Simultaneous consideration of both performance and reliability issues is important in the choice of computer architectures for real-time aerospace applications. One of the requirements for such a fault-tolerant computer system is the characteristic of graceful degradation. A shared and replicated resources computing system represents such an architecture. In this paper, a combinatorial model is used for the evaluation of the instruction execution rate of a degradable, replicated resources computing system such as a modular multiprocessor system. Next, a method is presented to evaluate the computation reliability of such a system utilizing a reliability graph model and the instruction execution rate. Finally, this computation reliability measure, which simultaneously describes both performance and reliability, is applied as a constraint in an architecture optimization model for such computing systems. Index Terms-Architecture optimization, computation