796 search results - page 139 / 160 » The Anonymous Subgraph Problem |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. As more and more P2P applications being popular in Internet, one of important problem to be solved is inspiring users to cooperate each other actively and honestly, the r...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
EUROCRYPT
1999
Springer
14 years 23 days ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
PKC
1999
Springer
14 years 22 days ago
1999
Springer
Abstract. In a distributed system, dynamically dividing execution between nodes is essential for service robustness. However, when all of the nodes cannot be equally trusted, and w...
PODC
2010
ACM
14 years 11 days ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...