Sciweavers

1923 search results - page 94 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
ICALP
2001
Springer
15 years 2 months ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
ENTCS
2007
110views more  ENTCS 2007»
14 years 9 months ago
A Bayesian Model for Event-based Trust
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...
Mogens Nielsen, Karl Krukow, Vladimiro Sassone
EAGC
2003
Springer
15 years 3 months ago
Automatic Services Discovery, Monitoring and Visualization of Grid Environments: The MapCenter Approach
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
Franck Bonnassieux, Robert Harakaly, Pascale Prime...
CSFW
1994
IEEE
15 years 1 months ago
One-Representative Safety Analysis in the Non-Monotonic Transform Model
We analyze the safety question for the Non-Monotonic Transform NMT model, an access control model that encompasses a wide variety of practical access control mechanisms. In genera...
Ravi S. Sandhu, Paul Ammann