Related papers: Secret Sharing on Superconcentrator
Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the…
Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this…
We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular types. We establish an exact correspondence between the…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…
Secret sharing is an instrumental tool for sharing secret keys in distributed systems. In a classical threshold setting, this involves a dealer who has a secret/key, a set of parties/users to which shares of the secret are sent, and a…
We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on…
How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to…
Secret Sharing techniques are now the building blocks of several security protocols. A (t;n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing…
The secret sharing schemes are the important tools in cryptography that are used as building blocks in many secured protocols. It is a method used for distributing a secret among the participants in a manner that only the threshold number…
Ouyang et al. proposed an $(n,n)$ threshold quantum secret sharing scheme, where the number of participants is limited to $n=4k+1,k\in Z^+$, and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an…
Motivated by the increasing need for fast processing of large-scale graphs, we study a number of fundamental graph problems in a message-passing model for distributed computing, called $k$-machine model, where we have $k$ machines that…
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 introduce the {\em certification} of solutions to graph problems when access to the input is restricted. This topic has received a lot of attention in the distributed computing setting, and we introduce it here in the context of…
We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the…
Secret sharing schemes with optimal and universal communication overheads have been obtained independently by Bitar et al. and Huang et al. However, their constructions require a finite field of size q > n, where n is the number of shares,…
This paper proposes a ($k,n$)-threshold secret image sharing scheme that offers flexibility in terms of meeting contrasting demands such as information security and storage efficiency with the help of a randomized kernel (binary matrix)…
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,…
We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, and Tapp. Parametrized by a graph G and a subset of its…
The threshold secret sharing scheme allows the dealer to distribute the share to every participant such that the secret is correctly recovered from a certain amount of shares. The traditional $(k, n)$-threshold secret sharing scheme…