349 search results - page 21 / 70 » Compositional Security for Task-PIOAs |
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
CSFW
2006
IEEE
15 years 1 months ago
2006
IEEE
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
IJNSEC
2007
14 years 9 months ago
2007
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...