Sciweavers

401 search results - page 21 / 81
» Formal Analysis of Meeting Protocols
Sort
View
100
Voted
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 5 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
ISCIS
2004
Springer
15 years 5 months ago
Correctness Requirements for Multiagent Commitment Protocols
Abstract. Commitments are a powerful abstraction for representing the interactions between agents. Commitments capture the content of the interactions declaratively and allow agent...
Pinar Yolum
76
Voted
ACSAC
1999
IEEE
15 years 4 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
CCS
2009
ACM
15 years 6 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
BROADNETS
2006
IEEE
15 years 5 months ago
How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET
Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these prot...
Panagiotis Papadimitratos, Zygmunt J. Haas, Jean-P...