Sciweavers

1923 search results - page 13 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
WISEC
2009
ACM
14 years 3 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CSREASAM
2003
13 years 9 months ago
Developing Secure Web Services for Computational Portals
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...
Choon-Han Youn, Marlon E. Pierce, Geoffrey Fox
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 29 days ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
NSPW
2004
ACM
14 years 1 months ago
Symmetric behavior-based trust: a new paradigm for internet computing
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
Vivek Haldar, Michael Franz
ICDCS
2000
IEEE
14 years 26 days ago
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mecha...
Jonathan Robert Stanton, Yair Amir, Damian Hasse, ...