Sciweavers

176 search results - page 29 / 36
» Formal Security Analysis for Ad-Hoc Networks
Sort
View
CSFW
2006
IEEE
14 years 2 months ago
Games for Controls
We argue that games are expressive enough to encompass (history-based) access control, (resource) usage control (e.g., dynamic adaptive access control of reputation systems), acco...
Krishnendu Chatterjee, Radha Jagadeesan, Corin Pit...
CORR
2011
Springer
187views Education» more  CORR 2011»
13 years 2 months ago
Failure of A Mix Network
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
Kun Peng
CADE
2011
Springer
12 years 8 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Automatic analysis of distance bounding protocols
Distance bounding protocols are used by nodes in wireless networks for the crucial purpose of estimating their distances to other nodes. Past efforts to analyze these protocols hav...
Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore ...
CCS
2005
ACM
14 years 1 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...