No label defined (Q4500976)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1498786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1498786 |
Statements
3 September 2000
0 references
secret sharing scheme
0 references
\((k,n
0 references
v)\)-threshold scheme
0 references
0.913021683692932
0 references
0.9016544818878174
0 references
The question is studied when perfect \((k,n;v)\)-threshold (secret sharing) schemes with veto capability exist. A \((k,n;v)\)-threshold scheme with veto shares a secret among \(n\) participants in such a way that any \(v\) or more veto participants can always prevent the revelation of the secret while any coalition containing fewer than \(v\) veto participants can recover the secret exactly if and only if this coalition also contains \(k\) or more ``positive'' participants. It is established that perfect \((k,n;v)\)-threshold schemes with veto can exist only if \(k+v=n\). It is proven that ideal \((k,n;v)\)-threshold schemes with more than one (\(v>1\)) veto participants do not exist. The construction of ideal perfect \((q-1,q;1)\)-threshold schemes with one veto participant is given using \(q\)-ary (\(q\) is a prime power greater than 2) Hamming codes. For the entire collection see [Zbl 0918.00043].
0 references