We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
We present a specification for a new, localized group membership service that maintains the membership status of adjacent nodes – called neighbors – in a mobile distributed s...
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
In this paper we address the challenges associated with the verification of correctness of communication between agents in MultiAgent Systems. Our approach applies model-checking ...
—New protocols are often useful, but are hard to implement well. Protocol synthesis is a solution, but synthesized protocols can be slow. Implementing protocols will be even more...