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

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

A diffusion model for population growth in random environment

The growth of a population in a randomly varying environment is modeled by replacing the Malthusian growth rate with a delta-correlated normal process. The population size is then shown to be a random process, lognormally distributed, obeying a diffusion equation of the Fokker-Planck type. The first passage time p.d.f. through any arbitrarily assigned value and the probability of absorption are derived. The asymptotic behavior of the population size is investigated

Diffusion approximation and first passage time problem for a model neuron

A diffusion equation for the transition p.d.f. describing the time evolution of the membrane potential for a model neuron, subjected to a Poisson input, is obtained, without breaking up the continuity of the underlying random function. The transition p.d.f. is calculated in a closed form and the average firing interval is determined by using the steady-state limiting expression of the transition p.d.f. The Laplace transform of the first passage time p.d.f. is then obtained in terms of Parabolic Cylinder Functions as solution of a Weber equation, satisfying suitable boundary conditions. A continuous input model is finally investigated

Growth with regulation in random environment

The diffusion model for a population subject to Malthusian growth is generalized to include regulation effects. This is done by incorporating a logarithmic term in the regulation function in a way to obtain, in the absence of noise, an S-shaped growth law retaining the qualitative features of the logistic growth curve. The growth phenomenon is modeled as a diffusion process whose transition p.d.f. is obtained in closed form. Its steady state behavior turns out to be described by the lognormal distribution. The expected values and the mode of the transition p.d.f. are calculated, and it is proved that their time course is also represented by monotonically increasing functions asymptotically approaching saturation values. The first passage time problem is then considered. The Laplace transform of the first passage time p.d.f. is obtained for arbitrary thresholds and is used to calculate the expected value of the first passage time. The inverse Laplace transform is then determined for a threshold equal to the saturation value attained by the population size in the absence of random components. The probability of absorption for an arbitrary barrier is finally calculated as the limit of the absorption probability in a two-barrier problem

Growth with regulation in fluctuating environments. II. Intrinsic lower bounds to population size

Population growth is modelled by means of diffusion processes originating from fluctuation equations of a new type. These equations are obtained in the customary way by inserting random fluctuations into first order non linear differenti al equations. However, different1y from the cases so far considered in the literature, equations possessing two non trivial fixed points are taken into account. The underlying deterministic models depict the regulated growth of a population whose size cannot decrease below some preassigned lower threshold naturally acting as an absorbing boundary. A fair1y comprehensive mathematical description of these models is provided

Protecting secret data from insider attacks

Abstract. We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem of protecting secret data, assuming an attacker is inside a target network or has compromised a system. We give a definition of the problem area, and propose a solution, VAST, that uses large, structured files to improve the secure storage of valuable or secret data. Each secret has its multiple shares randomly distributed in an extremely large file. Random decoy shares and the lack of usable identification information prevent selective copying or analysis of the file. No single part of the file yields useful information in isolation from the rest. The file’s size and structure therefore present an enormous additional hurdle to attackers attempting to transfer, steal or analyze the data. The system also has the remarkable property of healing itself after malicious corruption, thereby preserving both the confidentiality and integrity of the data.