Sciweavers

1923 search results - page 19 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ARCS
2006
Springer
14 years 6 days ago
Safety, Liveness, and Information Flow: Dependability Revisited
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
Zinaida Benenson, Felix C. Freiling, Thorsten Holz...
JPDC
2007
86views more  JPDC 2007»
13 years 8 months ago
Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
Tao Xie 0004, Xiao Qin
ICPR
2006
IEEE
14 years 9 months ago
Unifying Background Models over Complex Audio using Entropy
In this paper we extend an existing audio background modelling technique, leading to a more robust application to complex audio environments. The determination of background audio...
Geoff A. W. West, Simon Moncrieff, Svetha Venkates...
PCI
2009
Springer
14 years 1 months ago
A Foundation for Defining Security Requirements in Grid Computing
—Despite the wide adoption by the scientific community, grid technologies have not been given the appropriate attention by enterprises. This is merely due to the lack of enough s...
Antonios Gouglidis, Ioannis Mavridis
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai