Practical private database queries based on a quantum key distribution protocol

Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum key distribution protocol, with changes only in the classical post-processing of the key. This approach makes our scheme both easy to implement and loss-tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved, relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both user and database. We think that there is scope for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.Comment: 7 pages, 2 figures, new and improved version, clarified claims, expanded security discussio

On the Communication Complexity of Secure Computation

Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful information theoretic tools to prove lower bounds on the communication complexity of MPC. We restrict ourselves to a 3-party setting in order to bring out the power of these tools without introducing too many complications. Our techniques include the use of a data processing inequality for residual information - i.e., the gap between mutual information and G\'acs-K\"orner common information, a new information inequality for 3-party protocols, and the idea of distribution switching by which lower bounds computed under certain worst-case scenarios can be shown to apply for the general case. Using these techniques we obtain tight bounds on communication complexity by MPC protocols for various interesting functions. In particular, we show concrete functions that have "communication-ideal" protocols, which achieve the minimum communication simultaneously on all links in the network. Also, we obtain the first explicit example of a function that incurs a higher communication cost than the input length in the secure computation model of Feige, Kilian and Naor (1994), who had shown that such functions exist. We also show that our communication bounds imply tight lower bounds on the amount of randomness required by MPC protocols for many interesting functions.Comment: 37 page

Radiation from Accelerated Particles in Relativistic Jets with Shocks, Shear-flow, and Reconnection

We have investigated particle acceleration and shock structure associated with an unmagnetized rel-ativistic jet propagating into an unmagnetized plasma for electron-positron and electron-ion plasmas. Strong magnetic fields generated in the trailing jet shock lead to transverse deflection and acceleration of the electrons. We have self-consistently calculated the radiation from the electrons accelerated in the turbulent magnetic fields for different jet Lorentz factors. We find that the synthetic spectra depend on the bulk Lorentz factor of the jet, the jet temperature, and the strength of the magnetic fields generated in the shock. We have investigated the generation of magnetic fields associated with velocity shear between an unmagnetized relativistic (core) jet and an unmagnetized sheath plasma. We discuss particle acceleration in collimation shocks for AGN jets formed by relativistic MHD simulations. Our calculated spectra should lead to a better understanding of the complex time evolution and/or spectral structure from gamma-ray bursts, relativistic jets, and supernova remnants

Evolutionary distances in the twilight zone -- a rational kernel approach

Phylogenetic tree reconstruction is traditionally based on multiple sequence alignments (MSAs) and heavily depends on the validity of this information bottleneck. With increasing sequence divergence, the quality of MSAs decays quickly. Alignment-free methods, on the other hand, are based on abstract string comparisons and avoid potential alignment problems. However, in general they are not biologically motivated and ignore our knowledge about the evolution of sequences. Thus, it is still a major open question how to define an evolutionary distance metric between divergent sequences that makes use of indel information and known substitution models without the need for a multiple alignment. Here we propose a new evolutionary distance metric to close this gap. It uses finite-state transducers to create a biologically motivated similarity score which models substitutions and indels, and does not depend on a multiple sequence alignment. The sequence similarity score is defined in analogy to pairwise alignments and additionally has the positive semi-definite property. We describe its derivation and show in simulation studies and real-world examples that it is more accurate in reconstructing phylogenies than competing methods. The result is a new and accurate way of determining evolutionary distances in and beyond the twilight zone of sequence alignments that is suitable for large datasets.Comment: to appear in PLoS ON

Gender, sexual orientation and health behaviors in the ELSA-Brasil cohort

This study aimed to investigate differences in health behaviors as a function of gender and sexual orientation in the ELSA-Brasil cohort. Data were collected using a multidimensional questionnaire on health-related behaviors. The sample consisted of 10,314 participants, each of whom was in a stable relationship. Individuals in same-sex relationships were more likely to smoke, to spend more of their leisure-time in front of a screen and to sleep longer. When the behaviors were analyzed as a function of sexual orientation and gender, women in heterosexual relationships were less likely to smoke or to drink in excess, got more hours of sleep and spent less leisure time in front of a screen. On the other hand, they were less likely to exercise. These findings should contribute towards preventing chronic diseases and promoting health in people with different sexual orientations in Brazil and in other similar settings

An ethical framework for global vaccine allocation

In this article, we propose the Fair Priority Model for COVID-19 vaccine distribution, and emphasize three fundamental values we believe should be considered when distributing a COVID-19 vaccine among countries: Benefiting people and limiting harm, prioritizing the disadvantaged, and equal moral concern for all individuals. The Priority Model addresses these values by focusing on mitigating three types of harms caused by COVID-19: death and permanent organ damage, indirect health consequences, such as health care system strain and stress, as well as economic destruction. It proposes proceeding in three phases: the first addresses premature death, the second long-term health issues and economic harms, and the third aims to contain viral transmission fully and restore pre-pandemic activity. To those who may deem an ethical framework irrelevant because of the belief that many countries will pursue "vaccine nationalism," we argue such a framework still has broad relevance. Reasonable national partiality would permit countries to focus on vaccine distribution within their borders up until the rate of transmission is below 1, at which point there would not be sufficient vaccine-preventable harm to justify retaining a vaccine. When a government reaches the limit of national partiality, it should release vaccines for other countries. We also argue against two other recent proposals. Distributing a vaccine proportional to a country's population mistakenly assumes that equality requires treating differently situated countries identically. Prioritizing countries according to the number of front-line health care workers, the proportion of the population over 65, and the number of people with comorbidities within each country may exacerbate disadvantage and end up giving the vaccine in large part to wealthy nations

ZARAMIT: A System for the Evolutionary Study of Human Mitochondrial DNA

Abstract. ZARAMIT is an information system capable of fully auto-mated phylogeny reconstruction. Methods have been tailored to mito-chondrial DNA sequences, with focus on subproblem partitioning. We have built exhaustive human mitochondrial phylogenies (∼5500 sequences) and detected problems in existing haplogroup hierarchies through data-driven classification. Information on the project can be found on zaramit.org. 1 The case for mitochondrial DNA Mitochondria, organelles present in most eukaryotic cells, are responsible for the generation of most of the cell’s chemical energy. They are also remarkable for possessing their own, separate genome, which coexists with nuclear DNA and is inherited independently. Further, mitochondrial DNA (mtDNA) has several features which make it an ideal candidate for conducting evolutionary studies. Firstly, it is small in mammals (15000 to 17000 base pairs) and encodes a homogeneous set of gene

Factors associated with 2009 pandemic influenza A (H1N1) vaccination acceptance among university students from India during the post-pandemic phase

<p>Abstract</p> <p>Background</p> <p>There was a low adherence to influenza A (H1N1) vaccination program among university students and health care workers during the pandemic influenza in many parts of the world. Vaccination of high risk individuals is one of the recommendations of World Health Organization during the post-pandemic period. It is not documented about the student's knowledge, attitude and willingness to accept H1N1 vaccination during the post-pandemic period. We aimed to analyze the student's knowledge, attitude and willingness to accept H1N1 vaccination during the post-pandemic period in India.</p> <p>Methods</p> <p>Vaccine against H1N1 was made available to the students of Vellore Institute of Technology, India from September 2010. The data are based on a cross-sectional study conducted during October 2010 to January 2011 using a self-administered questionnaire with a representative sample of the student population (N = 802).</p> <p>Results</p> <p>Of the 802 respondents, only 102/802 (12.7%) had been vaccinated and 105/802 (13%) planned to do so in the future, while 595/802 (74%) would probably or definitely not get vaccinated in the future. The highest coverage was among the female (65/102, 63.7%) and non-compliance was higher among men in the group (384/595; 64.5%) (p < 0.0001). The representation of students from school of Bio-sciences and Bio-technology among vaccinees is significantly higher than that of other schools. Majority of the study population from the three groups perceived vaccine against H1N1 as the effective preventive measure when compared to other preventive measures. 250/595 (42%) of the responders argued of not being in the risk group. The risk perception was significantly higher among female (p < 0.0001). With in the study group, 453/802 (56.4%) said that they got the information, mostly from media.</p> <p>Conclusions</p> <p>Our study shows that the vaccination coverage among university students remains very low in the post-pandemic period and doubts about the safety and effectiveness of the vaccine are key elements in their rejection. Our results indicate a need to provide accessible information about the vaccine safety by scientific authorities and fill gaps and confusions in this regard.</p

Efficient Verifiable Computation of XOR for Biometric Authentication

This work addresses the security and privacy issues in remotebiometric authentication by proposing an efficient mechanism to verifythe correctness of the outsourced computation in such protocols.In particular, we propose an efficient verifiable computation of XORingencrypted messages using an XOR linear message authenticationcode (MAC) and we employ the proposed scheme to build a biometricauthentication protocol. The proposed authentication protocol is bothsecure and privacy-preserving against malicious (as opposed to honest-but-curious) adversaries. Specifically, the use of the verifiable computation scheme together with an homomorphic encryption protects the privacy of biometric templates against malicious adversaries. Furthermore, in order to achieve unlinkability of authentication attempts, while keeping a low communication overhead, we show how to apply Oblivious RAM and biohashing to our protocol. We also provide a proof of security for the proposed solution. Our simulation results show that the proposed authentication protocol is efficient