Instantaneous Decentralized Poker

We present efficient protocols for amortized secure multiparty computation with penalties and secure cash distribution, of which poker is a prime example. Our protocols have an initial phase where the parties interact with a cryptocurrency network, that then enables them to interact only among themselves over the course of playing many poker games in which money changes hands. The high efficiency of our protocols is achieved by harnessing the power of stateful contracts. Compared to the limited expressive power of Bitcoin scripts, stateful contracts enable richer forms of interaction between standard secure computation and a cryptocurrency. We formalize the stateful contract model and the security notions that our protocols accomplish, and provide proofs using the simulation paradigm. Moreover, we provide a reference implementation in Ethereum/Solidity for the stateful contracts that our protocols are based on. We also adopt our off-chain cash distribution protocols to the special case of stateful duplex micropayment channels, which are of independent interest. In comparison to Bitcoin based payment channels, our duplex channel implementation is more efficient and has additional features

Privacy Enhanced Access Control for Outsourced Data Sharing

Traditional access control models often assume that the entity enforcing access control policies is also the owner of data and resources. This assumption no longer holds when data is outsourced to a third-party storage provider, such as the cloud. Existing access control solutions mainly focus on preserving confidentiality of stored data from unauthorized access and the storage provider. However, in this setting, access control policies as well as users' access patterns also become privacy sensitive information that should be protected from the cloud. We propose a two-level access control scheme that combines coarse-grained access control enforced at the cloud, which allows to get acceptable communication overhead and at the same time limits the information that the cloud learns from his partial view of the access rules and the access patterns, and fine-grained cryptographic access control enforced at the user's side, which provides the desired expressiveness of the access control policies. Our solution handles both read and write access control

Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries

We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering, distributed computation of trust and reputation, monitoring and other tasks, where the computing nodes is expected to preserve the privacy of their inputs while performing a joint computation of a certain function. Although there is a rich literature in the field of distributed systems security concerning secure multi-party computation, in practice it is hard to deploy those methods in very large scale Peer-to-Peer networks. In this work, we try to bridge the gap between theoretical algorithms in the security domain, and a practical Peer-to-Peer deployment. We consider two security models. The first is the semi-honest model where peers correctly follow the protocol, but try to reveal private information. We provide three possible schemes for secure multi-party numerical computation for this model and identify a single light-weight scheme which outperforms the others. Using extensive simulation results over real Internet topologies, we demonstrate that our scheme is scalable to very large networks, with up to millions of nodes. The second model we consider is the malicious peers model, where peers can behave arbitrarily, deliberately trying to affect the results of the computation as well as compromising the privacy of other peers. For this model we provide a fourth scheme to defend the execution of the computation against the malicious peers. The proposed scheme has a higher complexity relative to the semi-honest model. Overall, we provide the Peer-to-Peer network designer a set of tools to choose from, based on the desired level of security.Comment: Submitted to Peer-to-Peer Networking and Applications Journal (PPNA) 200

Human With No Lysine Kinase 3 (WNK3): A Target Enabling Package (TEP)

The Target Enabling Package (TEP) programme's foundation is built upon the recognition that genetic data is proving to be a powerful tool for target validation. As such, TEPs provide a critical mass of reagents and knowledge on a protein target to allow rapid biochemical and chemical exploration and characterisation of proteins with genetic linkage to key disease areas. TEPs provide an answer to the missing link between genomics and chemical biology, provide a starting point for chemical probe generation and therefore catalyse new biology and disease understanding with the ultimate aim of enabling translation collaborations and target/ drug discovery. We are committed to generating and making available 24 high-quality TEPs by June 2020.SUMMARY OF PROJECT Kinases WNK1-4 regulate cation-chloride cotransporters via phosphorylation of SPAK and OSR1 and thereby control salt homeostasis, cell volume and blood pressure. Gain of function mutations in WNK kinases are found in Gordon’s hypertension syndrome suggesting the WNK pathway as a therapeutic target. WNK3 inhibition in particular has also been shown to reduce cerebral injury after Ischemic stroke. Here we present assays and crystal structures that define (i) the molecular basis for disease mutations; (ii) the multiple functional domains of WNK kinases and their protein interactions; (iii) the binding of small molecule kinase inhibitors and a potential allosteric pocket.The work performed at the SGC has been funded by a grant from the Wellcome [106169/ZZ14/Z]

Two-Sided Malicious Security for Private Intersection-Sum with Cardinality

Private intersection-sum with cardinality allows two parties, where each party holds a private set and one of the parties additionally holds a private integer value associated with each element in her set, to jointly compute the cardinality of the intersection of the two sets as well as the sum of the associated integer values for all the elements in the intersection, and nothing beyond that. We present a new construction for private intersection sum with cardinality that provides malicious security with abort and guarantees that both parties receive the output upon successful completion of the protocol. A central building block for our constructions is a primitive called shuffled distributed oblivious PRF (DOPRF), which is a PRF that offers oblivious evaluation using a secret key shared between two parties, and in addition to this allows obliviously permuting the PRF outputs of several parallel oblivious evaluations. We present the first construction for shuffled DOPRF with malicious security. We further present several new sigma proof protocols for relations across Pedersen commitments, ElGamal encryptions, and Camenisch-Shoup encryptions that we use in our main construction, for which we develop new batching techniques to reduce communication. We implement and evaluate the efficiency of our protocol and show that we can achieve communication cost that is only 4-5 times greater than the most efficient semi-honest protocol. When measuring monetary cost of executing the protocol in the cloud, our protocol is 25 times more expensive than the semi-honest protocol. Our construction also allows for different parameter regimes that enable trade-offs between communication and computation

The reductive activation of CO2 across a Ti═Ti double bond: synthetic, structural, and mechanistic studies

[Image: see text] The reactivity of the bis(pentalene)dititanium double-sandwich compound Ti(2)Pn(†)(2) (1) (Pn(†) = 1,4-{Si(i)Pr(3)}(2)C(8)H(4)) with CO(2) is investigated in detail using spectroscopic, X-ray crystallographic, and computational studies. When the CO(2) reaction is performed at −78 °C, the 1:1 adduct 4 is formed, and low-temperature spectroscopic measurements are consistent with a CO(2) molecule bound symmetrically to the two Ti centers in a μ:η(2),η(2) binding mode, a structure also indicated by theory. Upon warming to room temperature the coordinated CO(2) is quantitatively reduced over a period of minutes to give the bis(oxo)-bridged dimer 2 and the dicarbonyl complex 3. In situ NMR studies indicated that this decomposition proceeds in a stepwise process via monooxo (5) and monocarbonyl (7) double-sandwich complexes, which have been independently synthesized and structurally characterized. 5 is thermally unstable with respect to a μ-O dimer in which the Ti–Ti bond has been cleaved and one pentalene ligand binds in an η(8) fashion to each of the formally Ti(III) centers. The molecular structure of 7 shows a “side-on” bound carbonyl ligand. Bonding of the double-sandwich species Ti(2)Pn(2) (Pn = C(8)H(6)) to other fragments has been investigated by density functional theory calculations and fragment analysis, providing insight into the CO(2) reaction pathway consistent with the experimentally observed intermediates. A key step in the proposed mechanism is disproportionation of a mono(oxo) di-Ti(III) species to yield di-Ti(II) and di-Ti(IV) products. 1 forms a structurally characterized, thermally stable CS(2) adduct 8 that shows symmetrical binding to the Ti(2) unit and supports the formulation of 4. The reaction of 1 with COS forms a thermally unstable complex 9 that undergoes scission to give mono(μ-S) mono(CO) species 10. Ph(3)PS is an effective sulfur transfer agent for 1, enabling the synthesis of mono(μ-S) complex 11 with a double-sandwich structure and bis(μ-S) dimer 12 in which the Ti–Ti bond has been cleaved

Feeding spectra and activity of the freshwater crab Trichodactylus kensleyi (Decapoda: Brachyura: Trichodactylidae) at La Plata basin

Background: In inland water systems, it is important to characterize the trophic links in order to identify the ‘trophic species’ and, from the studies of functional diversity, understand the dynamics of matter and energy in these environments. The aim of this study is to analyze the natural diet of Trichodactylus kensleyi of subtropical rainforest streams and corroborate the temporal variation in the trophic activity during day hours. Results: A total of 15 major taxonomic groups were recognized in gut contents. The index of relative importance identified the following main prey items in decreasing order of importance: vegetal remains, oligochaetes, chironomid larvae, and algae. A significant difference was found in the amount of full stomachs during day hours showing a less trophic activity at midday and afternoon. The index of relative importance values evidenced the consumption of different prey according to day moments. Results of the gut content indicate that T. kensleyi is an omnivorous crab like other trichodactylid species. Opportunistic behavior is revealed by the ingestion of organisms abundant in streams such as oligochaetes and chironomid larvae. The consumption of allochthonous plant debris shows the importance of this crab as shredder in subtropical streams. However, the effective assimilation of plant matter is yet unknown in trichodactylid crabs. Conclusions: This research provides knowledge that complements previous studies about trophic relationships of trichodactylid crabs and supported the importance of T. kensleyi in the transference of energy and matter from benthic community and riparian sources to superior trophic levels using both macro- and microfauna.Fil: Williner, Verónica. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; Argentina. Universidad Nacional del Litoral. Facultad de Humanidades y Ciencias; ArgentinaFil: de Azevedo Carvalho, Debora. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; ArgentinaFil: Collins, Pablo Agustin. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; Argentina. Universidad Nacional del Litoral. Facultad de Bioquímica y Ciencias Biológicas; Argentin

Neuregulin Promotes Incomplete Autophagy of Prostate Cancer Cells That Is Independent of mTOR Pathway Inhibition

Growth factors activating the ErbB receptors have been described in prostate tumors. The androgen dependent prostate cancer cell line, LNCaP, expresses the ErbB-1, ErbB-2 and ErbB-3 receptor tyrosine kinases. Previously, it was demonstrated that NRG activates ErbB-2/ErbB-3 heterodimers to induce LNCaP cell death, whereas, EGF activates ErbB-1/ErbB-1 or ErbB-1/ErbB-2 dimers to induce cell growth and survival. It was also demonstrated that PI3K inhibitors repressed this cell death suggesting that in androgen deprived LNCaP cells, NRG activates a PI3K-dependent pathway associated with cell death.In the present study we demonstrate that NRG induces autophagy in LNCaP cells, using LC3 as a marker. However, the autophagy induced by NRG may be incomplete since p62 levels elevate. We also demonstrated that NRG- induced autophagy is independent of mammalian target of rapamycin (mTOR) inhibition since NRG induces Akt and S6K activation. Interestingly, inhibition of reactive oxygen species (ROS) by N-acetylcysteine (NAC), inhibited NRG-induced autophagy and cell death. Our study also identified JNK and Beclin 1 as important components in NRG-induced autophagy and cell death. NRG induced elevation in JNK phosphorylation that was inhibited by NAC. Moreover, inhibitor of JNK inhibited NRG-induced autophagy and cell death. Also, in cells overexpressing Bcl-2 or cells expressing sh-RNA against Beclin 1, the effects of NRG, namely induction of autophagy and cell death, were inhibited.Thus, in LNCaP cells, NRG-induces incomplete autophagy and cell death that depend on ROS levels. These effects of NRG are mediated by signaling pathway that activates JNK and Beclin 1, but is independent of mTOR inhibition

Combining Private Set-Intersection with Secure Two-Party Computation

Private Set-Intersection (PSI) is one of the most popular and practically relevant secure two-party computation (2PC) tasks. Therefore, designing special-purpose PSI protocols (which are more efficient than generic 2PC solutions) is a very active line of research. In particular, a recent line of work has proposed PSI protocols based on oblivious transfer (OT) which, thanks to recent advances in OT-extension techniques, is nowadays a very cheap cryptographic building block. Unfortunately, these protocols cannot be plugged into larger 2PC applications since in these protocols one party (by design) learns the output of the intersection. Therefore, it is not possible to perform secure post-processing of the output of the PSI protocol. In this paper we propose a novel and efficient OT-based PSI protocol that produces an encrypted output that can therefore be later used as an input to other 2PC protocols. In particular, the protocol can be used in combination with all common approaches to 2PC including garbled circuits, secret sharing and homomorphic encryption. Thus, our protocol can be combined with the right 2PC techniques to achieve more efficient protocols for computations of the form $z=f(X\cap Y)$ for arbitrary functions $f$