Sciweavers

691 search results - page 19 / 139
» A New Security Model for Authenticated Key Agreement
Sort
View
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
15 years 5 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
WCC
2005
Springer
123views Cryptology» more  WCC 2005»
15 years 5 months ago
RSA-Based Secret Handshakes
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...
Damien Vergnaud
ACISP
2004
Springer
15 years 5 months ago
Protocols with Security Proofs for Mobile Applications
The Canetti-Krawczyk (CK) model is useful for building reusable components that lead to rapid development of secure protocols, especially for engineers working outside of the secur...
Yiu Shing Terry Tin, Harikrishna Vasanta, Colin Bo...
ASIACRYPT
2005
Springer
15 years 5 months ago
Modular Security Proofs for Key Agreement Protocols
The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular approach to the construction of proofs of security ...
Caroline Kudla, Kenneth G. Paterson