73 results about "Hash tree" patented technology

The invention relates to the field of data query, and particularly provides a medical big data query method and system based on dynamic desensitization, a terminal and a medium, and the method comprises the steps: collecting multi-source heterogeneous medical data, carrying out semantic normalization, constructing a unique identifier of a patient, and generating standardized intermediate plaintext data; constructing an adaptive isomorphic index structure based on the data, constructing a semantic hash B + tree index for structured data, constructing a feature vector index for unstructured data, and dynamically optimizing index hierarchy and parameters according to access frequency; and after a query request is received, the permission context is analyzed, intermediate plaintext data is positioned and read by using the index, and a differential privacy protection strategy is dynamically applied according to the access permission. According to the method, the problem of balance between privacy protection and data effectiveness as well as between retrieval efficiency and storage cost in medical data processing is effectively solved, and data availability and access performance are improved while safety compliance is guaranteed.

The invention discloses a secure transmission system based on a multimedia short message, and relates to the technical field of communication and network security, and the system comprises a protocol stack security reinforcement module which carries out the hierarchical reconstruction of an MMS protocol stack, comprises a preprocessing layer, is used for intercepting and filtering illegal characters, and verifies the legality of a message structure through a finite-state machine; the analysis layer is used for pre-judging memory requirements based on message types and lengths by adopting a dynamic memory allocation strategy; the execution layer is integrated with a null pointer checking mechanism, and the validity of a pointer is forcibly verified before a protocol stack calls a function; the encryption and signature module is used for carrying out end-to-end encryption on a message body and metadata by adopting a hybrid encryption algorithm and carrying out message integrity verification through a lightweight hash tree; and the vulnerability real-time monitoring module is embedded into an abnormal behavior detection model based on machine learning and is used for dynamically identifying memory occupation abnormity and illegal instruction calling high-risk operation when the protocol stack runs.

The invention discloses an energy big data right confirmation method and system based on a hierarchical hash tree and dynamic authorization, and belongs to the field of energy big data management and information security, and the method comprises the steps: obtaining and standardizing original data in an energy scene, and dividing the original data into a data block set according to equipment and time; constructing a hierarchical hash tree and generating root hash; writing the root hash and the associated metadata into the block chain to realize right confirmation and evidence storage; executing proxy re-encryption according to the access token, and converting the ciphertext into a decryptable format; verifying the data consistency through the Hash path and the root Hash, and completing the access; and recording the access behavior and distributing transaction earnings by the smart contract based on the contribution degree. Hash calculation and local path updating of a data block level are supported through a layered Hash tree structure, so that when large-scale energy data is frequently updated, a new root Hash value can be quickly generated and right confirmation updating can be completed only by carrying out local Hash recalculation on a changed path.

The invention relates to the technical field of distributed data processing systems, and discloses a data processing system supporting full localization deployment and a compliance guarantee method thereof.The data processing system supporting full localization deployment comprises an audit event collection module used for collecting and storing processing event hash; the event organization module is used for realizing logic time sequence management of events through topological sorting and causal relationship marking; the hash chain construction module is used for constructing a local-to-global double-layer hash chain by utilizing the constructed directed acyclic graph and event hash; the increment synchronization module is used for executing increment synchronization based on Hash tree difference identification; the conflict solving module is used for detecting and solving event conflicts in the distributed environment by applying a version vector technology aiming at data differences found in the incremental synchronization process; according to the method, the lightweight linear hash chain is used for replacing a traditional binary tree structure, high-efficiency and low-cost audit chain maintenance is realized, and the data integrity is guaranteed in an unstable network environment.

Techniques for signing internet data are disclosed. The techniques include accessing a plurality of internet data records. The techniques also include generating, using at least one electronic processor, leaf nodes from the plurality of internet data records, and constructing a recursive hash tree from the plurality of leaf nodes. The techniques also include deriving information sufficient to validate the root node, and publishing, in an internet public key infrastructure (PKI) as a synthesized public key, the information sufficient to validate the root node. The techniques also include providing, through the internet and as a signature on at least one of the plurality of internet data records, validation data including sibling path data from the recursive hash tree, such that an internet client validates the at least one of the internet data records using at least the validation data and the synthesized public key.

The invention relates to the technical field of medical information security, in particular to a security guarantee method and system in a medical data interaction process, and the method comprises the steps: firstly carrying out the read-only solidification and disk encryption of data, and building a fingerprint hash tree; zero-knowledge proof and dynamic privacy budget are generated according to strategies such as purposes and calling times, and semantic vectors are obtained through encoding and signed into a revocation chain; the algorithm is divided into linear, nonlinear and pulse sub-graphs in a credible environment, three-domain ciphertext calculation is carried out, Laplace noise is injected into pulse output according to budget and then fusion is carried out, and a re-linearization key is derived; a hypergraph commitment is generated based on a fused ciphertext, a semantic vector and a key drive delay function are utilized to take a random value and a proof, a composite commitment is obtained through a threshold signature and a random bit sequence, cross-chain evidence storage with root hash is carried out, and differential privacy and long-term auditing are realized.

The invention is suitable for the technical field of text management, and particularly relates to a security processing method and system for big data, and the method comprises the steps: setting a plurality of common characters, selecting text data needing to be subjected to security processing, traversing the first appearance position of each common character, calculating the character bit order, integrating all the character bit orders, and carrying out security processing on the text data. Generating identifiers, wherein each piece of text data corresponds to one identifier; the method comprises the following steps: creating text data, creating child nodes in one-to-one correspondence with the text data, writing identifiers into the child nodes, selecting a hash function, performing pairwise hash on adjacent child nodes to obtain a plurality of first hash values, creating a plurality of levels of father nodes, writing the first hash values into the father nodes, and mounting the corresponding child nodes into the father nodes. By intercepting the state snapshot, lightweight storage can be carried out on the Hash tree, the storage burden is further reduced, and the safety processing efficiency and tamper-proofing capability of the text data are greatly improved.

The invention discloses a firmware upgrading system and method, electronic equipment, a storage medium and a program product, and relates to the technical field of server hardware management.The system comprises a firmware issuing end used for conducting block encryption processing on target upgrading firmware so as to generate a hash tree, conducting signature on a root hash value of the hash tree based on a root layer private key, generating first signature data and sending the first signature data to a server; storing a root layer private key; the firmware supervision end is used for generating second signature data by using the intermediate layer private key and storing the intermediate layer private key; the firmware use end is used for generating third signature data by using the leaf layer private key and storing the leaf layer private key; the firmware publishing end writes a data packet formed by the first signature data, the second signature data, the third signature data and the root hash value into the block chain; and the firmware using end verifies the data packet, and if the verification is passed, firmware upgrading is carried out. The technical problem of relatively low security of a firmware upgrading mode in related technologies is solved, and the technical effect of improving the firmware upgrading security is achieved.

The invention discloses an augmented reality inspection method and device based on a building information model, and a medium. The method comprises the following steps: converting the building information model into a BIM conditional Gaussian point field and a semantic signed distance field, and collecting multi-source heterogeneous sensor data; constructing a joint optimization factor graph, calculating a current camera pose estimation value and a covariance matrix, and monitoring numerical values of a projection edge consistency residual error and an SDF distance residual error in real time; according to the uncertainty degree of pose estimation, the transparency and the shielding effect of augmented reality rendering content are dynamically adjusted, and when it is monitored that the alignment error of a local area exceeds a threshold value and the pose covariance is lower than the threshold value, local non-rigid deformation adjustment based on engineering tolerance constraint is triggered; generating a signature visual residual proof and carrying out digital signature and timestamp authentication; and mapping the signature visual residual proof to a pre-constructed hash tree to calculate a root hash value, and storing the root hash value and the digital signature to the block chain.

The application discloses a kind of zero job platform multi-tenant authority hierarchical access control processing methods, specifically related to computer network and information security technical field, for solving the difficulty of cross-domain access under multi-tenant cooperation to consider isolation, dynamic authorization and tamper-proof archiving;By responding to the cross-domain collaborative matching event triggered by the first tenant and the second tenant for the target user, the minimum set attribute data is extracted and the target shadow entity is generated in the second tenant, the entity binding message is output to the API gateway layer, and the first permission policy token is generated and issued around the life cycle state vector, the global permission fuse is triggered at the archiving lock node, the identification and rollback cleaning of the to-be-tested cross-domain concurrent write request are identified and rolled back, the pre-archiving cache area is formed and the final state shadow entity is obtained, and then a data digest hash tree is generated based on the cross-domain interaction data, a digital signature is received and a three-party signature consensus verification is performed, and a legal release voucher and a right-confirmation archiving load are output.

Systems and techniques are provided for a booting a container. For instance, a process can include obtaining, from a first verified boot metadata partition of a host operating system, a first public key associated with a container; verifying a second verified boot metadata partition of the container using the first public key, wherein the second verified boot metadata partition of the container is signed using a first private key corresponding to the first public key associated with the container; accessing the second verified boot metadata partition of the container to obtain a first hash tree for a first file system of the container; and verifying the first file system of the container based on the first hash tree for the first file system of the container.

A computer-implemented method for implementing data storage verification, where the method comprises: obtaining a plurality of data blocks, where the plurality of data blocks together represent data items to be stored by one or more respective second parties; for each respective second party, generating a respective hash root of a respective hash tree based on a respective set of data blocks of the plurality of data blocks, where each respective data block in the respective set of data blocks is used to generate a respective leaf hash of the respective hash tree; for each corresponding second party, submitting a corresponding request transaction to one or more blockchain nodes of the blockchain network; wherein the respective request transaction is a blockchain transaction configured to require a respective response transaction to include a respective hash attestation of a respective leaf hash of the respective hash tree.

The invention provides a safe starting method and system for a vehicle-mounted terminal, electronic equipment and a storage medium, and the method comprises the steps: verifying whether an external bootstrap program, a starting bootstrap program and a system kernel of a system-on-chip are tampered or not through a first digest value in a one-time programmable memory of the system-on-chip and a mirror image file in a storage region; if all the contents are not tampered, verifying whether the firmware of the MCU is tampered or not by using the mirror image file; if the firmware of the MCU is not tampered, starting the MCU; verifying whether the file system and the application program of the system-on-chip are tampered or not by utilizing the hash tree of the mirror image file; and if the file system and the application program of the system-on-chip are not tampered, starting the file system and the application program of the system-on-chip to complete starting of the system-on-chip. According to the scheme, whether firmware of the system-on-chip and the MCU is tampered or not is detected on the basis of the system-on-chip with the one-time programmable memory, and then safe starting of the system-on-chip and the MCU is achieved.

Disclosed herein are computer-implemented methods of, and computer systems for, constructing dual cryptographic proofs for transactions where transaction data is stored in a cryptographically-linked data file and in an incremental hash tree, where a dual cryptographic proof includes linear cryptographic proof data from the cryptographically-linked transaction file and binary cryptographic proof data from the incremental hash tree. The transaction may include one or more key-value pairs.

The present application relates to the technical field of computers, and particularly relates to a triangle counting implementation method and apparatus for a graphics processing unit (GPU). The method comprises: acquiring graphics data of a GPU; identifying neighbor lists of all vertices in the graphics data, constructing hash trees in a lock-free manner and on the basis of the neighbor lists of all the vertices, and establishing an index array of the hash trees corresponding to all the vertices; when a target graph vertex is accessed, traversing in parallel all neighbor graph nodes of the target graph vertex, and mapping neighbor lists of all the neighbor graph nodes to a contiguous memory region; and on the basis of the index array and the contiguous memory region, implementing triangle counting. Thus, the problems in the relevant art, e.g., insufficient GPU computing capability, low GPU computational efficiency and poor GPU memory access efficiency, during triangle counting are solved.

A method includes, by a first node in a distributed network: generating a hash tree representing a structured data object including a data unit, the hash tree including a root hash and a data unit hash representing the data unit; accessing a non-interactive proof of inclusion representing membership of the data unit hash within the hash tree; generating a transaction configured to generate a blockchain object including the root hash; and transmitting the transaction and the non-interactive proof of inclusion to a second data node in the distributed network.

The application discloses a model construction method, device, equipment, medium and product. The model construction method comprises: acquiring feature data of a plurality of users; wherein each user has a plurality of feature data; each feature data is data corresponding to a service complained by the user; obtaining a hash function family based on the feature data of each user and a distance hash function; constructing a hash tree based on the hash function family; constructing a distance hash forest based on a plurality of hash trees; and predicting whether a to-be-detected user is a to-be-complained user based on the distance hash forest. According to the embodiment of the application, it is not necessary to determine whether the user is a complained user, so that it is not necessary to add a label to the complained user, unsupervised learning is realized, a model for predicting a to-be-complained user is obtained, and the accuracy of the prediction of the complained user is improved.

The present application relates to messaging between instances of a microservice in a decentralized architecture. A computer device hosting an instance may include a memory storing instructions to operate a microservice and a processor. The instance receives a message for the microservice from another instance of the microservice, the message including a branch of a hash tree with at least a block for a root hash of a central node, one or more blocks for intermediate nodes, and a leaf block including message content. The instance places at least the leaf block into a local hash tree based on the branch of the hash tree. The instance verifies an integrity and an order of the message based on the root hash and the location of the leaf block in the local hash tree. The instance acts on the message content in response to verifying the integrity and the order.

A computer-implemented method of encoding a digital contract between first and second parties of a blockchain network, the digital contract being for transferring an amount of a digital asset from the first to the second party based on a condition being fulfilled; the method comprising: obtaining a plurality of data elements, each representing a different contract condition, wherein at least one of the conditions is linked to the second party; generating a hash tree based on the data elements, wherein the hash tree comprises: i) first leaf hashes generated by hashing a respective data element, and second leaf hashes comprising at least one hash key generated by hashing a secret value known only to the trusted third party, ii) internal hashes, and iii) a root hash; and making the root hash available to the first party for inclusion in a transaction of the blockchain.

The invention discloses a cross-system trusted identity authentication and secure communication method based on a distributed soft bus, and relates to the technical field of intelligent traffic and network security. Authentication and scheduling are limited in a preset geographic partition, and a temporary dominant node is elected by a time window, so that the consistency and the broadcast range are remarkably reduced, and the security of the distributed soft bus is improved. Queuing and oscillation of the whole network level are avoided; in cooperation with weighted voting based on reputation and resources, stable and margin node bearing authentication is preferentially selected, and the organization degree and fairness under high concurrency are improved; preloading and version binding of a hash tree identity abstract are introduced, so that first packet verification replaces whole chain verification with path verification, and calculation of a handshake critical path and IO overhead can be moved forward and stably spread in partitions in an emergency scene; and when the abstract is mismatched or suspicious, the system automatically returns to a complete certificate chain and revokes check, so that the real-time performance is ensured, and the effectiveness is not sacrificed.

The invention belongs to the technical field of electronic control, and particularly relates to a streaming OTA downloading, signature verification and installation method based on a Hash tree, a cloud side software package processing flow comprises part software package uploading, server block processing, leaf node Hash calculation, intermediate node construction, recursion upward root node generation, Hash tree structure generation, streaming compression and URL generation, and the cloud side software package processing flow comprises part software package uploading, server block processing, leaf node Hash calculation, intermediate node construction, recursion upward root node generation, Hash tree structure generation, streaming compression and URL generation. And the software package processing part of the vehicle end comprises URL (Uniform Resource Locator) acquisition, list.json analysis, downloading and decompression, integrity verification, flashing and verification. According to the technical scheme, the hash tree is used for verification, and the safety coefficient is high. When a user enters the installation process, the vehicle can be used, only installation and restarting are carried out finally, and long-time installation waiting is not needed. The terminal does not need to download a complete upgrade package for signature verification, can realize simultaneous downloading of the upgrade package, only needs to re-download an error part when a certain unit error is verified, saves flow, and does not need to occupy storage space resources of the whole package of a file system due to simultaneous downloading of the upgrade package.

The invention discloses a dye proportion control method, device and equipment, a storage medium and a product, and relates to the technical field of the textile industry, and the method comprises the steps: collecting multi-dimensional data such as hyperspectral data, dye flow parameters and environment temperature and humidity; constructing a hash tree according to the multi-dimensional data, and uploading the hash tree to a preset block chain for real-time data block verification; when the data block verification is passed, inputting the multi-dimensional data into the dye ratio prediction model for prediction to obtain an optimal dye ratio prediction value; and controlling the dye ratio according to the optimal dye ratio predicted value. According to the method, the hash tree is constructed according to the data such as the hyperspectral data, the dye flow parameters and the environment temperature and humidity, and real-time data block verification is realized through the tree hash structure and the block chain. The deep neural network based on the multi-source heterogeneous data is verified and fused with the block chain, so that a high-quality optimal dye ratio predicted value can be predicted and obtained, and dye ratio control can be performed more efficiently.

The methods and systems described herein improve blockchain storage operations in various environments. A blockchain compression system can determine that a blockchain compression condition associated with a blockchain having a plurality of first blocks has been satisfied. In response, the system compresses the plurality of first blocks into a first root hash value using a first hash tree and stores the plurality of first blocks in a first database. The blockchain compression system generates a first new epoch genesis block that includes the first root hash value and a first database address of the first database in which the plurality of first blocks are stored. The blockchain compression system stores the blockchain at one or more nodes in a blockchain network. The blockchain includes the first new epoch genesis block and any previous new epoch genesis blocks. In various implementations, this can effectively reduce the storage requirements of the blockchain.

A method of attesting, examining and quickly tracing a software bill of materials includes: registering with a coalition chain to gain access thereto; generating, by an e-wallet of a decentralized application module, a software coalition chain address; changing, by the decentralized application module, an initial software bill of materials into an integration software bill of materials including a software artifact information, software coalition chain address, correlated software information and correlated software coalition chain address; creating a hash tree tracing data by a tracing data creating module; assigning the software coalition chain address to the integration software bill of materials and the hash tree tracing data which are then uploaded to an InterPlanetary File System for acquiring a software content identifier; and assigning the software coalition chain address to the software content identifier to write the software coalition chain address and the software content identifier to the coalition chain.

The present invention relates to a hybrid decentralized network system comprising a primary blockchain, the primary blockchain comprising a plurality of primary blockchain blocks arranged in a primary linear structure, where each of the primary blockchain blocks comprises a hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes includes a user block chain arranged in a user hash tree structure. A computer-implemented method for verifying a hybrid decentralized network based on a hash tree structure is also disclosed.

The application provides a privacy protection method and system of a hybrid encryption strategy, relates to the technical field of data security, and comprises the following steps: receiving and dividing to-be-encrypted data into multiple data blocks; generating a main lattice base matrix and an auxiliary lattice base matrix based on lattice theory, obtaining a hybrid encryption key through matrix decomposition and Riemann manifold mapping; performing reconstruction on the data blocks and performing vector inner product operation on the data blocks and the key to generate ciphertext; constructing a hash tree structure of data segments and generating zero-knowledge proof; and finally returning encrypted data to a user. The application can improve encryption strength, enhance data security, support data verification at the same time, and effectively prevent information leakage.

The present application relates to the technical field of fuel dispenser data management, in particular to a fuel dispenser remote data management method and system based on cloud communication. A site terminal generates batch data blocks by time threshold packet, performs reversible compression and anchor point insertion, and generates batch metadata with a hash tree root value as a batch identifier; a secure session is established with the cloud when online, and transactions are uploaded in priority; when offline, data blocks and metadata are spouted into optical frame columns, broadcasted by a price display screen, collected and decoded by a mobile terminal video, and uploaded. The cloud restores data blocks based on reconstruction fragments and metadata, verifies integrity with frame-level checking and batch identifier verification, and writes transaction records and running status into a transaction library and a timing library respectively with site identifier and batch identifier idempotent deduplication, generates a reply short code to synchronize the site terminal; after network recovery, the batch is supplemented according to the missing list to realize consistent reconciliation.

The application provides a program integrity verification system and method suitable for a read-only file system, relates to the technical field of read-only file system protection, and comprises the following steps: when a read-only file system image is made, the trusted program file of the read-only file system is subjected to integrity measurement to construct a hash tree, then the unique identification of the hash tree is recorded in the metadata of the trusted program file, and the hash tree is signed and saved; when the program file is loaded, when the program file is determined to be a trusted program file according to the unique identification, the corresponding hash tree is called according to the unique identification to perform signature authentication, the program page is subjected to integrity verification, and the program page is allowed to be loaded and run when the signature authentication and the integrity verification are passed. The beneficial effect is to protect the safety of the read-only file system and the program credibility, so that even if a malicious program attacks into the computer by using a system vulnerability, the malicious program cannot run in the read-only file system, and the safety and reliability of the read-only file system are ensured to a greater extent.

This invention discloses a multi-tenant hierarchical access control processing method for gig platforms, specifically relating to the fields of computer networks and information security technology. It addresses the challenge of simultaneously achieving isolation, dynamic authorization, and tamper-proof archiving in cross-domain access under multi-tenant collaboration. By responding to cross-domain collaborative matching events triggered by the first and second tenants for a target user, it extracts minimal set attribute data and generates a target shadow entity in the second tenant. It outputs an entity binding message to the API gateway layer, generates and issues a first permission policy token around the lifecycle state vector, triggers global permission circuit breaking, identifies and rolls back concurrent write requests to be tested at the archive locking node, forms a pre-archiving cache, and obtains the final state shadow entity. Subsequently, it generates a data digest hash tree based on cross-domain interaction data, receives digital signatures, performs three-party signature consensus verification, and outputs a legality release certificate and a rights-confirming archive payload.

The invention discloses a data processing method and device, a storage medium and electronic equipment. The method comprises the following steps: acquiring a target hash tree generated based on target copy data, and a reference hash tree generated based on reference copy data associated with the target copy data; under the condition that a difference exists between a target verification parameter indicated by a root node of the target hash tree and a reference verification parameter indicated by a root node of the reference hash tree, N target basic data intervals are determined from the target hash tree, and N reference basic data intervals are determined from the reference hash tree; comparing the basic data in the ith target basic data interval with the basic data in the ith reference basic data interval to obtain difference basic data; and carrying out replacement processing on the difference basic data. The technical problem that the data processing efficiency is low is solved.