Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
—In this paper, the problem of deploying relay nodes in wireless sensor networks will be considered. A system consisting of a set of sensor nodes communicating to a fusion center...
In this paper, we discuss the advantages and disadvantages of using network simulators to teach networking concepts versus having students write programs. The authors have experie...
—The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security po...