Secure Nearest Neighbor Query Method and System Based on Minimal Redundancy Partition and Random Number
A minimum redundancy and random number technology, applied in the direction of digital data protection, electronic digital data processing, special data processing applications, etc., can solve problems such as easy to be successfully attacked
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0044] In order to make the above objects, features and advantages of the present invention more comprehensible, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0045] With the increasing popularity of the concept of "cloud computing" and its applications, more and more attention has been paid to the "security query problem" for the encrypted data set E(D) on the "cloud". The present invention conducts a relatively in-depth study on the "secure nearest neighbor" (SNN) problem; this problem involves the data owner, data user (client) and server (server). The query ciphertext (encrypted query, E(q)) will be sent to the server to obtain the ciphertext of the nearest data point (that is, "nearest neighbor") of the query point in E(D), but it must be ensured that the server cannot know the data and The specific content of the query. Specifically, the SNN problem involves the three parties of ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 