Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

65 results about "Hash tree" patented technology

In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its basic form, a hash tree stores the hashes of its keys, regarded as strings of bits, in a trie, with the actual keys and (optional) values stored at the trie's "final" nodes.

Compact recordation protocol

A method for efficiently storing and verifying records is disclosed. The method may comprise receiving a first hash of first interaction data and determining an interaction identifier associated with the first hash, then storing the first hash in a database along with the interaction identifier and determining a root hash of a hash tree. In addition, the method may also comprise providing the root hash of the hash tree to a public blockchain. Embodiments of the invention also allow users to easily present records to a third party or inquiring entity. Furthermore, interactions may be processed more quickly than previous blockchain methods that publish to a block during each individual interaction.
Owner:VISA INT SERVICE ASSOC

Data processing method and device based on block chain, terminal and storage medium

The invention provides a data processing method based on a block chain. The data processing method comprises the steps that a block chain system receives a transaction request; the blockchain system generates a transaction contract and transmits the transaction contract to both transaction parties; after the blockchain system detects that the two transaction parties sign the transaction contract,the blockchain system confirms that the transaction is completed and writes transaction information into the blockchain system; the enterprise data processing terminal obtains transaction informationfrom the block chain system and obtains preset transaction data; the enterprise data processing terminal uploads the financial data to the block chain system according to the determined financial data; the block chain system assembles the financial data in the form of a Hash tree and returns a Hash value to the tax node; and the tax node acquires financial data according to the Hash value. The invention further provides a data processing device based on the block chain, a terminal and a storage medium. By utilizing the embodiment of the invention, for one piece of transaction information, theaccounting operation is automatically completed, the accounting efficiency is improved, a manual account checking link is not needed, wrong records are reduced, and the auditing difficulty is reduced.
Owner:CHINA PING AN PROPERTY INSURANCE CO LTD

Request processing method and device, computer readable storage medium and electronic equipment

The invention provides a request processing method and device, a computer readable storage medium and electronic equipment, and belongs to the technical field of computers. The method comprises the steps: when request information is received, acquiring a target hash tree of a service cluster, wherein the score of each service node in the target hash tree is related to the operation information of the service node; traversing the target hash tree, and querying target service nodes with scores meeting score requirements; and sending the request information to the target service node for processing. According to the scheme, the request information is distributed through the Hash tree obtained by calculating the scores of the service nodes based on the Hash algorithm, under the condition that individual service nodes are unavailable, only the service nodes and the corresponding sub-nodes can be influenced, and the whole Hash tree does not need to be reconstructed, so that the time for updating a downstream list is shortened, and in addition, due to the fact that no virtual node exists, the data processing amount needed by query of the service node during request processing is reduced, and the request processing efficiency is improved.
Owner:BIGO TECH PTE LTD

Intelligent Internet of Vehicles credible data encryption method and system based on block chain

The invention discloses an intelligent Internet of Vehicles credible data encryption method and system based on a block chain, and designs a privacy protection method with low power consumption and credible data integrity verification by adopting Merkle-hash authentication in the block chain and a homomorphic encryption technology of an elliptic curve. On one hand, the distributed characteristicsof the Merkle-hash tree are adopted to achieve integrity verification of the Internet of Vehicles trusted data and the function of positioning the wrong vehicle intelligent terminal; on the other hand, a homomorphic encryption technology based on an elliptic curve is adopted to map data transmitted by the vehicle intelligent terminal into encrypted data points, so that lower energy consumption isrealized, and encryption from the vehicle terminal to the vehicle terminal is realized. The method has the advantages of high confidentiality, low calculation amount and low communication traffic overhead, can meet the requirements of the Internet of Vehicles for trusted data security and transmission delay, and is suitable for large-scale Internet of Vehicles intelligent terminal data transmission and instant messaging.
Owner:HUAQIAO UNIVERSITY +1

Dynamic social outsourcing data keyword query and verification method and device based on block chain

The invention discloses a dynamic social outsourcing data keyword query and verification method based on a block chain, and the method comprises the steps that an OSN operator outsources social data to a data provider, and the data provider provides data for a data consumer; the OSN operator constructs an auxiliary information block chain network and issues auxiliary information to the auxiliary information block chain network, wherein the auxiliary information block chain network constructs a block chain by nodes in an auxiliary information block chain; the data consumer verifies the authenticity of the query data through the auxiliary information block chain. The invention provides an efficient self-balancing Merkle hash tree data structure. The dynamic change of social data is supported, an updating algorithm supporting a self-balancing Merkle hash tree data structure is provided, a data consumer is allowed to efficiently check the authenticity of a queried data result, the decentralization of stored auxiliary information is realized, and the safety of the stored auxiliary information is improved; according to the invention, the social data is allowed to change dynamically, andthe expandability of the system is improved.
Owner:CENT SOUTH UNIV

Anti-replay method for radio frequency identification system based on time slot ALOHA protocol of frame

The invention discloses an anti-replay method for a radio frequency identification system based on a frame time slot ALOHA protocol. The anti-replay method mainly comprises an electronic product code (EPC) sequence extraction part and an EPC sequence search part. According to the technical scheme, in a multi-tag radio frequency identification system, the EPC reading sequence of all tags in a round of tag identification is extracted, and the obtained EPC sequence is processed to obtain a Hash EPC and then stored in a Hash tree. Once the Hash EPC extracted in a new radio frequency identification session is found to exist in the Hash tree, the new radio frequency identification session will be considered as a replay attack and denied. Compared with an existing anti-replay method of a radio frequency system, the anti-replay method does not need to specially design a random noise sequence, the randomness of a frame-based time slot ALOHA protocol is directly used for defending the replay attack, any original signal is not changed, the situation that the received backscattering signal cannot be decoded due to distortion of the signal caused by external environment change is avoided, and the method can be deployed and applied to any multi-tag radio frequency identification system.
Owner:ZHEJIANG UNIV

Cloud storage data security deduplication method based on block chain

The invention discloses a cloud storage data security deduplication method based on a block chain. The method comprises the following steps: sending a generated file label to a cloud storage service provider for repeatability detection; if the result is file repetition, enabling the user to generate a file repetition storage log, executing the intelligent contract through the intelligent contract management center to integrate the storage log into a transaction and uploading the transaction to the block chain for storage, so that the current storage state information is safely stored; if the result is that the file is not repeated, enabling the secret key server to generate an authority secret key of the user by constructing a role hierarchical hash tree, executing safe encryption operation on the data by using the authority secret key, and uploading a ciphertext to the cloud storage server for storage; and generating a file non-repeated storage log and transaction under the assistance of the intelligent contract management center. According to the method, data security deduplication and storage of the cloud user can be achieved, malicious behaviors of stealing and tampering of a cloud storage service provider are resisted, the computing overhead of the cloud storage server is greatly reduced, and the privacy security is ensured.
Owner:GUANGDONG UNIV OF TECH

Data processing method and device, computer equipment and storage medium

The invention relates to a data processing method and device, computer equipment and a storage medium. The method comprises the following steps: enabling a terminal to send a data reading request; according to a storage file corresponding to the data reading request, selecting a verification data block through a random algorithm; acquiring a target hash tree corresponding to the storage file, wherein the target hash tree comprises data from a layer where a root node is located to an M-th layer, M is a positive integer, a first hash value is stored in the root node, and each leaf node corresponds to a data block of the storage file; calculating a second hash value corresponding to a root node of the target hash tree according to the verification data block and the target hash tree; and if the first hash value is the same as the second hash value, returning data corresponding to the data reading request in the storage file to the terminal. According to the method, the authenticity of the storage file is verified by randomly selecting the verification data block, so that the storage pressure of the CDN node can be reduced, the verification calculation complexity is reduced, and the verification efficiency of the security of the data requested to be read by a user is greatly improved.
Owner:深圳市名竹科技有限公司

Local sensitive hash-based adaptive random test method

The invention discloses a local sensitive hash-based adaptive random test method. The method comprises the steps of 1, determining an input domain range; 2, randomly generating a first test case in the input domain and executing the first test case; 3, randomly generating k candidate test cases to form a candidate test case set; 4, selecting a next test case by adopting FSCS-ART, executing the next test case and inserting the next test case into the hash tree; and 5, repeatedly executing the steps 3 and 4 until m executed test cases are obtained or errors are found. 6, randomly generating k candidate test cases to form a candidate test case set; and 7, selecting a next test case by adopting an improved locality sensitive hash algorithm, executing and inserting the next test case into the hash tree. And repeating the steps 6 and 7 until a program error is found. Compared with the existing FSCS-ART, the LSH-ART provided by the invention has the advantages that in performance, the LSH-ARTis slightly similar to the FSCS-ART in low dimension, but the LSH-ART is better than the FSCS-ART in high dimension; in terms of time expenditure, the LSH-ART is less than the FSCS-ART in both low dimension and high dimension, and particularly, the time expenditure of the LSH-ART is even less than 10% of the time expenditure of the FSCS-ART under low failure rate.
Owner:JIANGSU UNIV

A method and device for deduplication of encrypted files based on hybrid cloud storage

The invention discloses an encrypted file deduplication method based on hybrid cloud storage, which is applied to a private cloud, including: receiving an upload request from a target user for uploading a target file to a public cloud; and calculating the target file according to the user permission set of the target user The deduplication label set of the file; when it is determined that the target file does not exist on the public cloud, calculate the permission label set of the target file according to the access restriction permission set of the target file; combine the permission label set of the target file with the Merkle Ha The encryption key calculated by Xishu is sent to the target user, so that the target user can use the encryption key to encrypt the target file, and upload the ciphertext and permission label set of the target file to the public cloud. Applying the technical solutions provided by the embodiments of the present invention ensures that duplicate files to be uploaded by users to the public cloud can be detected, thereby improving file security. The invention also discloses an encrypted file deduplication device based on hybrid cloud storage, which has corresponding technical effects.
Owner:GUANGDONG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products