Secure multiparty computation is becoming a concrete option in protocol design. Indeed, due to the astonishing improvement in computing power and refined optimization techniques, developed during the past years, the general solutions for secure multiparty computation are almost practical in several applications. The circuit-based solutions can be executed in reasonable times, and homomorphic-encryption-based solutions, for certain input sizes and suitable choices of methods and parameters, are doable too. In this paper our goal is to understand more the current costs of implementing such solutions, by using off-the-shelf tools for secure multiparty computation. Precisely, we focus on the well-known private set-intersection problem, and on private computation of statistics on the set-intersection. Our contribution is the following: We conclude the paper discussing open issues and providing some hints for future researches.