9 results about "Hash tree" patented technology

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.

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 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.

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 application discloses a cross-system trusted identity authentication and secure communication method based on a distributed soft bus, and relates to the technical fields of intelligent transportation and network security. The application limits authentication and scheduling within a preset geographical partition, and elects a temporary leading node in a time window, thereby significantly reducing consistency and broadcast range, avoiding network-level queuing and oscillation. In combination with weighted voting based on reputation and resources, the application preferentially selects stable and surplus nodes to bear authentication, and improves organization degree and fairness under high concurrency. The application introduces preloading and version binding of a hash tree identity digest, replaces whole-chain verification with path verification for first packet verification, and in a burst scenario, can move the calculation of a handshake key path and IO overhead forward and stabilize the propagation within a partition. When the digest is mismatched or suspicious, the application automatically falls back to complete certificate chain and revocation check, thereby guaranteeing real-time performance without sacrificing effectiveness.

This invention discloses a system and method for non-intrusive database integrity protection. The system includes a main database module, a state verification engine module, a user operation chain module, a Binlog chain module, a verification block module, and a user client module. The main database module outputs changes via incremental logs. The state verification engine module dynamically aggregates changes using an incremental hash tree construction mechanism. The user operation chain solidifies business intent, the Binlog chain solidifies underlying physical execution facts, and the verification block module compares the theoretical state with the actual physical state. If they match, the state root is recalculated across all data, and the double-chain hash is aggregated for digital signature generation. If they do not match, generation is rejected and blocked. Users do not need to access the database instance; independent verification can be completed solely based on the block state root and Merkle proof. This invention supports a three-layer progressive proactive auditing challenge under zero trust, possessing advantages such as protection against physical tampering, high performance, and precise liability delineation.

An efficient virtual machine file integrity monitoring method and system utilizing hierarchical hash trees is disclosed. The method is based on hardware-assisted virtualization, capturing key file system call events of the Guest OS at the Hypervisor layer. It obtains file paths, metadata, and content summaries based on adaptive segmented sampling through memory parsing, constructing a hierarchical hash tree as a unified representation of the integrity baseline and runtime state. When file changes are detected, the system performs only local incremental updates to the hash tree, reducing computational complexity to O(log n). Threat determination is performed by combining multi-dimensional features such as change frequency and file type concentration within a sliding time window, triggering a tiered response. When the threat level reaches a preset threshold, the system physically pauses the virtual machine and quickly locates the target set of changed files by performing a top-down difference traversal by comparing the current hash tree with the baseline hash tree. This invention achieves strong external isolation monitoring, effectively defending against ransomware and internal threats, and combines high real-time performance with low performance overhead.

An information processing apparatus performs the following processing: acquiring one or more pieces of data; acquiring a hash tree associated with the data; calculating a hash value based on the data; comparing it with a reference hash value, and if it is determined that at least one of the data and the reference hash value has been tampered with, displaying data that is different from other data that has been determined to have not been tampered with; and comparing it with a root hash recorded in a blockchain, and if it is determined that the acquired hash tree is normal, displaying data that is different from at least one of the displays of other data that has not been tampered with and the displays of data that has been determined to have been tampered with.

A semiconductor device (SoC) (1) and computer-implemented method for deterministic artificial intelligence supervision. It incorporates a secure port (8) in an inert state to ensure subordination by injecting a base truth. An AECM module (3) audits the integrity of physical memory using hash trees on the hot path, repairing tensors on the fly with no latency. An AECM module (4) vetoes semantic hallucinations by calculating spatial divergences in hardware and consolidating neuroplasticity in parallel search associative memories (4a) without retraining software. A forensic module (5) extracts the causal triad and cross-references it with a logical topological map, recording the exact node and layer responsible for the failure in immutable storage to provide full explainability.