Sciweavers

241 search results - page 28 / 49
» On Proactive Secret Sharing Schemes
Sort
View
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
14 years 28 days 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
NETWORKING
2004
13 years 10 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
COCOON
2008
Springer
13 years 10 months ago
Visual Cryptography on Graphs
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...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
INFOCOM
2011
IEEE
13 years 2 days ago
Physical layer wireless security made fast and channel independent
Abstract – There is a growing interest in physical layer security. Recent work has demonstrated that wireless devices can generate a shared secret key by exploiting variations in...
Shyamnath Gollakota, Dina Katabi
DBSEC
2008
196views Database» more  DBSEC 2008»
13 years 10 months ago
Shared and Searchable Encrypted Data for Untrusted Servers
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...
Changyu Dong, Giovanni Russello, Naranker Dulay