Most systems designed for the verification of security protocols operate under the unproved assumption that an attack can only result from the combination of a fixed number of message transformations, which altogether constitute the capabilities of the so-called Dolev-Yao intruder. In this paper, we prove that the Dolev-Yao intruder can indeed emulate the actions of an arbitrary adversary. In o...

For i = 1, ... ,p, let Xi!, ... ,Xini denote independent random samples from normal populations. The ith population has unknown mean Jli and unknown variance a;. We consider the sign testing problem of testing Ho : Jli :::; ai, for some i = 1, ... ,p, versus HI : Jli > ai, for all i = 1, ... ,p, where al,." ,ap are fixed constants. Here, HI might represent p different standards that a product m...

Over the last decade, the architectural spectrum of large-scale parallel systems has been dominated by the cluster-of-workstation paradigm. These systems are characterized by loose hardware integration between the networking and the CPU/memory components, and lack the efficiency of custom-designed computing platforms. As a result, while peak processor performance increases exponentially accordi...

Sequential ranks of data X1, X2, . . . observed sequentially in time are defined as ranks computed from the data observed so far, denoting Rii the rank of Xi among the values X1, X2, . . . , Xi for any i. This paper studies tests of various hypotheses based on sequential ranks and derives such tests, which are locally most powerful among all tests based on sequential ranks. Such locally most po...