Private predictions on hidden Markov models
Artificial Intelligence Review
A secure protocol for point-segment position problem
WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
| Hi-index | 0.00 |
Privacy is ultimately important, and there is a fair amount of research about it. However, few empirical studies about the cost of privacy are conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising building blocks in place of the classic logic gates. The reason is not only the scalar product complete, which is as good as logic gates, but also the scalar product is much more efficient than logic gates. As a result, we set to study the computation and communication resources needed for some of the most well-known and frequently referred secure scalar-product protocols, including the composite-residuosity, the invertible-matrix, the polynomial-sharing, and the commodity-based approaches. Besides the implementation remarks of these approaches, we analyze and compare their execution time, computation time, and random number consumption, which are the most concerned resources when talking about secure protocols. Moreover, Fairplay, the benchmark approach implementing Yao's famous circuit evaluation protocol, is included in our experiments in order to demonstrate the potentialfor the scalar product to replace logic gates.