On construction of cumulative secret sharing schemes
Ghodosi, Hossein, Piperzyk, Josef, Safavi-Naini, Rei, and Wang, Huaxiong (1998) On construction of cumulative secret sharing schemes. Lecture Notes in Computer Science, 1438 . pp. 379-390.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 633Kb |
DOI: 10.1007/BFb0053749
View at Publisher Website: http://dx.doi.org/10.1007/BFb0053749
Abstract
Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures.
This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.
| ID Code: | 18484 |
|---|---|
| Item Type: | Article (Refereed Research - C1) |
| FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0804 Data Format > 080401 Coding and Information Theory @ 100% |
| SEO Codes: | 89 INFORMATION AND COMMUNICATION SERVICES > 8903 Information Services > 890399 Information Services not elsewhere classified @ 100% |
| Deposited On: | 13 Jun 2012 09:09 |
| Last Modified: | 13 Jun 2012 09:09 |
| Downloads: | Total: 2 Last 12 Months: 2 |
| Statistics: | More Statistics |
Repository Staff Only: item control page