Abstract
In this paper we study the problem of mining support counts using symmetric -key crypto which is more efficient than previous work. Consider a scenario that each user has an option (like or unlike ) of the specified product, and a third party wants to obtain thepopularity of this product. We design a much more efficient privacy-preserving scheme for users to prevent theloss of the personal interests. Unlike most previous works, we do not use any exponential or modular algorithms, but we provide a symmetric -key based method which can also protect the information.Specifically, our protocol uses a third party that generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is more efficient to obtain the support counts o f a given pattern.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
