225 search results - page 27 / 45 » Nonperfect Secret Sharing Schemes |
MOBISYS
2005
ACM
14 years 7 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
SP
2008
IEEE
14 years 1 months ago
2008
IEEE
We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication...
DCC
2005
IEEE
14 years 7 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,...
CRYPTO
1992
Springer
13 years 11 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
2008
Springer
13 years 9 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...