Sciweavers

1923 search results - page 15 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
FTDCS
1999
IEEE
14 years 23 days ago
Supporting Real World Security Models in Java
The Java Security Model has undergone considerable evolution since its initial implementation. However, due to its historical focus on securing machines against attack from hostil...
Ian Welch, Robert J. Stroud
ICICS
2003
Springer
14 years 1 months ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li
ESORICS
2005
Springer
14 years 2 months ago
On Scalability and Modularisation in the Modelling of Network Security Systems
Abstract. As the use of computers and data communication technologies spreads, network security systems are becoming increasingly complex, due to the incorporation of a variety of ...
João Porto de Albuquerque, Heiko Krumm, Pau...
PARLE
1994
14 years 16 days ago
Modelling Photochemical Pollution using Parallel and Distributed Computing Platforms
Scientists are increasingly turning to numerical simulation in order to investigate and model complex environmental systems. Numerical simulation has enormous advantages over labor...
David Abramson, M. Cope, R. McKenzie