- Title
- Sum graph based access structure in a secret sharing scheme
- Creator
- Miller, Mirka; Slamet, Surjadi; Sugeng, Kiki Ariyanti
- Date
- 2006
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/68921
- Identifier
- vital:605
- Identifier
- ISSN:1817-2725
- Abstract
- Secret sharing scheme is a method to distribute secret information to a set P of participants so that only authorised subsets of P can reconstruct the secret. A set of subsets of P that can reconstruct the secret is called an access structure of the scheme. A simple undirected graph G is called a sum graph if there exists a labeling L of the vertices of G into distinct numbers, usually positive integers, such that any two distinct vertices u and v of G are adjacent if and only if there is a vertex w whose label is L(w) = L(u) + L(v). In this paper, we will show how sum labeling can be used for representing the graphs of the access structures of a secret sharing scheme. We will combine a known secret sharing scheme such as the classical Shamir scheme with a graph access structure represented using sum graph labeling to obtain a new secret sharing scheme.; C1
- Publisher
- Lahore, Pakistan GC University
- Relation
- Journal of Prime Research in Mathematics Vol. 2, no. (2006), p. 113-119
- Rights
- Open Access
- Rights
- Copyright GC University
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Secret sharing scheme; Sum graph labeling
- Full Text
- Reviewed
- Hits: 1083
- Visitors: 1150
- Downloads: 51
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Published version | 152 KB | Adobe Acrobat PDF | View Details Download |