Ideal hierarchical secret sharing schemes

Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme. We solve this problem by providing a natural definition for the family of the hierarchical access structures and, more importantly, by presenting a complete characterization of the ideal hierarchical access structures, that is, the ones admitting an ideal secret sharing scheme. Our characterization deals with the properties of the hierarchically minimal sets of the access structure, which are the minimal qualified sets whose participants are in the lowest possible levels in the hierarchy. By using our characterization, it can be efficiently checked whether any given hierarchical access structure that is defined by its hierarchically minimal sets is ideal. We use the well known connection between ideal secret sharing and matroids and, in particular, the fact that every ideal access structure is a matroid port. In addition, we use recent results on ideal multipartite access structures and the connection between multipartite matroids and integer polymatroids. We prove that every ideal hierarchical access structure is the port of a representable matroid and, more specifically, we prove that every ideal structure in this family admits ideal linear secret sharing schemes over fields of all characteristics. In addition, methods to construct such ideal schemes can be derived from the results in this paper and the aforementioned ones on ideal multipartite secret sharing. Finally, we use our results to find a new proof for the characterization of the ideal weighted threshold access structures that is simpler than the existing one.Peer ReviewedPostprint (author's final draft

Optimal non-perfect uniform secret sharing schemes

A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this end, we extend the known connections between polymatroids and perfect secret sharing schemes to the non-perfect case. In order to study non-perfect secret sharing schemes in all generality, we describe their structure through their access function, a real function that measures the amount of information that every subset of participants obtains about the secret value. We prove that there exists a secret sharing scheme for every access function. Uniform access functions, that is, the ones whose values depend only on the number of participants, generalize the threshold access structures. Our main result is to determine the optimal information ratio of the uniform access functions. Moreover, we present a construction of linear secret sharing schemes with optimal information ratio for the rational uniform access functions.Peer ReviewedPostprint (author's final draft

Worldwide data sets constrain the water vapor uptake coefficient in cloud formation

Cloud droplet formation depends on the condensation of water vapor on ambient aerosols, the rate of which is strongly affected by the kinetics of water uptake as expressed by the condensation (or mass accommodation) coefficient, α_c. Estimates of α_c for droplet growth from activation of ambient particles vary considerably and represent a critical source of uncertainty in estimates of global cloud droplet distributions and the aerosol indirect forcing of climate. We present an analysis of 10 globally relevant data sets of cloud condensation nuclei to constrain the value of αc for ambient aerosol. We find that rapid activation kinetics (α_c > 0.1) is uniformly prevalent. This finding resolves a long-standing issue in cloud physics, as the uncertainty in water vapor accommodation on droplets is considerably less than previously thought

On the optimization of bipartite secret sharing schemes

Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants in each part play an equivalent role. We focus on the search of lower bounds by using a special class of polymatroids that is introduced here, the bipartite ones. We present a method based on linear programming to compute, for every given bipartite access structure, the best lower bound that can be obtained by this combinatorial method. In addition, we obtain some general lower bounds that improve the previously known ones, and we construct optimal secret sharing schemes for a family of bipartite access structures.Postprint (author’s final draft

TweetLID : a benchmark for tweet language identification

Language identification, as the task of determining the language a given text is written in, has progressed substantially in recent decades. However, three main issues remain still unresolved: (1) distinction of similar languages, (2) detection of multilingualism in a single document, and (3) identifying the language of short texts. In this paper, we describe our work on the development of a benchmark to encourage further research in these three directions, set forth an evaluation framework suitable for the task, and make a dataset of annotated tweets publicly available for research purposes. We also describe the shared task we organized to validate and assess the evaluation framework and dataset with systems submitted by seven different participants, and analyze the performance of these systems. The evaluation of the results submitted by the participants of the shared task helped us shed some light on the shortcomings of state-of-the-art language identification systems, and gives insight into the extent to which the brevity, multilingualism, and language similarity found in texts exacerbate the performance of language identifiers. Our dataset with nearly 35,000 tweets and the evaluation framework provide researchers and practitioners with suitable resources to further study the aforementioned issues on language identification within a common setting that enables to compare results with one another

On the link between ocean biota emissions, aerosol, and maritime clouds: Airborne, ground, and satellite measurements off the coast of California

Surface, airborne, and satellite measurements over the eastern Pacific Ocean off the coast of California during the period between 2005 and 2007 are used to explore the relationship between ocean chlorophyll a, aerosol, and marine clouds. Periods of enhanced chlorophyll a and wind speed are coincident with increases in particulate diethylamine and methanesulfonate concentrations. The measurements indicate that amines are a source of secondary organic aerosol in the marine atmosphere. Subsaturated aerosol hygroscopic growth measurements indicate that the organic component during periods of high chlorophyll a and wind speed exhibit considerable water uptake ability. Increased average cloud condensation nucleus (CCN) activity during periods of increased chlorophyll a levels likely results from both size distribution and aerosol composition changes. The available data over the period of measurements indicate that the cloud microphysical response, as represented by either cloud droplet number concentration or cloud droplet effective radius, is likely influenced by a combination of atmospheric dynamics and aerosol perturbations during periods of high chlorophyll a concentrations

LDL-Induced Impairment of Human Vascular Smooth Muscle Cells Repair Function Is Reversed by HMG-CoA Reductase Inhibition

Growing human atherosclerotic plaques show a progressive loss of vascular smooth muscle cells (VSMC) becoming soft and vulnerable. Lipid loaded-VSMC show impaired vascular repair function and motility due to changes in cytoskeleton proteins involved in cell-migration. Clinical benefits of statins reducing coronary events have been related to repopulation of vulnerable plaques with VSMC. Here, we investigated whether HMG-CoA reductase inhibition with rosuvastatin can reverse the effects induced by atherogenic concentrations of LDL either in the native (nLDL) form or modified by aggregation (agLDL) on human VSMC motility. Using a model of wound repair, we showed that treatment of human coronary VSMC with rosuvastatin significantly prevented (and reversed) the inhibitory effect of nLDL and agLDL in the repair of the cell depleted areas. In addition, rosuvastatin significantly abolished the agLDL-induced dephosphorylation of myosin regulatory light chain as demonstrated by 2DE-electrophoresis and mass spectrometry. Besides, confocal microscopy showed that rosuvastatin enhances actin-cytoskeleton reorganization during lipid-loaded-VSMC attachment and spreading. The effects of rosuvastatin on actin-cytoskeleton dynamics and cell migration were dependent on ROCK-signalling. Furthermore, rosuvastatin caused a significant increase in RhoA-GTP in the cytosol of VSMC. Taken together, our study demonstrated that inhibition of HMG-CoA reductase restores the migratory capacity and repair function of VSMC that is impaired by native and aggregated LDL. This mechanism may contribute to the stabilization of lipid-rich atherosclerotic plaques afforded by statins