Sciweavers

796 search results - page 81 / 160
» The Anonymous Subgraph Problem
Sort
View
92
Voted
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
15 years 6 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
107
Voted
WWW
2010
ACM
15 years 6 months ago
Privacy in dynamic social networks
Recent work on anonymizing online social networks (OSNs) has looked at privacy preserving techniques for publishing a single instance of the network. However, OSNs evolve and a si...
Smriti Bhagat, Graham Cormode, Balachander Krishna...
IEEECIT
2010
IEEE
14 years 11 months ago
Enabling Privacy-preserving Credential-based Access Control with XACML and SAML
—In this paper we describe extensions to the access control industry standards XACML and SAML to enable privacy-preserving and credential-based access control. Rather than assumi...
Claudio Agostino Ardagna, Sabrina De Capitani di V...
104
Voted
SIROCCO
2010
14 years 11 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
AICCSA
2007
IEEE
108views Hardware» more  AICCSA 2007»
15 years 7 months ago
On Secure Consensus Information Fusion over Sensor Networks
In this work we have examined the problem of consensus information fusion from a novel point of view, challenging the fundamental assumption of mutual trust among the fusion parti...
Mahdi Kefayati, Mohammad Sadegh Talebi, Hamid R. R...