Sciweavers

286 search results - page 11 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
IEEEARES
2009
IEEE
15 years 4 months ago
Algebraic Properties in Alice and Bob Notation
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...
Sebastian Mödersheim
CCS
2008
ACM
14 years 11 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
CADE
2005
Springer
15 years 9 months ago
Deduction with XOR Constraints in Security API Modelling
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
Graham Steel
CCS
2009
ACM
15 years 10 months ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
DEON
2008
Springer
14 years 11 months ago
Trust and Norms in the Context of Computer Security: A Logical Formalization
Abstract. In this paper we present a logical model of trust in which trust is conceived as an expectation of the truster about some properties of the trustee. A general typology of...
Emiliano Lorini, Robert Demolombe