4217 search results - page 7 / 844 » Computational indistinguishability logic |
ENTCS
2006
13 years 7 months ago
2006
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
REPLICATION
2010
13 years 5 months ago
2010
Abstract The chapter studies how to provide clients with access to a replicated object that is logically indistinguishable from accessing a single yet highly available object. We s...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
CIS
2005
Springer
14 years 29 days ago
2005
Springer
A secure group signature is required to be anonymous, that is, given two group signatures generated by two different members on the same message or two group signatures generated ...
EUROPAR
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...