458 search results - page 73 / 92 » Perfect Skolem sets |
117
click to vote
IACR
2011
13 years 11 months ago
2011
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
109
click to vote
TCC
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
137
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
183
click to vote
VLDB
2007
ACM
16 years 4 hour ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
120
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...