28 results about "Cuckoo hashing" patented technology

The invention relates to a hidden trace query method, system and device, equipment and a medium. The data party encrypts a value in the first key value pair based on the first key to obtain a second key value pair; the first key is a first hash value of a primary key in a first key value pair calculated by the data party by using a first hash function; the data party stores the second key value pair into the Hash mapping table based on a second Hash function in the cuckoo Hash algorithm; for each second hash function, the query party calculates an index of a query parameter based on the second hash function, and generates a ciphertext query sequence based on the public key and the index; the data party determines first ciphertext response data corresponding to the ciphertext query sequence based on the Hash mapping table; the query party decrypts the first ciphertext response data according to the private key to obtain second ciphertext response data; the query party uses the second secret key to decrypt the second ciphertext response data to obtain a query result; the second key is a second hash value of the query parameter calculated using the first hash function. The method can improve the query efficiency.

The present application provides a batch privacy information acquisition method based on an inadvertent pseudo-random function and a hash function, and belongs to the technical field of privacy information acquisition. Specifically, the method comprises the following steps: S1. A querying party randomly selects four hash functions h1, h2, h3 and H and shares them with a data party; S2. The querying party performs cuckoo hashing on a keyword b corresponding to data to be queried according to the hash functions h1, h2 and h3; S3. The querying party and the data party perform an OPRF protocol; S4. The data party sends an encrypted data corresponding keyword d and a message m to the querying party; and S5. The querying party receives the encrypted data corresponding keyword and the message sent by the data party, and judges whether the message can be successfully decrypted. The present application solves the technical problems of large amount of calculation and non-support of batch retrieval in the prior art, and can transmit messages of any size and any quantity and perform batch privacy information acquisition.

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.

Mechanisms are disclosed for providing an extended private set intersection nested cuckoo hashing scheme for secure computation of private set intersections. A set of outer hash functions and a set of inner hash functions are exchanged between a server and a client. A server outer hash table is populated using an outer hash function in the set of outer hash functions and the set of server items to create a set of server bins. For each server bin in the server outer hash table, server items to be inserted are iteratively placed into a server inner cuckoo hash table using a plurality of inner hash functions corresponding to each server bin, based on determining that a first corresponding hash table position is free.

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 application belongs to the field of data security, and provides a non-balance privacy set intersection calculation method, system, device and medium, which comprises the following steps: a server performs hash mapping and encryption on a service input set to generate a ciphertext double-replacement cuckoo hash table and sends it to a cloud auxiliary server; a client performs hash mapping and encryption on a customer input set to generate a ciphertext virtual-replacement cuckoo hash table and sends it to the cloud auxiliary server; the cloud auxiliary server locates elements to be compared in the ciphertext double-replacement cuckoo hash table according to virtual index information of elements in the ciphertext virtual-replacement cuckoo hash table, and performs homomorphic operation to obtain a ciphertext result and send it to the client; the client decrypts the ciphertext result to obtain a plaintext result set, and determines the intersection according to whether the plaintext result set is equal to zero. The application makes the communication overhead of the client only related to the size of its own data set, and reduces the calculation complexity in the element comparison stage.

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.

A directory management method and system for a file system based on Cuckoo hash are provided, including the steps of reading metadata of a sub-directory or a sub-file, used as a target file, in a directory: receiving a request for reading the target file in the directory; for the target file, determining an ith candidate data block, in a hash table of the directory according to a hash calculation result obtained by performing hash calculation on a filename filename of the target file according to an ith hash function of Cuckoo hash iteratively; if the filename filename of the target file exists in the ith candidate data block, reading metadata of the target file and returning the metadata, and ending the process; otherwise, continuing to iterate until the iteration ends and returning a message that the target file does not exist.

The present invention provides an outsourced data alignment method based on function secret sharing, which is implemented as follows: two users and two servers initialize corresponding parameters; the two users respectively perform hash mapping on their respective sample IDs; the two users encode their respective mapped hash tables; user A performs function secret sharing on the encoded cuckoo hash table, splits the resulting shared key function pair set, and sends the resulting shared key function pair set to the two servers; and the two users and the two servers obtain the results of the outsourced data alignment. The present invention uses function secret sharing to replace the secure comparison circuit in the prior art to obtain the results of the outsourced data alignment, avoiding the defects of the prior art such as excessive communication overhead and asymmetric alignment technology. The data alignment results obtained by the present invention are symmetrical, that is, both participating users can obtain the results of the outsourced data alignment, and the communication overhead is effectively reduced, thereby alleviating the burden on the server.

The application discloses a kind of based on password technology's trusted power transaction clearing method and system, which comprises the following steps: publishing transaction announcement, setting transaction declaration deadline;Electricity buyer and electricity seller generate order-preserving encryption ciphertext C by price order-preserving encryption algorithm encryption declaration price, generate signature sigma with declaration information digest M' and declaration time t, and submit to transaction center;Transaction center summarizes declaration information, verifies the identity of declaration party and the authenticity and reliability of declaration information, and sorts and matches the order-preserving encryption ciphertext C of each declaration party after verification;Transaction center decrypts ciphertext C, determines transaction price, and completes this transaction clearing.The present application, in view of the security risks such as easy leakage of declaration price and tampering of declaration information in the declaration stage of power transaction clearing, based on cuckoo hash algorithm, order-preserving encryption technology, digital timestamp technology and other password technologies, effectively realizes the protection of declaration price privacy and declaration information integrity.

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 invention discloses a data processing method and device for secure computing, a medium, equipment and a product. The participants of the security calculation comprise a first participant and a second participant which respectively hold a first identifier set and a second identifier set, and the method applied to the first participant comprises the following steps: mapping each identifier in the first identifier set into a cuckoo hash table by adopting a plurality of hash functions; decomposing a first tensor formed by elements in the hash table into a tensor product of two low-dimensional tensors; for each column element in the two low-dimensional tensors, performing homomorphic encryption on the SIMD code of the column element to obtain a first ciphertext; the first ciphertext is sent to a second participant, and the second participant is used for generating a second ciphertext according to the second identification set, the multiple hash functions and the first ciphertext and sending the second ciphertext to the first participant; determining an intersection of the two identification sets according to the second ciphertext; and executing a data processing task based on the intersection. The ciphertext generation number and the communication traffic of the first participant and the second participant can be reduced, and the processing efficiency of the data processing task is improved.

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.

The embodiment of the invention provides a privacy information intersection method and computing equipment, in the process that two participants safely carry out privacy information intersection, one party executes cuckoo hash bucket dividing, one bucket corresponds to a single piece of data at most, the other party executes simple hash, each hash value corresponding to one piece of data participates in bucket dividing, and the privacy information intersection efficiency is improved. A simple hash party constructs a data pair by utilizing bucket information formed by each hash value, the bucket identifier and the data fragment, and then the other party performs interpolation query based on the OPPRF protocol by utilizing the hash value of the cuckoo hash so as to obtain the bucket information formed by the bucket identifier and the data fragment. Therefore, the data can be transmitted under the condition that one simple hash party does not acquire any intersection so as to perform joint data processing, and an effective solution is provided for privacy information intersection with conditions or data processing in a secure computing scene of the two parties.

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.

The invention belongs to the field of data security, and provides an unbalanced privacy set intersection calculation method, system and device and a medium, and the method comprises the steps: a server carries out the hash mapping of a service input set, encrypts the service input set to generate a dense state dual replacement cuckoo hash table, and sends the dense state dual replacement cuckoo hash table to a cloud auxiliary server; the client carries out Hash mapping on the client input set, encrypts the client input set to generate a secret state virtual replacement cuckoo Hash table and sends the secret state virtual replacement cuckoo Hash table to the cloud auxiliary server; the cloud auxiliary server locates elements needing to be compared in the secret state double replacement cuckoo hash table according to the virtual index information of the elements in the secret state virtual replacement cuckoo hash table, performs homomorphic operation, obtains a ciphertext result and sends the ciphertext result to the client; and the client decrypts the ciphertext result to obtain a plaintext result set, and determines an intersection according to whether the plaintext result set is equal to zero or not. According to the method, the communication overhead of the client is only related to the data set scale of the client, and the calculation complexity of an element comparison stage is reduced.

The invention discloses a Hash table management method, device and equipment based on a hierarchical cache queue, and relates to the technical field of caches, the method comprises the following steps: obtaining data index information of a to-be-inserted data item; according to the data index information, n preset hash functions of a cuckoo hash algorithm are utilized to calculate n hash table items corresponding to the to-be-inserted data item; if the corresponding mapping information is stored in each of the n hash table items, determining a target hash table item according to the information of the hierarchical cache queue where the data item corresponding to each piece of mapping information is located; the mapping information stored in the target hash table item is kicked out, and the mapping information corresponding to the to-be-inserted data item is stored in the target hash table item; according to the invention, when the newly inserted hash table item has the candidate position conflict, the candidate position to be kicked out can be selected according to the hierarchical information of the hierarchical cache queue where the data item corresponding to the candidate position is located, so that the situation that the mapping information of the hot data is kicked out from the hash table is reduced, and the access delay of the hot data is reduced.

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 present application relates to an open address hash table, and relates to an open address lock-free hash table maintenance system based on random atomic protection, so as to improve the multi-core processing efficiency of the open address hash table based on lock-free concurrent control under the premise of guaranteeing that the worst complexity of the open address hash table is O(1) by using a lock-free method; the present application is directed to a general open address hash table, namely Cuckoo hashing, and a general open address hash table suitable for multiple slots is given, so as to safely protect the data validity of the element kicking-out process in the twin bucket and the efficiency of the slot use in a lock-free manner; the patent introduces a safe and reliable memory release protection mechanism, and a lock-free open hash memory key value storage system with high efficiency and reliability is given, so as to effectively improve the problem of insufficient concurrent acceleration ability of the existing open address storage system based on the lock mechanism in a multi-core environment.

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 present application relates to an efficient and scalable method and apparatus for intersecting multi-party private sets that resist collusion. The method comprises: mapping the hash value of each element in the private set of a central participant to the corresponding position in a cuckoo graph to obtain the central participant's obfuscated cuckoo hash table; constructing a secret sharing share, a secret sharing obfuscated cuckoo hash table, and sending a copy of the secret sharing share to the other participants; constructing the obfuscated cuckoo hash tables of the other participants based on their private sets and secret sharing shares, and sequentially transferring and calculating the obfuscated cuckoo hash tables of the other participants based on a preset communication structure and a preset query calculation strategy, and outputting the intersection result through interaction between a preset target participant and the central participant. This method solves the problems of low efficiency, weak functional scalability, and poor anti-collusion capability in the existing technology for intersecting multi-party private sets in the field of secure multi-party computation.

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.