41 search results - page 4 / 9 » Dynamic Key Generations for Secret Sharing in Access Structu... |
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
IJNSEC
2008
13 years 7 months ago
2008
In wireless networks, secure multicast protocols are more difficult to implement efficiently due to the dynamic nature of the multicast group and the scarcity of bandwidth at the ...
TCC
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
IACR
2011
12 years 7 months ago
2011
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...