Related papers: Construction of Arithmetic Secret Sharing Schemes …
Constrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of electronic storage…
Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…
A (t,n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t-1 participants can. In this paper, we propose two secret sharing schemes…
We study the properties of secret sharing schemes, where a random secret value is transformed into shares distributed among several participants in such a way that only the qualified groups of participants can recover the secret value. We…
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while…
Using a finite geometric framework for studying the pentagon and heptagon codes we show that the concepts of quantum secret sharing and contextuality can be studied in a nice and unified manner. The basic idea is a careful study of the…
This paper considers the problem of outsourcing the multiplication of two private and sparse matrices to untrusted workers. Secret sharing schemes can be used to tolerate stragglers and guarantee information-theoretic privacy of the…
Asymptotically good sequences of ramp secret sharing schemes were given in [Asymptotically good ramp secret sharing schemes, arXiv:1502.05507] by using one-point algebraic geometric codes defined from asymptotically good towers of function…
We consider secret sharing schemes with a classical secret and quantum shares. One example of such schemes was recently reported whose access structure cannot be realized by any secret sharing schemes with classical shares. In this paper,…
We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box reduction of a statistically hiding commitment scheme from…
Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…
In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a…
A new concept of quantum secret sharing is introduced, in which collaboration among participants are encourage. And the dealer can ask the participants to send back their share and revoke the secret before a predefined date or event, i.e.…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the…
We consider a network coding problem where the destination wants to recover the sum of the signals (Gaussian random variables or random finite field elements) at all the source nodes, but the sum must be kept secret from an eavesdropper…