We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
Humans are "smart components" in a system, but cannot be directly programmed to perform; rather, their autonomy must be respected as a design constraint and incentives p...
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...