Private data processing method and computing device

By corresponding to the hash value of the privacy data with the vertices in the undirected graph and using the degree of the vertices to determine the hash value, the problem of the insufficiency of the cuckoo hash algorithm in large-scale scenarios is solved, and efficient privacy data processing is achieved.

CN119720266APending Publication Date: 2025-03-28ANT BLOCKCHAIN TECHNOLOGY (SHANGHAI) CO LTD
0 Cites 1 Cited by

Patent Information

Application Number
CN202411549423.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-31
Publication Date
2025-03-28

AI Technical Summary

Technical Problem

The cuckoo hash algorithm is natural serial computing and cannot be directly expanded into a parallel algorithm, resulting in the lack of scalability in large-scale scenarios, affecting the efficiency of privacy data processing.

Method used

The hash value of the privacy data in the hash table is determined based on the degrees of each vertex by corresponding the hash value of the privacy data to the vertices in the undirected graph and the privacy data itself to the edges between the vertices. Multiple steps in this method can be performed in parallel, improving processing efficiency.

Benefits of technology

Through parallel processing steps, the efficiency of determining the hash value of privacy data is significantly improved, and the problem of insufficiency of the cuckoo hash algorithm in large-scale scenarios is solved.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

A privacy data processing method and computing device, the method comprising: obtaining n hash values corresponding to m privacy data, the n hash values being obtained based on two hash functions, each privacy data corresponding to two hash values in the n hash values; enabling the n hash values to correspond to n vertexes, enabling each piece of privacy data to correspond to an edge between the corresponding vertex, and determining the degree of each vertex; according to the degree of each vertex, a first hash value of each privacy data in the hash table is determined, and each first hash value is used as a data identifier of the privacy data corresponding to the first hash value.
Need to check novelty before this filing date? Find Prior Art