We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
—Cube computation over massive datasets is critical for many important analyses done in the real world. Unlike commonly studied algebraic measures such as SUM that are amenable t...
Arnab Nandi, Cong Yu, Philip Bohannon, Raghu Ramak...
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
—Thanks to advances in mobile technology, modern mobile devices have become essential companions, assisting their users in attaining their daily tasks. It will not be long before...
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...