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...
For web applications, determining how requests from a web page are routed through server components can be time-consuming and error-prone due to the complex set of rules and mecha...
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Mining operations have traditionally used specialised software packages to process and visualise valuable mining data. The downside to this approach is that the information can on...
A field study of Computer Mediated Communication (CMC) as used in higher education asks the questions, "Will students take part in synchronous chat sessions if they are sched...