Multiple emissive triarylborane-A(2)H(2) and triarylborane-Zn-A(2)H(2) porphyrin conjugates

Triarylborane-A(2)H(2) (1) and triarylborane-Zn-A(2)H(2) porphyrins (2) have been synthesized by acid catalyzed condensation of 4-dimesitylboryl-benzaldehyde and dipyrromethane under ambient conditions. Compounds 1 and 2 showed multiple emission bands upon excitation at the triarylborane dominated absorption region (350 nm). Detailed experimental and computational studies show that the multiple emission features of 1 and 2 arise as a result of a partial energy transfer from the donor (triarylborane) to the acceptor (porphyrin) moieties. Compounds 1 and 2 showed very high selectivities towards fluoride ions compared to other competing anions.

Multiple oligomeric structures of a bacterial small heat shock protein

Small heat shock proteins are ubiquitous molecular chaperones that form the first line of defence against the detrimental effects of cellular stress. Under conditions of stress they undergo drastic conformational rearrangements in order to bind to misfolded substrate proteins and prevent cellular protein aggregation. Owing to the dynamic nature of small heat shock protein oligomers, elucidating the structural basis of chaperone action and oligomerization still remains a challenge. In order to understand the organization of sHSP oligomers, we have determined crystal structures of a small heat shock protein from Salmonella typhimurium in a dimeric form and two higher oligomeric forms: an 18-mer and a 24-mer. Though the core dimer structure is conserved in all the forms, structural heterogeneity arises due to variation in the terminal regions.

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.