Sciweavers

468 search results - page 23 / 94
» Cryptographic and Computational Challenges in Grid Computing
Sort
View
CCS
2009
ACM
15 years 8 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ESOP
2005
Springer
15 years 7 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
GRID
2007
Springer
15 years 8 months ago
Fine-grained access control for GridFTP using SecPAL
– Grid access control policy languages today are generally one of two extremes: either extremely simplistic, or overly complex and challenging for even security experts to use. I...
Marty Humphrey, Sang-Min Park, Jun Feng, Norm Beek...
CORR
2007
Springer
142views Education» more  CORR 2007»
15 years 1 months ago
Resource and Application Models for Advanced Grid Schedulers
: As Grid computing is becoming an inevitable future, managing, scheduling and monitoring dynamic, heterogeneous resources will present new challenges. Solutions will have to be ag...
Aleksandar Lazarevic, Lionel Sacks
IPPS
2007
IEEE
15 years 8 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...