Sciweavers

18 search results - page 3 / 4
» Context-Sensitive Equivalences for Non-interference Based Pr...
Sort
View
CCS
2005
ACM
15 years 3 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
SIGIR
2009
ACM
15 years 3 months ago
Link analysis for private weighted graphs
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
Jun Sakuma, Shigenobu Kobayashi
TIFS
2008
154views more  TIFS 2008»
14 years 9 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
77
Voted
SASO
2007
IEEE
15 years 3 months ago
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distrib...
Steven Y. Ko, Indranil Gupta, Yookyung Jo
IPPS
1997
IEEE
15 years 1 months ago
Enhancing Software DSM for Compiler-Parallelized Applications
Current parallelizing compilers for message-passing machines only support a limited class of data-parallel applications. One method for eliminating this restriction is to combine ...
Peter J. Keleher, Chau-Wen Tseng