Sciweavers

285 search results - page 7 / 57
» Relating two formal models of path-vector routing
Sort
View
FORTE
2004
14 years 10 months ago
Automatized Verification of Ad Hoc Routing Protocols
Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two...
Oskar Wibling, Joachim Parrow, Arnold Neville Pear...
GC
2004
Springer
15 years 2 months ago
Towards a Formal Treatment of Secrecy Against Computational Adversaries
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Angelo Troina, Alessandro Aldini, Roberto Gorrieri
MSWIM
2006
ACM
15 years 3 months ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi
ICDE
2009
IEEE
140views Database» more  ICDE 2009»
14 years 7 months ago
Routing Questions to the Right Users in Online Communities
Online forums contain huge amounts of valuable user-generated content. In current forum systems, users have to passively wait for other users to visit the forum systems and read/an...
Yanhong Zhou, Gao Cong, Bin Cui, Christian S. Jens...
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...