147 research outputs found

    Ideal hierarchical secret sharing schemes

    Get PDF
    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

    Genome-independent hypoxic repression of estrogen receptor alpha in breast cancer cells

    Get PDF
    Averages and standard deviations of band intensities calculated for all repeats of each western blot in Fig. 2a. Specific band intensities normalized to the loading control bands (β-actin). Calculations derived from at least three independent experiments. (DOCX 17 kb

    Optimal non-perfect uniform secret sharing schemes

    Get PDF
    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

    Smart sensing interoperability platforms in the scope of Atlantos

    Get PDF
    This paper aims to demonstrate the capabilities of a Smart Cable which aims to convert any commercial non-PUCK-enabled sensor in a Smart PUCK-enabled device. Through this development, it can be easily integrated on a sensor web platform in order to access the data in real time, and so there is no need to rely on each sensor manufacturer to comply with Sensor Web Enablement standards. The results presented in this paper were acquired during some real field experiments performed between the 24th and 28th of September at PLOCAN facilities in Gran Canaria. During these days three Turner Designs Cyclops sensors were successfully integrated and tested in a mission using an observing surface vehicle such as the Wave Glider SV-2.Peer Reviewe

    Trends in Qualifying Biomarkers in Drug Safety. Consensus of the 2011 Meeting of the Spanish Society of Clinical Pharmacology

    Get PDF
    In this paper we discuss the consensus view on the use of qualifying biomarkers in drug safety, raised within the frame of the XXIV meeting of the Spanish Society of Clinical Pharmacology held in Málaga (Spain) in October, 2011. The widespread use of biomarkers as surrogate endpoints is a goal that scientists have long been pursuing. Thirty years ago, when molecular pharmacogenomics evolved, we anticipated that these genetic biomarkers would soon obviate the routine use of drug therapies in a way that patients should adapt to the therapy rather than the opposite. This expected revolution in routine clinical practice never took place as quickly nor with the intensity as initially expected. The concerted action of operating multicenter networks holds great promise for future studies to identify biomarkers related to drug toxicity and to provide better insight into the underlying pathogenesis. Today some pharmacogenomic advances are already widely accepted, but pharmacogenomics still needs further development to elaborate more precise algorithms and many barriers to implementing individualized medicine exist. We briefly discuss our view about these barriers and we provide suggestions and areas of focus to advance in the field

    On the optimization of bipartite secret sharing schemes

    Get PDF
    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
    corecore