In collaborative applications, participants agree on certain level of secure communication based on communication policy speciļ¬cations. Given secure communication policy speciļ¬...
Srilaxmi Malladi, Sushil K. Prasad, Shamkant B. Na...
We deal with two claws of Zhou-Gollmann's fair nonrepudiation protocol. Firstly, their protocol divides a message into 2 parts, i.e., a key K and a ciphertext C. Then, C is d...
We describe a trust-based data management framework enabling mobile devices to access the distributed computation, storage, and sensory resources available in pervasive computing ...
Anand Patwardhan, Filip Perich, Anupam Joshi, Tim ...
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...