15 results about "Cuckoo hashing" patented technology

The application provides a method for DNA sequencing by pigeon hash growth tree splicing and a computer readable medium. The application acquires a reads library, determines the length of a pigeon hash table to construct the pigeon hash table, and numbers the reads in the reads library; the head of each read and the tail of each read are obtained through row division fragment processing; each read of the reads library is stored in the pigeon hash table through iterative replacement storage; splicing growth is determined in combination with the pigeon hash table, information of the reads in the splicing growth process is stored in a dynamic pigeon hash table in combination with the position of the successfully matched read head, and DNA sequencing is realized through iterative execution of growth of the growth tree. The application expands when the size of the hash table is insufficient, thereby saving space resources. The application is suitable for DNA splicing sequencing engineering.

The application discloses a local file system management method, electronic equipment and a readable storage medium, relates to the technical field of file management, each object in the local file system comprises a plurality of file storage areas storing index node data, target file metadata of a target file is stored in a file storage area corresponding to idle index node data obtained based on an idle index node queue, and a target directory entry is constructed according to a target file name, a target file type and a target index node number; a target object corresponding to the target file name is determined based on a linear hash function; if the target file name cannot be found in the target object based on a multi-path cuckoo hash function, and no directory entry slot in an idle state exists in the target object, the target object is split based on the linear hash function to create an idle directory entry slot required to be inserted in the target object. The application solves the problem of poor expansion convenience of the local file system in the cloud storage environment.

The embodiment of the invention provides a two-party database JOIN operation method and system based on Circuit-PSI, and belongs to the technical field of computers. The method comprises the following steps: appointing a plurality of hash functions and a cuckoo hash table; the two participants respectively execute cuckoo hash calculation and multi-function hash calculation on key columns of respective data tables to obtain corresponding filling tables and mapping results; based on the filling table and the mapping result, a batch programmable pseudo-random function protocol and a security comparison protocol in the Circuit-PSI protocol are operated, and a secret sharing numerical value column corresponding to the key in the intersection is obtained; and on the basis of taking the identification column as a control signal, respectively executing two-way selection operation in secure multi-party calculation on each row of the secret shared value column to form a JOIN result table. According to the scheme, intersection judgment and result splicing of the data tables of the two parties are efficiently completed under the privacy protection condition, original data leakage is avoided, and calculation and communication overhead brought by complex cryptography operation is reduced.

The invention discloses a data operation method, device and equipment and a computer readable storage medium, and is applied to the technical field of data processing, and the method comprises the steps: determining an expelled data item obtained when a data insertion operation is executed based on a cuckoo hash algorithm; writing the evicted data item into an idle position of the additional storage module; and when it is determined that the data operation is in the idle period, performing a reinsertion operation on the evicted data items. Compared with the situation that the current repelled data item does not exist at any position of the hash table and the repelled data item is in a free state, the method has the advantages that the data item to be repelled is determined, so that the repelled data item is written into the idle position of the additional storage module, the repelled data item is prevented from being lost, and the data storage efficiency is improved. And the write-in operation can be executed again on the expelled data items subsequently.

The invention relates to the field of data management, and provides an off-chip one-time access management method and device for satellite-borne router key value storage, and the method comprises the steps: deploying a first cuckoo hash table in an on-chip memory of a satellite-borne router; deploying a second cuckoo hash table in an off-chip memory of the satellite-borne router; wherein the first cuckoo hash table is used for storing fingerprints of keys; the second cuckoo hash table is used for storing complete key value pairs; each fingerprint in the first cuckoo hash table is in one-to-one correspondence with a key value pair at the same index position in the second cuckoo hash table. The problem that high-load key value storage and low off-chip memory access times cannot be obtained at the same time in the prior art is solved, and it is ensured that only one off-chip memory access is needed for each key value operation while the high load rate is kept.

The embodiment of the present specification provides a method and a computing device for privacy information intersection. In the process of privacy information intersection between two participants, one party performs cuckoo hashing bucketing, and one bucket corresponds to at most one piece of data. The other party performs simple hashing, and each hash value corresponding to one piece of data participates in the bucketing. The party with simple hashing constructs a data pair by using each hash value, a bucket identifier and data fragments to form bucket information. Then, the other party performs interpolation query based on the OPPRF protocol by using the hash value of the cuckoo hashing, so as to obtain the bucket information formed by the bucket identifier and the data fragments. In this way, the party with simple hashing can deliver data for joint data processing without obtaining any intersection. The privacy information intersection with conditional or incidental data processing in the two-party secure computing scenario provides an effective solution.

The application discloses a large-scale DNS passive flow query and response alignment method, which comprises the following steps: constructing a packet cache structure of an in-memory pool-hash pool-hash table, and completing DNS passive flow query and response alignment according to the packet cache structure; wherein the in-memory pool is a pre-applied memory segment, the head of the corresponding memory segment is the relevant information of the in-memory pool, and the memory of n pre-applied and pre-set structure bodies is arranged after the head; the hash pool is a pre-applied memory segment, the head of the corresponding memory segment is the relevant information of the hash pool, n pointers are arranged after the head, and the pointers are initialized as null, being an empty list with a size of n; and the hash table is a hash table using a cuckoo hash algorithm. The application solves the problem of packet cache difficulty in large-scale DNS passive monitoring flow query and response alignment.

The application relates to a high-performance hardware deep packet detection method and device based on a heterogeneous pipeline, which comprises the following steps: clustering and bucketing a rule set to be detected at a software end, generating an XOR retrieval table, an NSSO mask table and a cuckoo hash table configuration; adopting a three-stage pipeline processing architecture at a hardware end: a first stage uses a parallel hash array to extract a data fingerprint, carries out linear-speed preliminary screening through an XOR retriever and outputs a rule bucket activation token; a second stage dynamically activates a matching engine in response to the token, adopts an NSSO algorithm based on a bit slicing architecture, and updates a matching state through a parallel index high-low mask subtable; and a third stage uses a cuckoo hash index to cooperate with a hierarchical storage strategy to quickly check short rules on a chip and accurately verify long rules by reading external memory through a DMA mechanism. The application gradually unloads traffic pressure through multiple levels of logic, effectively solving the problems of storage bottlenecks, port conflicts and power consumption faced by large-scale rule matching in a high-speed network environment.

The invention relates to the technical field of privacy calculation, in particular to a privacy set intersection method and system for differential privacy protection, and the method comprises the steps: carrying out the data pre-distribution processing of the data of two participants through a simple hash table and a cuckoo hash table; generating a virtual data filling number and input distribution information of fuzzy participants based on a differential privacy mode; the participants execute the casual pseudo-random function protocol, and the original data of the participants are prevented from being inferred based on a random mask generated by the casual pseudo-random function protocol; after input distribution information of participants is fuzzified by generating a virtual data filling number based on a differential privacy mode, the two participants compare an intersection of data random masks in the two hash tables according to the granularity of buckets, and an original data intersection of the two parties is obtained. The method provided by the invention can ensure that each participant does not leak any other information except the intersection data while obtaining the intersection, thereby improving the intersection calculation efficiency and reducing the calculation and communication overhead at the same time.

A method, device, and system with processing-in-memory (PIM)-based hash querying. A method includes, by a processing-in-memory (PIM) device, generating, corresponding to a query instruction to the PIM device from a processor exterior to the PIM device, location index indication information for a key based on a cuckoo hash table, the key, identification information of a bucket to which the key belongs, and an index vector, respectively obtained or provided from one or more devices exterior to the PIM device, and outputting the generated location index indication information for the processor to obtain the value corresponding to the key dependent on the output location index indication information, where the bucket is one of a plurality of buckets, of the cuckoo hash table, for each of which corresponding two or more keys respectively belong.

This invention presents a personalized location association privacy protection method based on dynamic selection, addressing the limitations of personalized performance improvement and the lack of privacy protection for parameter locations. Implementation includes: initializing and generating a private key; local training with dynamic parameter location selection; client uploading shared parameters and generating anonymous identifiers; server aggregating and distributing parameters based on a hash table; and updating the local model. This invention improves the personalized performance of the model through a dynamic parameter selection mechanism, protects the privacy of personalized parameter locations through an anonymous identifier mechanism, and utilizes cuckoo hashing for efficient storage and secure aggregation. This invention does not introduce complex cryptographic calculations, achieves personalized parameter location privacy protection, and enhances personalized performance, privacy protection capabilities, and scalability. While ensuring data and parameter location privacy and security, it achieves efficient and scalable personalized federated learning. It has applications in healthcare, finance, smart terminals, and the Internet of Things.

The application discloses a batch privacy information retrieval method and device, and the method comprises the following steps: a client and a server agree on a hash function, the serial number index in an original database is calculated through a cuckoo hash technology, the result of each serial number index for each hash function is reserved, and a first hash bucket containing a plurality of baskets is obtained; the client fills the index of batch query into a second hash bucket with the same length as the first hash bucket through the cuckoo hash algorithm, and the filling result is encoded in a manner of using a fixed weight code for coding; the client encrypts the obtained coding result by using a homomorphic encryption technology as a batch query request; the server compares the batch query request with the first hash bucket by using the homomorphic encryption technology, obtains a corresponding intermediate result, performs corresponding calculation on the intermediate result and the original database, and obtains corresponding query result ciphertext; and the client decrypts the query result ciphertext, so that the query result of the batch query request is obtained.

The application discloses a FPGA packet classification method and system based on a heterogeneous hybrid path, and the method comprises the following steps: receiving a network data packet, extracting metadata and temporarily storing the network data packet; constructing a key value according to the metadata of the network data packet, performing fast path lookup and processing based on the constructed key value K through a cuckoo hash to obtain a fast path result, activating a slow path matching and learning to perform rule matching through a ternary content-addressable memory to obtain a slow path result if the fast path is not hit; aligning and arbitrating the fast path result and the slow path result to obtain a final action, and sending the temporarily stored network data packet to a downstream or discarding the temporarily stored network data packet. The application aims to solve the problems of large resource consumption, high power consumption, inability of a hash table to handle conflicts, easy packet loss in rule updating and disorder in multi-path processing in the existing packet classification technology, and realizes FPGA packet classification with high performance, low power consumption, high flexibility and support for lossless hot updating.

The invention discloses a P2FR-PSI and homomorphic encryption-based longitudinal federated learning model training method. The method executed at a sender side comprises the steps of constructing a cuckoo hash table according to a local first user identifier of a sender and a corresponding feature vector; executing a privacy set intersection S3R protocol with a receiver based on a cuckoo hash table and a predicate condition to obtain a first secret sharing vector; generating a first set of encryption masks based on the first secret sharing vector and the first user identification in the cuckoo hash table using the first private key; processing a second group of encryption masks sent by the receiver based on the first private key to obtain a first processing result; obtaining a second processing result returned by the receiver, and determining an intersection user set in combination with the first processing result; and updating local first model parameters of the sender based on the intersection user set and a homomorphic encryption technology. According to the method, the flexibility of data alignment, the accuracy of VFL model training and the applicability of the VFL model in a complex recommendation scene are improved.