We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...