Sciweavers

977 search results - page 72 / 196
» Soft Constraints for Security
Sort
View
STACS
2007
Springer
15 years 4 months ago
Associative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
CORR
2006
Springer
117views Education» more  CORR 2006»
14 years 10 months ago
The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and in...
Ender Tekin, Aylin Yener
IMC
2007
ACM
14 years 11 months ago
Cryptographic strength of ssl/tls servers: current and recent practices
The Secure Socket Layer (SSL) and its variant, Transport Layer Security (TLS), are used toward ensuring server security. In this paper, we characterize the cryptographic strength ...
Homin K. Lee, Tal Malkin, Erich M. Nahum
ACSD
2010
IEEE
261views Hardware» more  ACSD 2010»
14 years 8 months ago
Partial Order Reduction for Branching Security Protocols
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs
CHI
2010
ACM
15 years 4 months ago
Usability and strength in click-based graphical passwords
Click-based graphical passwords have attractive usability properties, such as cueing and good memorability. However, image size and number of click-points in each password signifi...
Elizabeth Stobert