Sciweavers

1853 search results - page 135 / 371
» Cryptographic Protocols and Network Security
Sort
View
DSN
2003
IEEE
15 years 9 months ago
Reliable Broadcast in a Computational Hybrid Model with Byzantine Faults, Crashes, and Recoveries
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
Michael Backes, Christian Cachin
ISCC
2007
IEEE
15 years 10 months ago
Validating Attacks on Authentication Protocols
— It is possible to show that well-known attacks on authentication protocols are flawed. This is a problem, since good protocols may thus be dismissed rather than improved and p...
Anders Moen Hagalisletto
SP
1989
IEEE
15 years 8 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik
252
Voted
CADE
2011
Springer
14 years 4 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 4 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...