Sciweavers

225 search results - page 26 / 45
» Nonperfect Secret Sharing Schemes
Sort
View
NETWORKING
2004
13 years 8 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
IEEEARES
2008
IEEE
14 years 1 months ago
Privacy-Preserving Distributed Set Intersection
With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round pr...
Qingsong Ye, Huaxiong Wang, Christophe Tartary
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
COCOON
2008
Springer
13 years 9 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
DBSEC
2008
196views Database» more  DBSEC 2008»
13 years 8 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