Sciweavers

123 search results - page 11 / 25
» Modelling the relative strength of security protocols
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
ATVA
2008
Springer
115views Hardware» more  ATVA 2008»
13 years 9 months ago
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
Authentication and secrecy have been widely investigated in security protocols. They are closely related to each other and variants of definitions have been proposed, which focus o...
Guoqiang Li, Mizuhito Ogawa
FORTE
2003
13 years 8 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
SAFECOMP
2010
Springer
13 years 5 months ago
Reliability Analysis of Safety-Related Communication Architectures
Abstract. In this paper we describe a novel concept for reliability analysis of communication architectures in safety-critical systems. This concept has been motivated by applicati...
Oliver Schulz, Jan Peleska
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 24 days ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr