Improving the ability of guarantors to make a real choice : lenders' practices in taking third party guarantees

This article considers recent cases on guarantees of business loans to identify the lending practices that led the court to set aside the guarantee as against the creditor on the basis that the creditor had engaged in unconscionable conduct. It also explores the role of industry codes of practice in preventing unconscionable conduct, including whether there is a correlation between commitment to an industry code and higher standards of lending practices; whether compliance with an industry code would have produced different outcomes in the cases considered; and whether lenders need to do more than comply with an industry code to ensure their practices are fair and reasonable.

Monitoring style drift : evidence from U.S. Equity funds

This thesis examines the stewardship and investment style monitoring by managers and boards of U.S. equity funds. Results indicate that complying with a fund’s declared style, especially in value-growth dimension, remains a challenge for fund managers and boards, and that style-based investors should be aware of the risk of style drift since fund managers and boards do not always monitor the fund’s investment style as stated in the prospectus. Results also show that the quality of fund stewardship, as reflected by fund board quality, corporate culture, manager compensation, regulatory history, and fees are effective in ensuring that fund managers and boards perform their fiduciary obligation by increasing monitoring of the fund investment style.

Geologic map of the Valley Mountain 15’ quadrangle, San Bernardino and Riverside Counties, California: U.S. Geological Survey Geologic Quadrangle Map GQ–1767, scale 1:62,500

The Valley Mountain 15’ quadrangle straddles the Pinto Mountain Fault, which bounds the eastern Transverse Ranges in the south against the Mojave Desert province in the north. The Pinto Mountains, part of the eastern Transverse Ranges in the south part of the quadrangle expose a series of Paleoproterozoic gneisses and granite and the Proterozoic quartzite of Pinto Mountain. Early Triassic quartz monzonite intruded the gneisses and was ductiley deformed prior to voluminous Jurassic intrusion of diorite, granodiorite, quartz monzonite, and granite plutons. The Jurassic rocks include part of the Bullion Mountains Intrusive Suite, which crops out prominently at Valley Mountain and in the Bullion Mountains, as well as in the Pinto Mountains. Jurassic plutons in the southwest part of the quadrangle are deeply denuded from midcrustal emplacement levels in contrast to supracrustal Jurassic limestone and volcanic rocks exposed in the northeast. Dikes inferred to be part of the Jurassic Independence Dike Swarm intrude the Jurassic plutons and Proterozoic rocks. Late Cretaceous intrusion of the Cadiz Valley Batholith in the northeast caused contact metamorphism of adjacent Jurassic plutonic rocks...

Affective events theory as a framework for understanding third-party consumer complaints

Poor complaint management may result in organizations losing customers and revenue. Consumers exhibit negative emotional responses when dissatisfied and this may lead to a complaint to a third-party organization. Since little information is available on the role of emotion in the consumer complaint process or how to manage complaints effectively, we offer an emotions perspective by applying Affective Events Theory (AET) to complaint behavior. This study presents the first application of AET in a consumption context and advances a theoretical framework supported by qualitative research for emotional responses to complaints. In contrast to commonly held views on gender and emotion, men as well as women use emotion-focused coping to complain.

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.

Mid-Holocene sea-level and coral reef demise : U-Th dating of subfossil corals in Moreton Bay, Australia

It is increasingly apparent that sea-level data (e.g. microfossil transfer functions, dated coral microatolls and direct observations from satellite and tidal gauges) vary temporally and spatially at regional to local scales, thus limiting our ability to model future sea-level rise for many regions. Understanding sealevel response at ‘far-field’ locations at regional scales is fundamental for formulating more relevant sea-level rise susceptibility models within these regions under future global change projections. Fossil corals and reefs in particular are valuable tools for reconstructing past sea levels and possible environmental phase shifts beyond the temporal constraints of instrumental records. This study used abundant surface geochronological data based on in situ subfossil corals and precise elevation surveys to determine previous sea level in Moreton Bay, eastern Australia, a far-field site. A total of 64 U-Th dates show that relative sea level was at least 1.1 m above modern lowest astronomical tide (LAT) from at least ˜6600 cal. yr BP. Furthermore, a rapid synchronous demise in coral reef growth occurred in Moreton Bay ˜5800 cal. yr BP, coinciding with reported reef hiatus periods in other areas around the Indo-Pacific region. Evaluating past reef growth patterns and phases allows for a better interpretation of anthropogenic forcing versus natural environmental/climatic cycles that effect reef formation and demise at all scales and may allow better prediction of reef response to future global change.

Security analysis of Australian and E.U. e-passport implementation

This paper makes a formal security analysis of the current Australian e-passport implementation using model checking tools CASPER/CSP/FDR. We highlight security issues in the current implementation and identify new threats when an e-passport system is integrated with an automated processing system like SmartGate. The paper also provides a security analysis of the European Union (EU) proposal for Extended Access Control (EAC) that is intended to provide improved security in protecting biometric information of the e-passport bearer. The current e-passport specification fails to provide a list of adequate security goals that could be used for security evaluation. We fill this gap; we present a collection of security goals for evaluation of e-passport protocols. Our analysis confirms existing security weaknesses that were previously identified and shows that both the Australian e-passport implementation and the EU proposal fail to address many security and privacy aspects that are paramount in implementing a secure border control mechanism. ACM Classification C.2.2 (Communication/Networking and Information Technology – Network Protocols – Model Checking), D.2.4 (Software Engineering – Software/Program Verification – Formal Methods), D.4.6 (Operating Systems – Security and Privacy Protection – Authentication)

Multi-party computation with omnipresent adversary

Secure multi-party computation (MPC) protocols enable a set of n mutually distrusting participants P 1, ..., P n , each with their own private input x i , to compute a function Y = F(x 1, ..., x n ), such that at the end of the protocol, all participants learn the correct value of Y, while secrecy of the private inputs is maintained. Classical results in the unconditionally secure MPC indicate that in the presence of an active adversary, every function can be computed if and only if the number of corrupted participants, t a , is smaller than n/3. Relaxing the requirement of perfect secrecy and utilizing broadcast channels, one can improve this bound to t a  < n/2. All existing MPC protocols assume that uncorrupted participants are truly honest, i.e., they are not even curious in learning other participant secret inputs. Based on this assumption, some MPC protocols are designed in such a way that after elimination of all misbehaving participants, the remaining ones learn all information in the system. This is not consistent with maintaining privacy of the participant inputs. Furthermore, an improvement of the classical results given by Fitzi, Hirt, and Maurer indicates that in addition to t a actively corrupted participants, the adversary may simultaneously corrupt some participants passively. This is in contrast to the assumption that participants who are not corrupted by an active adversary are truly honest. This paper examines the privacy of MPC protocols, and introduces the notion of an omnipresent adversary, which cannot be eliminated from the protocol. The omnipresent adversary can be either a passive, an active or a mixed one. We assume that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold. We will also show that the existence of a t-resilient protocol for a group of n participants, implies the existence of a t’-private protocol for a group of n′ participants. That is, the elimination of misbehaving participants from a t-resilient protocol leads to the decomposition of the protocol. Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario). Therefore, privacy of all participants who properly follow the protocol will be maintained. We present a novel disqualification protocol to avoid a loss of privacy of participants who properly follow the protocol.

Tactics of antifeminist backlash against the U. S. battered women's movement

Opposition to men’s violence against women who are their intimate partners has become politically popular in the United States. The Violence Against Women Act (VAWA) has enjoyed broad-based support for over 15 years. VAWA has been refined and expanded with each reauthorization. Resistance to the battered women’s movement is often overlooked in this political context. However, woman abuse and state responses to it are mired in cultural tensions about crime, law, gender, economics, scholarship, and the family. Based on interviews with 35 advocates in the United States, this paper outlines key tactics of antifeminist backlash against the battered women’s movement.

Assessment of costs : challenge to validity of client agreement between party entitled to costs and its solicitors

In ASIC v Atlantic 3 Financial (Aust) Pty Ltd [2006] QCA 540 the Queensland Court of Appeal dismissed an appeal from the decision of Mullins J at first instance in ASIC v Atlantic 3 Financial (Aust) Pty LTd [2006] QSC 152, the majority concluding that the client agreement in issue was not inconsistent with s48 of the Queensland Law Society Act 1952.

Stabilization of parametric roll resonance with active u-tanks via Lyapunov control design

Parametric ship roll resonance is a phenomenon where a ship can rapidly develop high roll motion while sailing in longitudinal waves. This effect can be described mathematically by periodic changes of the parameters of the equations of motion, which lead to a bifurcation. In this paper, the control design of an active u-tank stabilizer is carried out using Lyapunov theory. A nonlinear backstepping controller is developed to provide global exponential stability of roll. An extension of commonly used u-tank models is presented to account for large roll angles, and the control design is tested via simulation on a high-fidelity model of a vessel under parametric roll resonance.

Party to litigation insolvent company - costs order against non-party liquidator

In Kimtran Pty Ltd v Downie [2003] QDC 043 the court allowed in part an appeal from the refusal by the Queensland Building Tribunal to order the respondent liquidators pay the appellants' costs of proceedings in the Tribunal. The decision involved an examination of authorities which have considered the circumstances in which it is in the interests of justice to make an order for costs against a non-party.

Should the court direct that costs ordered to be recovered on the indemnity basis be assessed by reference to a costs agreement between the successful party and their solicitors?

The decision in Hook v Boreham & QBE Insurance (Australia) Limited [2006] QDC 304 considered whether the court should go further than order that costs be assessed on the indemnity basis, but should also specify the basis by which those indemnity costs should be determined. The decision makes it clear that under r704(3) of the Uniform Civil Procedure Rules, questions of that nature are ordinarily preserved to the discretion of the Registrar.

Malleability attacks on multi-party key agreement protocols

Multi-party key agreement protocols indirectly assume that each principal equally contributes to the final form of the key. In this paper we consider three malleability attacks on multi-party key agreement protocols. The first attack, called strong key control allows a dishonest principal (or a group of principals) to fix the key to a pre-set value. The second attack is weak key control in which the key is still random, but the set from which the key is drawn is much smaller than expected. The third attack is named selective key control in which a dishonest principal (or a group of dishonest principals) is able to remove a contribution of honest principals to the group key. The paper discusses the above three attacks on several key agreement protocols, including DH (Diffie-Hellman), BD (Burmester-Desmedt) and JV (Just-Vaudenay). We show that dishonest principals in all three protocols can weakly control the key, and the only protocol which does not allow for strong key control is the DH protocol. The BD and JV protocols permit to modify the group key by any pair of neighboring principals. This modification remains undetected by honest principals.

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.