Sciweavers

1923 search results - page 133 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ASIACRYPT
2004
Springer
15 years 3 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
Jean Monnerat, Serge Vaudenay
GCC
2004
Springer
15 years 3 months ago
An Active Resource Management System for Computational Grid
In this paper, we propose an active grid resource management system supported by active networks for computational grid. First, we construct a scalable two-level resource managemen...
Xiaolin Chen, Chang Yang, Sanglu Lu, Guihai Chen
CCS
2008
ACM
14 years 12 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...
NSPW
2006
ACM
15 years 3 months ago
Cent, five cent, ten cent, dollar: hitting botnets where it really hurts
Spyware, Adware, Bots. In each case, there is significant evidence that there is an increasing financial motivation behind the writing and distribution of these programs. In thi...
Richard Ford, Sarah Gordon
POPL
2008
ACM
15 years 10 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk