Sciweavers

10 search results - page 2 / 2
» A Formal Treatment of Onion Routing
Sort
View
ARESEC
2011
104views more  ARESEC 2011»
12 years 5 months ago
An Inductive Approach to Provable Anonymity
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
Yongjian Li, Jun Pang
CEC
2007
IEEE
13 years 12 months ago
A comprehensive formal framework for analyzing the behavior of nature-inspired routing protocols
—Nature-inspired routing protocols are becoming an active area of research. Researchers in the community follow a wn engineering philosophy: inspire, abstract, design, develop an...
Saira Zahid, Muhammad Shahzad, Syed Usman Ali, Mud...
SP
2010
IEEE
210views Security Privacy» more  SP 2010»
13 years 9 months ago
Reconciling Belief and Vulnerability in Information Flow
Abstract—Belief and vulnerability have been proposed recently to quantify information flow in security systems. Both concepts stand as alternatives to the traditional approaches...
Sardaouna Hamadou, Vladimiro Sassone, Catuscia Pal...
ENTCS
2006
134views more  ENTCS 2006»
13 years 5 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
WS
2006
ACM
13 years 11 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla