Sciweavers

1342 search results - page 187 / 269
» Attacks are Protocols Too
Sort
View
EUROCRYPT
1998
Springer
15 years 10 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
FSTTCS
2006
Springer
15 years 10 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Véronique Cortier, Steve Kremer, Ralf K&uum...
CCS
2008
ACM
15 years 8 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
IJCAI
2007
15 years 7 months ago
Multi-Agent System that Attains Longevity via Death
We propose a novel approach to self-regenerating systems which require continuous operation, such as security surveillance. For that aim we introduce HADES, a self-regenerating co...
Megan Olsen, Hava T. Siegelmann
NETWORKING
2004
15 years 7 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar