Sciweavers

2139 search results - page 172 / 428
» Distributed computing and computer security education
Sort
View
148
Voted
CCS
2010
ACM
15 years 3 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
EDCC
1994
Springer
15 years 7 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
ICDCS
2010
IEEE
15 years 7 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
111
Voted
ICDCS
2005
IEEE
15 years 9 months ago
Equational Approach to Formal Analysis of TLS
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
Kazuhiro Ogata, Kokichi Futatsugi
IPPS
2005
IEEE
15 years 9 months ago
Characterizing Secure Dynamic Web Applications Scalability
Security in the access to web contents and the interaction with web sites is becoming one of the most important issues in Internet. Servers need to provide certain levels of secur...
Jordi Guitart, Vicenç Beltran, David Carrer...