36 search results - page 3 / 8 » Secret Sharing Schemes for Very Dense Graphs |
SCN
2008
Springer
13 years 5 months ago
2008
Springer
In 2004, Molnar and Wagner introduced a very appealing scheme dedicated to the identification of RFID tags. Their protocol relies on a binary tree of secrets which are shared
SASN
2004
ACM
13 years 10 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
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...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...