Sciweavers

796 search results - page 87 / 160
» The Anonymous Subgraph Problem
Sort
View
128
Voted
IJSNET
2007
95views more  IJSNET 2007»
15 years 21 days ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
100
Voted
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 25 days ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
90
Voted
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 7 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
FC
2007
Springer
158views Cryptology» more  FC 2007»
15 years 7 months ago
Hidden Identity-Based Signatures
This paper introduces Hidden Identity-based Signatures (Hidden-IBS), a type of digital signatures that provide mediated signer-anonymity on top of Shamir’s Identity-based signat...
Aggelos Kiayias, Hong-Sheng Zhou
111
Voted
USS
2004
15 years 2 months ago
Tor: The Second-Generation Onion Router
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...
Roger Dingledine, Nick Mathewson, Paul F. Syverson