Sciweavers

576 search results - page 50 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Model checking detectability of attacks in multiagent systems
Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicabil...
Ioana Boureanu, Mika Cohen, Alessio Lomuscio
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
14 years 15 days ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
TC
2008
13 years 8 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
CSFW
2007
IEEE
14 years 3 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
ACSAC
1999
IEEE
14 years 1 months ago
Using Checkable Types in Automatic Protocol Analysis
The Automatic Authentication Protocol Analyzer, 2nd Version AAPA2 is a fast, completely automatic tool for formally analyzing cryptographic protocols. It correctly identi es vulne...
Stephen H. Brackin