35 search results - page 6 / 7 » On the bound for anonymous secret sharing schemes |
CRYPTO
1992
Springer
13 years 10 months ago
1992
Springer
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
EUROCRYPT
2004
Springer
13 years 11 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...
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...
COCO
1993
Springer
13 years 10 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
COCOON
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...