The effect of alloy composition on instabilities in the beta phase of titanium alloys

A metastable nano-scale disordered precipitate with orthorhombic symmetry has been identified using high resolution scanning transmission electron microscopy. The phase, termed O', is metastable, formed by a shuffle mechanism involving a {110}<1<(1)over bar>0> transverse phonon wave in samples of Ti-26Nb-2Zr (at.%) quenched from the beta phase. The addition of 2% Zr to Ti-26Nb appears to suppress significantly the stability of both the {11 (2) over bar}<111> shear and 2/3 <111> longitudinal phonon wave but promotes the {110}<1<(1)over bar>0> transverse shuffle. This results in the nano-size O' phase being homogeneously formed in the parent beta phase matrix rather than the massive alpha `' phase. (C) 2016 Elsevier B.V. All rights reserved.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.