Sciweavers

28 search results - page 4 / 6
» On the Optimization of Bipartite Secret Sharing Schemes
Sort
View
TIT
2008
187views more  TIT 2008»
13 years 7 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
13 years 11 months ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
DCC
2005
IEEE
14 years 7 months ago
XOR-based Visual Cryptography Schemes
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,...
Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, ...
TDSC
2010
218views more  TDSC 2010»
13 years 5 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
MOBIHOC
2009
ACM
14 years 8 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...