We present a novel efficient variant of Verifiable Secret Sharing (VSS) where the dealing of shares is dynamically refreshed (without changing or corrupting the secret) against the threat of the recently considered mobile adversary that may control all the trustees, but only a bounded number thereof at any time period. VSS enables a dealer to distribute its secret to a set of trustees, so that ...

background:infant mortality is often used as a standard measure of a population’s health. until cause of sudden infant death syndrome is unknown (sids), the best strategy to decrease sids, is programming to decrease facing with risk factors. the aim of this study was to find the sids risk factors among families during their child care in iran. the study is the first in iran to examine the risk ...

Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the informationtheoretic model. By representing the sets as polynomial...

In this work, we present a new framework to discover the daily mobility routines which are contained in a real-life dataset collected from a bike-sharing system. Our goal is the discovery and analysis of mobility patterns which characterize the behavior of the stations of a bike-sharing system based on the number of available bikes along a day. An unsupervised methodology based on probabilistic...

At the beginning some results from the field of graph theory are presented. Next we show how to share a secret that is proper n-coloring of the graph, with the known structure. The graph is described and converted to the form, where colors assigned to vertices form the number with entries from Zn. A secret sharing scheme (SSS) for the graph coloring is proposed. The proposed method is applied t...

A probabilistic relational database is a compact form of a set of deterministic relational databases (namely, possible worlds), each of which has a probability. In our framework, the existence of tuples is determined by associated Boolean formulae based on elementary events. An estimation, within such a setting, of the probabilities of possible worlds uses a prior probability distribution speci...

A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the property that the validity of the shares distributed by the dealer can be verified by any party; hence verification is not limited to the respective participants receiving the shares. We present a new construction for PVSS schemes, which compared to previous solutions by Stadler and later by Fujisa...

We define the statistical quadrature evolution (QE) method for multicarrier continuousvariable quantum key distribution (CVQKD). A multicarrier CVQKD protocol uses Gaussian subcarrier quantum continuous variables (CVs) for information transmission. The QE scheme utilizes the theory of mathematical statistics and statistical information processing. The QE model is based on the Gaussian quadratur...