| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
A Characterization of Ideal Weighted Secret Sharing Schemes | Ali Hameed
; Arkadii Slinko
; | Date: |
17 Aug 2013 | Abstract: | Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially
characterized access structures of ideal weighted threshold secret sharing
schemes in terms of the operation of composition. They classified
indecomposable ideal weighted threshold access structures, and proved that any
other ideal weighted threshold access structure is a composition of
indecomposable ones. It remained unclear which compositions of indecomposable
weighted threshold access structures are weighted. In this paper we fill the
gap. Using game-theoretic techniques we determine which compositions of
indecomposable ideal access structures are weighted, and obtain an if and only
if characterization of ideal weighted threshold secret sharing schemes. | Source: | arXiv, 1308.3763 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |