Sciweavers

163 search results - page 27 / 33
» Relaxing Chosen-Ciphertext Security
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 10 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
COMPSAC
2002
IEEE
15 years 9 months ago
Designing a Distributed Software Development Support System Using a Peer-to-Peer Architecture
Distributed software development support systems typically use a centralized client-server architecture. This approach has some drawbacks such as the participants may experience l...
Seth Bowen, Frank Maurer
NDSS
2000
IEEE
15 years 8 months ago
Analysis of a Fair Exchange Protocol
We analyze an optimistic contract signing protocol of Asokan, Shoup, and Waidner as a case study in the applicability of formal methods to verification of fair exchange protocols...
Vitaly Shmatikov, John C. Mitchell
EUROCRYPT
2003
Springer
15 years 9 months ago
Two-Threshold Broadcast and Detectable Multi-party Computation
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
Matthias Fitzi, Martin Hirt, Thomas Holenstein, J&...
124
Voted
ESORICS
2006
Springer
15 years 7 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...