6 search results - page 2 / 2 » Asymptotically Optimal Lower Bounds on the NIH-Multi-Party I... |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...