Sciweavers

4264 search results - page 305 / 853
» Provenance-aware secure networks
Sort
View
AINA
2005
IEEE
16 years 9 days ago
A Practical Modelling Notation for Secure Distributed Computation
Mobile code computation has lead to a new paradigm of distributed computation. A mobile process can move from site to site and interact with the resources as a local process. To p...
Yih-Jiun Lee, Peter Henderson
GI
2003
Springer
15 years 12 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
168
Voted
DSN
2000
IEEE
15 years 11 months ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
COMPSAC
2008
IEEE
15 years 8 months ago
Fabrication of Ontology for Security in Health Care Systems
Given the widespread intimidation state of affairs, there is a gripping want to enlarge architectures, algorithms, and protocols to apprehend a trustworthy network infrastructure....
J. Indumathi, G. V. Uma
CSREAPSC
2006
15 years 8 months ago
Ubiquitous Security: Privacy versus Protection
- In the ambient computing future, security promises to be the foundational design feature that allows pervasive systems to protect personal information privacy. As fledgling perva...
Timothy Buennemeyer, Randolph Marchany, Joseph G. ...