Secret Sharing Based On Cartesian product Of Graphs
Authors
Abstract:
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ and $P_{m}times C_{n}$ and obtain the exact value of information ratio of these graphs.
similar resources
The reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
full textSecret sharing schemes on graphs
Given a graph G, a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G, the participants, so that a subset of participants can recover the secret if they contain an edge of G, otherwise they can obtain no information regarding the key. The average information rate is the ratio of the size of the secret and the average size of the share a part...
full textSecret sharing on infinite graphs
We extend the notion of perfect secret sharing scheme for access structures with infinitely many participants. In particular we investigate cases when the participants are the vertices of an (infinite) graph, and the minimal qualified sets are the edges. The (worst case) information ratio of an access structure is the largest lower bound on the amount of information some participant must rememb...
full textOn secret sharing for graphs
In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for “graph to number” conversion methods. Hence, the existing schemes can be used, without weakening their properties. Next, we show how graph properties can be used to extend capabilities of secret sharing schemes. This l...
full textOn subgraphs of Cartesian product graphs
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
full textOn Secret Sharing with Nonlinear Product Reconstruction
Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that “the product of two secrets is obtained as a linear function of the vector consisting of the coordinate-wise product of two respective share-vectors”. This paper focuses on t...
full textMy Resources
Journal title
volume 8 issue None
pages 31- 38
publication date 2013-10
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023