103 research outputs found

    Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

    Get PDF
    Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. This is a particularly hard scenario, even though it is directly applicable to protocols such as fair SMPC or multi-party contract signing. We further generalize our protocol to work for any exchange topology. We analyse the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness, and our protocols preserve the privacy of the exchanged items even against a malicious TTP. We construct an asymptotically optimal (for the complete topology) multi-party fair exchange protocol that requires a constant number of rounds, in comparison to linear, and O(n^2) messages, in comparison to cubic, where n is the number of participating parties. We enable the parties to efficiently exchange any item that can be efficiently put into a verifiable escrow (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve a fairness guarantee with very little overhead, especially if the SMPC protocol works with arithmetic circuits. Our protocol guarantees fairness in its strongest sense: even if all n−1 other participants are malicious and colluding, fairness will hold

    Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures

    Get PDF
    We investigate fairness in secure multiparty computation when the number of parties n=poly(λ)n = poly(\lambda) grows polynomially in the security parameter, λ\lambda. Prior to this work, efficient protocols achieving fairness with no honest majority and polynomial number of parties were known only for the AND and OR functionalities (Gordon and Katz, TCC\u2709). We show the following: --We first consider symmetric Boolean functions F:{0,1}n→{0,1}F : \{0,1\}^n \to \{0,1\}, where the underlying function fn/2,n/2:{0,…,n/2}×{0,…,n/2}→{0,1}f_{n/2,n/2}: \{0, \ldots, n/2\} \times \{0, \ldots, n/2\} \to \{0,1\} can be computed fairly and efficiently in the 22-party setting. We present an efficient protocol for any such FF tolerating n/2n/2 or fewer corruptions, for n=poly(λ)n = poly(\lambda) number of parties. --We present an efficient protocol for nn-party majority tolerating n/2+1n/2+1 or fewer corruptions, for n=poly(λ)n = poly(\lambda) number of parties. The construction extends to n/2+cn/2+c or fewer corruptions, for constant cc. --We extend both of the above results to more general types of adversarial structures and present instantiations of non-threshold adversarial structures of these types. These instantiations are obtained via constructions of projective planes and combinatorial designs

    Socio-cognitive determinants of consumers’ support for the fair trade movement

    Get PDF
    Despite the reasonable explanatory power of existing models of consumers’ ethical decision making, a large part of the process remains unexplained. This article draws on previous research and proposes an integrated model that includes measures of the theory of planned behavior, personal norms, self-identity, neutralization, past experience, and attitudinal ambivalence. We postulate and test a variety of direct and moderating effects in the context of a large survey with a representative sample of the U.K. population. Overall, the resulting model represents an empirically robust and holistic attempt to identify the most important determinants of consumers’ support for the fair-trade movement. Implications and avenues for further research are discussed

    Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing

    Get PDF
    Secure multiparty computation allows a set of mutually distrusting parties to securely compute a function of their private inputs, revealing only the output, even if some of the parties are corrupt. Recent years have seen an enormous amount of work that drastically improved the concrete efficiency of secure multiparty computation protocols. Many secure multiparty protocols work in an ``offline-online model. In this model, the computation is split into two main phases: a relatively slow ``offline phase , which the parties execute before they know their input, and a fast ``online phase , which the parties execute after receiving their input. One of the most popular and efficient protocols for secure multiparty computation working in this model is the SPDZ protocol (Damgaard et al., CRYPTO 2012). The SPDZ offline phase is function independent, i.e., does not requires knowledge of the computed function at the offline phase. Thus, a natural question is: can the efficiency of the SPDZ protocol be improved if the function is known at the offline phase? In this work, we answer the above question affirmatively. We show that by using a function dependent preprocessing protocol, the online communication of the SPDZ protocol can be brought down significantly, almost by a factor of 2, and the online computation is often also significantly reduced. In scenarios where communication is the bottleneck, such as strong computers on low bandwidth networks, this could potentially almost double the online throughput of the SPDZ protocol, when securely computing the same circuit many times in parallel (on different inputs). We present two versions of our protocol: Our first version uses the SPDZ offline phase protocol as a black-box, which achieves the improved online communication at the cost of slightly increasing the offline communication. Our second version works by modifying the state-of-the-art SPDZ preprocessing protocol, Overdrive (Keller et al., Eurocrypt 2018). This version improves the overall communication over the state-of-the-art SPDZ when the function is known at the offline phase

    CT Scan Screening for Lung Cancer: Risk Factors for Nodules and Malignancy in a High-Risk Urban Cohort

    Get PDF
    Low-dose computed tomography (CT) for lung cancer screening can reduce lung cancer mortality. The National Lung Screening Trial reported a 20% reduction in lung cancer mortality in high-risk smokers. However, CT scanning is extremely sensitive and detects non-calcified nodules (NCNs) in 24-50% of subjects, suggesting an unacceptably high false-positive rate. We hypothesized that by reviewing demographic, clinical and nodule characteristics, we could identify risk factors associated with the presence of nodules on screening CT, and with the probability that a NCN was malignant.We performed a longitudinal lung cancer biomarker discovery trial (NYU LCBC) that included low-dose CT-screening of high-risk individuals over 50 years of age, with more than 20 pack-year smoking histories, living in an urban setting, and with a potential for asbestos exposure. We used case-control studies to identify risk factors associated with the presence of nodules (n=625) versus no nodules (n=557), and lung cancer patients (n=30) versus benign nodules (n=128).The NYU LCBC followed 1182 study subjects prospectively over a 10-year period. We found 52% to have NCNs >4 mm on their baseline screen. Most of the nodules were stable, and 9.7% of solid and 26.2% of sub-solid nodules resolved. We diagnosed 30 lung cancers, 26 stage I. Three patients had synchronous primary lung cancers or multifocal disease. Thus, there were 33 lung cancers: 10 incident, and 23 prevalent. A sub-group of the prevalent group were stable for a prolonged period prior to diagnosis. These were all stage I at diagnosis and 12/13 were adenocarcinomas.NCNs are common among CT-screened high-risk subjects and can often be managed conservatively. Risk factors for malignancy included increasing age, size and number of nodules, reduced FEV1 and FVC, and increased pack-years smoking. A sub-group of screen-detected cancers are slow-growing and may contribute to over-diagnosis and lead-time biases

    Cholesterol and Lipoprotein Dynamics in a Hibernating Mammal

    Get PDF
    Hibernating mammals cease feeding during the winter and rely primarily on stored lipids to fuel alternating periods of torpor and arousal. How hibernators manage large fluxes of lipids and sterols over the annual hibernation cycle is poorly understood. The aim of this study was to investigate lipid and cholesterol transport and storage in ground squirrels studied in spring, summer, and several hibernation states. Cholesterol levels in total plasma, HDL and LDL particles were elevated in hibernators compared with spring or summer squirrels. Hibernation increased plasma apolipoprotein A-I expression and HDL particle size. Expression of cholesterol 7 alpha-hydroxylase was 13-fold lower in hibernators than in active season squirrels. Plasma triglycerides were reduced by fasting in spring but not summer squirrels. In hibernators plasma β-hydroxybutyrate was elevated during torpor whereas triglycerides were low relative to normothermic states. We conclude that the switch to a lipid-based metabolism during winter, coupled with reduced capacity to excrete cholesterol creates a closed system in which efficient use of lipoproteins is essential for survival

    Climate change, the Great Barrier Reef and the response of Australians

    Get PDF
    © 2016, Palgrave Macmillan Ltd. All rights reserved. Inspiration, aspirations, attitudes, and perception of threats play a pivotal role in the way that individuals associate themselves with natural environments. These sentiments affect how people connect to natural places, including their behaviours, perceived responsibility, and the management interventions they support. World Heritage Areas hold an important place in the lives of people who visit, aspire to visit, or derive a sense of security and well-being from their existence. Yet, the connection between people and special places is rarely quantified and policymakers find it difficult to incorporate these human dimensions into decision-making processes. Here we describe the personal concern and connection that Australians have with the Great Barrier Reef and discuss how the results may help with its management. We utilize a statistically representative sample of Australian residents (n = 2,002) and show empirically that climate change is perceived to be the biggest threat to the Great Barrier Reef, and that the Great Barrier Reef inspires Australians, promotes pride, and instills a sense of individual identity and collective responsibility to protect it. An increased understanding of the high levels of personal connection to iconic natural resources may help managers to enhance public support for protecting climate-sensitive systems within Australia and around the world
    • …
    corecore