In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are...
Michel Cukier, Jennifer Ren, Chetan Sabnis, David ...
In this paper, we introduce the concept of witness anonymity for peer-to-peer systems. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest p...
Abstract. This paper presents a protocol called SAKE (Software Attestation for Key Establishment), for establishing a shared key between any two neighboring nodes of a sensor netwo...
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...