Sciweavers

576 search results - page 67 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
COMPSAC
2008
IEEE
14 years 3 months ago
A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats
This work introduces probabilistic model checking as a viable tool-assisted approach for systematically quantifying DoS security threats. The proposed analysis is based on a proba...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
COLCOM
2005
IEEE
14 years 2 months ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
LPAR
2007
Springer
14 years 3 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 13 days ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
INFOCOM
2005
IEEE
14 years 2 months ago
Anonymous communications in mobile ad hoc networks
— Due to the broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are more susceptible to malicious traffic analysis. In this paper we prop...
Yanchao Zhang, Wei Liu, Wenjing Lou