We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has b...
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
Motivated by the tradeoff between security and efficiency performance parameters that has been imposed on all modern wireless security protocols, we designed a novel security syst...
We describe a family of ÐÓ Ò protocols for assigning symmetric keys to Ò processes in a network so that each process can use its assigned keys to communicate securely with eve...
Amitanand S. Aiyer, Lorenzo Alvisi, Mohamed G. Gou...