469 search results - page 58 / 94 » On Adversary Models and Compositional Security |
97
Voted
WWW
2003
ACM
16 years 13 days ago
2003
ACM
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
101
click to vote
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
144
click to vote
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
100
click to vote
PODC
2009
ACM
16 years 9 days ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
DLOG
2009
15 years 26 days ago
2009
Relation Based Access Control (RelBAC) is an access control model designed for the new scenarios of access control on Web 2.0. Under this model, we discuss in this paper how to for...