Sciweavers

1923 search results - page 66 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
NDSS
2003
IEEE
15 years 3 months ago
Access Control Based on Execution History
Security is a major, frequent concern in extensible software systems such as Java Virtual Machines and the Common Language Runtime. These systems aim to enable simple, classic app...
Martín Abadi, Cédric Fournet
COORDINATION
2006
Springer
15 years 1 months ago
A Logical View of Choreography
Abstract. We present a model for choreography `a la WS-CDL and formalize it in DSTL(x), a spatio
Carlo Montangero, Laura Semini
GI
2003
Springer
15 years 3 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner
POLICY
2004
Springer
15 years 3 months ago
Policy Based Management for Internet Communities
Policy Based Management (PBM) is a research topic that has been driven by the tremendous complexity inherent in the administration and management of present-day networking and tel...
Kevin Chekov Feeney, David Lewis, Vincent P. Wade
LCN
2005
IEEE
15 years 3 months ago
Secure Content Delivery using Key Composition
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann...