Sciweavers

286 search results - page 1 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
IEEEARES
2010
IEEE
13 years 11 months ago
Pitfalls in Formal Reasoning about Security Protocols
Formal verification can give more confidence in the security of cryptographic protocols. Application specific security properties like “The service provider does not loose mo...
Nina Moebius, Kurt Stenzel, Wolfgang Reif
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 8 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
IFIP
2010
Springer
12 years 11 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
IFIPTM
2010
145views Management» more  IFIPTM 2010»
13 years 3 months ago
A Formal Notion of Trust - Enabling Reasoning about Security Properties
Historically, various different notions of trust can be found, each addressing particular aspects of ICT systems, e.g. trust in electronic commerce systems based on reputation and...
Andreas Fuchs, Sigrid Gürgens, Carsten Rudolp...
CSFW
1999
IEEE
13 years 9 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch