Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
The members of electronic communities are often unrelated to each other, they may have never met and have no information on each other's reputation. This kind of information ...
This paper describes the uses and architecture of a network-centered computing-rich software platform called PowerWeb. PowerWeb was designed and built as a simulation environment ...
Ray Zimmerman, Robert J. Thomas, Deqiang Gan, Carl...
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...