Ideal threshold schemes from orthogonal arrays

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.

Lattice-based threshold-changeability for standard CRT secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.

Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

New constructions of anonymous membership broadcasting schemes

An anonymous membership broadcast scheme is a method in which a sender broadcasts the secret identity of one out of a set of n receivers, in such a way that only the right receiver knows that he is the intended receiver, while the others can not determine any information about this identity (except that they know that they are not the intended ones). In a w-anonymous membership broadcast scheme no coalition of up to w receivers, not containing the selected receiver, is able to determine any information about the identity of the selected receiver. We present two new constructions of w-anonymous membership broadcast schemes. The first construction is based on error-correcting codes and we show that there exist schemes that allow a flexible choice of w while keeping the complexities for broadcast communication, user storage and required randomness polynomial in log n,. The second construction is based on the concept of collision-free arrays, which is introduced in this paper. The construction results in more flexible schemes, allowing trade-offs between different complexities.

Augmenting and assisting model elicitation tasks with 3D virtual world context metadata

Accurate process model elicitation continues to be a time consuming task, requiring skill on the part of the interviewer to extract explicit and tacit process information from the interviewee. Many errors occur in this elicitation stage that would be avoided by better activity recall, more consistent specification methods and greater engagement in the elicitation process by interviewees. Theories of situated cognition indicate that interactive 3D representations of real work environments engage and prime the cognitive state of the viewer. In this paper, our major contribution is to augment a previous process elicitation methodology with virtual world context metadata, drawn from a 3D simulation of the workplace. We present a conceptual and formal approach for representing this contextual metadata, integrated into a process similarity measure that provides hints for the business analyst to use in later modelling steps. Finally, we conclude with examples from two use cases to illustrate the potential abilities of this approach.

Energy storage systems in distributed generation schemes

An overview is given of the various energy storage technologies which can be used in distributed generation (DG) schemes. Description of the recent photovoltaic DG initiative in Singapore is included, in which several of the storage systems can find ready applications. Schemes pertaining to the use of solid oxide fuel cell for power quality enhancement and battery energy storage system used in conjunction with wind power generation are also described.

New sale and leasing requirements for owners of swimming pools and their application to strata schemes

This article considers the changes to the Swimming Pools Act 1992 (NSW)(Act) which established a State-wide online register of all private swimming pools in NSW requiring pool owners to register their pools by 19 November 2013. Amendments to the Act introduced changes to the conveyancing and residential tenancy regulations to require vendors and landlords to have a valid Compliance Certificate issued for their swimming pool before offering the property for sale or lease. This article provides a brief overview of the new sale and leasing requirements effective from 29 April 2014, focusing on its application to lot owners within strata and community title schemes and other owners of water front properties with pools on Crown Land Reserves.

Kumarina and bidders voting in transfer schemes

Transfer schemes are an alternative means of acquiring control of a company to making a takeover bid under the provisions in Ch 6 of the Corporations Act 2001 (Cth). The recent decision Re Kumarina Resources Ltd [2013] FCA 549 overturned long-standing practice in relation to a certain type of transfer scheme. If followed, the decision would allow a “bidder” to vote at scheme meetings where the scheme consideration for the acquisition of the target shares are shares in another company, and the scheme results in a merger. But the bidder is not allowed to vote where the scheme consideration is cash. The article points out the difficulties arising from this decision and argues that it should not be followed. In providing a “no objection” statement, the Australian Securities and Investments Commission (ASIC) has created uncertainty as to the approach it will take towards the bidders being allowed to vote at scheme meetings where the scheme consideration for the acquisition of target shares are shares in another company. The article also points out that in providing the no objection statement in Kumarina, ASIC appears to have ignored breaches of s 606(1) of the Corporations Act. There is a pressing need for ASIC to clarify its position and, in particular, whether or not it will provide a no objection statement in respect of future transfer schemes where a bidder (or its parent company) votes at the scheme meeting.

Dual compressible hybrid quantum secret sharing schemes based on extended unitary operations

A crucial issue with hybrid quantum secret sharing schemes is the amount of data that is allocated to the participants. The smaller the amount of allocated data, the better the performance of a scheme. Moreover, quantum data is very hard and expensive to deal with, therefore, it is desirable to use as little quantum data as possible. To achieve this goal, we first construct extended unitary operations by the tensor product of n, n ≥ 2, basic unitary operations, and then by using those extended operations, we design two quantum secret sharing schemes. The resulting dual compressible hybrid quantum secret sharing schemes, in which classical data play a complementary role to quantum data, range from threshold to access structure. Compared with the existing hybrid quantum secret sharing schemes, our proposed schemes not only reduce the number of quantum participants, but also the number of particles and the size of classical shares. To be exact, the number of particles that are used to carry quantum data is reduced to 1 while the size of classical secret shares also is also reduced to l−2 m−1 based on ((m+1, n′)) threshold and to l−2 r2 (where r2 is the number of maximal unqualified sets) based on adversary structure. Consequently, our proposed schemes can greatly reduce the cost and difficulty of generating and storing EPR pairs and lower the risk of transmitting encoded particles.

High order unconditionally stable difference schemes for the Riesz space-fractional telegraph equation

In this paper, a class of unconditionally stable difference schemes based on the Pad´e approximation is presented for the Riesz space-fractional telegraph equation. Firstly, we introduce a new variable to transform the original dfferential equation to an equivalent differential equation system. Then, we apply a second order fractional central difference scheme to discretise the Riesz space-fractional operator. Finally, we use (1, 1), (2, 2) and (3, 3) Pad´e approximations to give a fully discrete difference scheme for the resulting linear system of ordinary differential equations. Matrix analysis is used to show the unconditional stability of the proposed algorithms. Two examples with known exact solutions are chosen to assess the proposed difference schemes. Numerical results demonstrate that these schemes provide accurate and efficient methods for solving a space-fractional hyperbolic equation.

A low-cost attack on branch-based software watermarking schemes

In 2005, Ginger Myles and Hongxia Jin proposed a software watermarking scheme based on converting jump instructions or unconditional branch statements (UBSs) by calls to a fingerprint branch function (FBF) that computes the correct target address of the UBS as a function of the generated fingerprint and integrity check. If the program is tampered with, the fingerprint and integrity checks change and the target address will not be computed correctly. In this paper, we present an attack based on tracking stack pointer modifications to break the scheme and provide implementation details. The key element of the attack is to remove the fingerprint and integrity check generating code from the program after disassociating the target address from the fingerprint and integrity value. Using the debugging tools that give vast control to the attacker to track stack pointer operations, we perform both subtractive and watermark replacement attacks. The major steps in the attack are automated resulting in a fast and low-cost attack.

The responsibility of intermediaries: Emerging IP protection schemes, from Content ID, to three-strikes and follow-the-money

The only effective and scalable way to regulate the actions of people on the internet is through online intermediaries. These are the institutions that facilitate communication: internet service providers, search engines, content hosts, and social networks. Governments, private firms, and civil society organisations are increasingly seeking to influence these intermediaries to take more responsibility to prevent or respond to IP infringements. Around the world, intermediaries are increasingly subject to a variety of obligations to help enforce IP rights, ranging from informal social and governmental pressure, to industry codes and private negotiated agreements, to formal legislative schemes. This paper provides an overview of this emerging shift in regulatory approaches, away from legal liability and towards increased responsibilities for intermediaries. This shift straddles two different potential futures: an optimistic set of more effective, more efficient mechanisms for regulating user behaviour, and a dystopian vision of rule by algorithm and private power, without the legitimising influence of the rule of law.

A review of benchmarking in carbon labelling schemes for building materials

As one of the largest sources of greenhouse gas (GHG) emissions, the building and construction sector is facing increasing pressure to reduce its life cycle GHG emissions. One central issue in striving towards reduced carbon emissions in the building and construction sector is to develop a practical and meaningful yardstick to assess and communicate GHG results through carbon labelling. The idea of carbon labelling schemes for building materials is to trigger a transition to a low carbon future by switching consumer-purchasing habits to low-carbon alternatives. As such, failing to change purchasing pattern and behaviour can be disastrous to carbon labelling schemes. One useful tool to assist customers to change their purchasing behaviour is benchmarking, which has been very commonly used in ecolabelling schemes. This paper analyses the definition and scope of benchmarking in the carbon labelling schemes for building materials. The benchmarking process has been examined within the context of carbon labelling. Four practical issues for the successful implementation of benchmarking, including the availability of benchmarks and databases, the usefulness of different types of benchmarks and the selection of labelling practices have also been clarified.

Analysis of one-pass block cipher based authenticated encryption schemes

This project analyses and evaluates the integrity assurance mechanisms used in four Authenticated Encryption schemes based on symmetric block ciphers. These schemes are all cross chaining block cipher modes that claim to provide both confidentiality and integrity assurance simultaneously, in one pass over the data. The investigations include assessing the validity of an existing forgery attack on certain schemes, applying the attack approach to other schemes and implementing the attacks to verify claimed probabilities of successful forgeries. For these schemes, the theoretical basis of the attack was developed, the attack algorithm implemented and computer simulations performed for experimental verification.

Problems with geoengineering schemes to combat climate change

The accelerated rate of increase in atmospheric CO2 concentration in recent years has revived the idea of stabilizing the global climate through geoengineering schemes. Majority of the proposed geoengineering schemes will attempt to reduce the amount of solar radiation absorbed by our planet. Climate modelling studies of these so called 'sunshade geoengineering schemes' show that global warming from increasing concentrations of CO2 can be mitigated by intentionally manipulating the amount of sunlight absorbed by the climate system. These studies also suggest that the residual changes could be large on regional scales, so that climate change may not be mitigated on a local basis. More recent modelling studies have shown that these schemes could lead to a slow-down in the global hydrological cycle. Other problems such as changes in the terrestrial carbon cycle and ocean acidification remain unsolved by sunshade geoengineering schemes. In this article, I review the proposed geoengineering schemes, results from climate models and discuss why geoengineering is not the best option to deal with climate change.