Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Counts

In this paper we study the problem of mining support counts using symmetric-key crypto which is moreefficient than previous work.Consider ascenario that each user has an option (like or unlike) ofthespecified product, and a third party wants to obtain thepopularity of this product. We design a much moreefficient privacy-preserving scheme for users to prevent theloss of the personal interests. Unlike mostprevious works, we do notuseany exponentialor modularalgorithms, but we provide a symmetric-keybased method which can also protect the information.Specifically, our protocol uses a third party thatgenerates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which ismore efficient to obtain the support counts of a given pattern