Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
Abstract. Monte Carlo (MC) methods have proved to be flexible, robust and very useful techniques in computational finance. Several studies have investigated ways to achieve greater...
In this paper, we propose a multi-signature scheme, in which each signer can express her intention associating with the message to be signed. Signers' intentions mean a kind o...
This paper proposed an efficient omnidirectional surveillance system for digital home security. In this surveillance system, the omnidirectional scenes in a room, kitchen, car porc...