222 results about "Group key" patented technology

A database query optimization method, comprising: acquiring a query statement, the query statement comprising a connection operation and a group aggregation operation; determining that a connection key and a group key in the query statement are the same, wherein an aggregation function in the query statement can be split, and an input parameter of the aggregation function comes from the same side as a connection condition in the query statement; creating a fusion operator, the fusion operator being used for completing the connection operation and the group aggregation operation; when a cost for executing the fusion operator is less than or equal to a target cost, on the basis of the fusion operator, generating an optimal execution plan related to the fusion operator, wherein the target cost is a cost for executing a connection operator and a group aggregation operator; and performing the operations step by step on the basis of an operation sequence in the optimal execution plan, so as to obtain a query result set. Therefore, when the query statement meets corresponding features, the connection operation and the group aggregation operation can be fused into one operator, thereby reducing the processing flow of an intermediate result, accelerating the execution of the query statement, and improving the query execution performance.

The invention discloses a revocable attribute-based encryption method with strategy hiding, which is based on ciphertext strategy attribute encryption, solves the problem that user privacy is leaked due to disclosure of an access strategy, realizes revocation of fine-grained user attribute access authority, and is proved to be completely safe. In a system establishment stage, system parameters are disclosed, a public key and a master key are generated, an authoritative authority authorizes a data user, distributes a private key and generates an AGK tree and an attribute group key, a data owner generates a ciphertext according to the public key, an access structure set by the data owner and a selected secret value, and the ciphertext is transmitted to the data owner. And then hiding the mapping function by using a cuckoo filter, positioning the attribute by a data user through the cuckoo filter, updating a private key by using an attribute group key, and finally decrypting the ciphertext to obtain the wanted information.

The invention relates to the technical field of data processing, can be applied to business scenes such as financial science and technology and medical health, and discloses a data grouping optimization processing method, device and equipment and a medium. The method comprises the steps that input data are collected, cleaning and format unification are completed, and cleaned data are generated; generating a grouping mark from a condition constraint library based on the data attribute field; dividing the data into a plurality of subsets according to a segmentation strategy and distributing the subsets to a plurality of processing nodes; generating a grouping key in each processing node according to the grouping mark and the data attribute field; grouping identifiers are distributed for the records based on the grouping keys, and a local grouping result table is formed; and finally, collecting all local results, verifying the consistency, and generating a global grouping result table. According to the method, sorting and key generation are performed in combination with the data attribute fields and the grouping marks, high-precision grouping identification is realized, and the accuracy of a global grouping result is guaranteed through an inter-node consistency verification mechanism.

Data structures and methods are described to provide a unique extendable group identifier for efficient aggregation query processing using multiple grouping keys. A method comprises retrieving a database query comprising an aggregate function of a selected column from a database table, grouped by a plurality of columns. The method further comprises maintaining a plurality of hash tables that map column values to grouping keys and identify a maximum grouping key. The method further comprises updating a plurality of bitmasks that define per-column grouping key bit positions, capable of storing the maximum grouping key, within a combined index value. The method further comprises allocating a result array sized according to the plurality of bitmasks. The method further comprises using the plurality of bitmasks and the plurality of hash tables to determine the combined index value to apply the aggregate function on the selected column for each row in the database table.

The invention relates to the technical field of security authentication and ubiquitous networks, and discloses a ubiquitous-network-oriented cloud-side collaborative multi-factor identity authentication method and system, and the method comprises the steps: issuing an identity certificate based on an elliptic curve and a PUF challenge-response library of a parameter initialization edge node through a cloud, and achieving the cloud-side bidirectional authentication; when the terminal is accessed, multi-factor authentication combining PUF challenge and a dynamic threshold value is adopted, so that the capability of resisting counterfeiting and replay attacks is improved; after the authentication is passed, the edge node generates a group public key locally and constructs a binary tree group key structure with a preset depth, and post-quantum safe and efficient group signature management is supported; when a newly added terminal joins, generating a secret key based on an elliptic curve algorithm and distributing a group signature private key share to realize lightweight member management; the integrity, confidentiality and traceability are realized while the transmission efficiency is guaranteed, and safe communication and dynamic revocation in an edge resource limited environment are effectively supported.

The invention discloses an anonymous authentication method for a certificateless group of the Internet of Vehicles, and the method comprises the steps: 1) system initialization: system parameter generation, road side unit registration and vehicle registration; 2) communication authentication between the vehicle and the infrastructure, including bidirectional identity authentication and security key negotiation; 3) communication authentication between vehicles, including generation of pseudonyms and signatures, signature authentication and efficient batch authentication; and 4) a malicious vehicle revocation mechanism based on group key updating, which comprises the steps of malicious vehicle identity disclosure, group key updating and distribution, legal vehicle key recovery and malicious vehicle isolation. The method not only has more efficient processing capability in the aspects of guaranteeing the data security, privacy protection and Sybil attack defense of the Internet of Vehicles system, but also meets the requirements of the Internet of Vehicles for efficient identity verification and revocation in a resource-constrained environment, and provides a safe, low-cost and efficient overall solution for the Internet of Vehicles system.

The invention discloses a collaborative optical transmission method and device based on multi-layer index modulation. The method comprises the following steps: acquiring a key and to-be-sent original data; generating a four-dimensional chaotic sequence through a four-dimensional chaotic model according to the key; performing constellation mapping on the original data to obtain a 16QAM constellation signal; performing secondary scrambling on subcarriers and symbols of the 16QAM constellation signal by using the four-dimensional chaotic sequence to obtain a 16QAM scrambling signal; performing binary conversion on the secret key to divide the secret key into a first group of secret keys and a second group of secret keys; performing first-layer index modulation on the 16QAM scrambling signal by using the first group of keys to obtain a first modulation signal, and performing second-layer SIM index modulation on the first modulation signal by using the second group of keys to obtain a second modulation signal; and performing OFDM modulation on the second modulation signal, and transmitting the second modulation signal in an optical fiber channel. The security of a communication system is improved by means of the transmission of the index modulation masking key twice in combination with the multi-dimensional disturbance of subcarriers and symbols.

The invention discloses an unmanned aerial vehicle cluster-oriented lightweight dynamic asymmetric group key negotiation method and system, a key generation center generates system public and private keys and public parameters, unmanned aerial vehicles and a ground station register and verify partial public and private keys and complete public and private keys, and the ground station precomputes an initialized table to assist subsequent operation. The unmanned aerial vehicles generate signature messages respectively and send the signature messages to ground station nodes for identity verification, the ground stations negotiate and publish asymmetric group encryption keys to the block chain, and the unmanned aerial vehicles generate respective decryption keys; when a new unmanned aerial vehicle applies for joining, a signature message is sent to a ground station node, the ground station updates and publishes the asymmetric group encryption key, and the unmanned aerial vehicles update respective decryption keys; when the unmanned aerial vehicles apply for leaving, a leaving message is sent to the ground station node, the ground station updates and publishes the asymmetric group encryption key, and the unmanned aerial vehicles update respective decryption keys; the pairing-free certificateless asymmetric group key negotiation is realized, and the calculation and communication efficiency is improved.

The invention relates to the technical field of power data transmission, and discloses a power distribution Internet of Things terminal management method and system based on quantum cloud codes, and electronic equipment. The method comprises the steps of mixing original data through a random number generator to obtain a quantum cloud code seed, obtaining a quantum cloud code sequence through fragmentation encryption, forming a terminal equipment grouping key according to a preset rule, generating an equipment identity feature code in combination with operation state information, and establishing a data transmission channel according to the feature code. A secure communication link is formed through encryption and verification of a session key, operation data in the communication link is collected, a standardized data set is obtained through cleaning and normalization, output equipment behavior characteristics are mapped, operation authority is dynamically adjusted to construct a management system, regular snapshot and distributed backup are performed, and disaster recovery backup data are formed to establish a recovery strategy. According to the invention, security authentication, dynamic permission allocation and intelligent management of the terminal equipment are realized, and the security and management efficiency of the system are remarkably improved.

The invention discloses an anti-quantum key management method for a vehicle-mounted domain centralized electronic and electrical architecture. Firstly, the invention provides a self-adaptive security policy generation method based on an analytic hierarchy process. Key factors influencing vehicle-mounted service safety are sorted through a system, a three-layer AHP hierarchical structure model with the purpose of selecting an optimal encryption mechanism is constructed, and therefore vehicle-mounted service safety modeling is achieved. According to the method, the most suitable security policy can be automatically matched according to the characteristics of different services, the self-adaptive security policy generation of the service granularity is realized, and the optimization of the system resource use efficiency is realized while the communication security is ensured. Secondly, the invention provides a fine-grained anti-quantum key management scheme based on the Chinese remainder theorem, and the fine-grained anti-quantum key management scheme is specially designed for adapting to a one-to-many communication scene widely existing in a vehicle-mounted network. The method supports efficient distribution and dynamic updating of group keys of service granularity, and has good quantum attack resistance.

A system protects personally identifiable information (PII) by implementing an unconventional key management scheme. In this scheme, the system uses a set of keys rather than an individual key for encrypting PII. Different portions of the PII are encrypted using different keys from the set of keys. In this manner, even if a malicious user were to access a key, that key would not give the malicious user the ability to decrypt all of the PII. Additionally, the system generates a new set of keys periodically (e.g., once a month). The system also deletes sets of keys that are too old (e.g., six months old). As a result, even if a malicious user were to access a key, the usefulness of that key would be time limited.

The invention provides a TCAM-based message header data processing method and related equipment, and the method comprises the steps: caching and inputting message header data through an FIFO queue, and scheduling the message header data to a message header processing assembly line composed of a TCAM memory, an RAM memory and a parallel processor through an arbiter; a round processing mechanism is combined and adopted, a lookup key value of the current round is matched with an index value in a TCAM in each round of processing, an action table in an RAM is read according to the index value, and a message header analysis instruction of the current round, a group key instruction of the next round and a jump state value of the next round are obtained; executing the instruction through the parallel processor to obtain and update message metadata; when each round is finished, whether the round is finished or not is judged based on the jump state value of the next round; and after the round is finished, outputting the obtained final message metadata by the order-preserving cache queue. According to the invention, the message header data is analyzed by using the TCAM-based data processing technology, so that the flexibility of message header analysis is improved.

The invention discloses a group key person identification method, electronic equipment and a readable storage medium, and belongs to the technical field of mobile communication. According to the method, the target sub-graph is sent to the terminal equipment corresponding to the target entity, so that the terminal equipment carries out fusion based on the received target sub-graph, and a global heterogeneous network graph corresponding to the target entity after multiple knowledge graphs are linked is obtained; training a local business model according to the global heterogeneous network atlas to obtain local training gradient data, and sending the local training gradient data to a service party; the service party fuses the local training gradient data provided by each service party to obtain global gradient data corresponding to the graph federal learning model, and feeds back the global gradient data to each service party; and respectively updating model parameters of a local service model by each service party according to the fused global gradient data. According to the invention, the group key person identification precision and efficiency can be improved.

The invention provides an anti-quantum cryptography application method and device based on an FIDO 2.0 standard and a related product, and relates to the technical field of information security. According to the method, on the basis of an FIDO2.0 standard specification, two groups of keys, namely a traditional key and an anti-quantum key, are generated by using cryptographic algorithm key derivation through the same random number seed; the two groups of keys are tightly coupled to serve as a composite key for FIDO authentication to be used for a subsequent authentication signature process, so that the anti-quantum security is enhanced; when the composite signature is used, the anti-quantum signature covers the traditional password signature, so that a strong dependency chain of two password algorithms is formed, and the security authentication strength is enhanced; when the signature is verified, the composite public key is used for verifying the traditional signature and the anti-quantum signature, authentication can be passed only when the traditional signature and the anti-quantum signature pass, double security protection of the traditional password technology and the anti-quantum password technology is achieved, and the attack risk of the traditional password in quantum computing is effectively resisted.

Methods for hiding the identity of communications devices in a continuous group key agreement are provided. A group member making a request relating to changing a group state provides a signed challenge value to a server, which signed challenge value has been signed using a group signature key. The server checks the signed challenge value to determine if the group member is in possession of the group signature key and is therefore a member of the group. As the group signature key is used, the server cannot determine the identity of the group member making the request.

The invention discloses a quad-tree-based end-to-end group key negotiation method and device, which are applied to group communication, the connection among group users adopts a quad-tree structure, and the method comprises the following steps: a user ui sends a proposal for changing a group state, and broadcasts a proposal message to a group; other users in the group verify the received proposal message and update one of a local encryption key material and a direct path thereof, a new group key is generated, and group key update after group state update is completed; wherein group state changing comprises user joining, user leaving and user own state updating. According to the invention, on the basis of ensuring the safety of group chat communication, the performance and response speed of the group chat communication are improved, and the method can better adapt to a complex and dynamic communication environment.

According to the lightweight Internet of Vehicles identity authentication protocol based on the block chain, the block chain is innovatively built on an urban bus to form a bus end block chain to better adapt to the high-speed movement characteristic of the Internet of Vehicles aiming at the problem that the communication and authentication efficiency of a traditional road side unit is low when the vehicle moves at a high speed. According to the protocol, efficient storage of identity messages, real-time revocation of illegal vehicle identities and dynamic updating of group keys are realized through elliptic curve encryption, a hash function, a regular 30-cellular automaton and a block chain technology. In the authentication process, the vehicle forms a temporary pseudonym by using a hash function and an elliptic curve password and sends an authentication message, and the urban bus reads the information through the block chain to complete authentication, so that the security and unforgeability of the pseudonym are ensured, the authentication efficiency is improved, and the calculation and communication overhead is reduced. In addition, according to the protocol, a group key generation and updating mechanism is designed based on a rule 30-cellular automaton, and the safety and flexibility of the system are further enhanced. The method can effectively solve the problems of single-point failure, data tampering risk, low communication efficiency, inconvenient group key updating and the like of a traditional centralized authentication protocol, and is suitable for a safe interaction scene between the urban bus and the common user vehicle.

This invention relates to the field of automated file transfer processing technology, and discloses an automated SFTP task processing method, apparatus, and computer-readable storage medium. The method includes: acquiring directory change data and objectifying the directory change data to generate candidate file objects and determine file objects to be preprocessed; preprocessing the file objects to be preprocessed based on file feature data and preprocessing rule data corresponding to the file objects to be preprocessed, to generate preprocessing result objects; generating structured transfer tasks based on the preprocessing result objects, and determining group keys based on the target SFTP server IP and target directory, grouping structured transfer tasks with the same group key into the same group of tasks; establishing a group-level execution context based on the group tasks, and executing the structured transfer tasks within the group in the group-level execution context to obtain task execution results; and updating the task status and / or generating result records of the structured transfer tasks based on the task execution results.

A method performed by a network device for enabling and disabling a group of Ambient Internet of Things (AIoT) devices in a communication network includes provisioning the group of AIoT devices with a group identifier (ID), a group key, and a first stop code, transmitting, to the group of AIoT devices, a second stop code and a third stop code that are associated with the group ID and secured using the group key, and determining whether to disable the RF transmission capability of the group of AIoT devices based on the second stop code and the third stop code.

This invention discloses a multi-agent communication key management method and system adapted to dynamic topologies, relating to the field of multi-agent communication security technology. It addresses the problems of low scalability and high failure risk in the existing centralized key generation and distribution processes of agent keys. The invention includes: the role of the GC can be elected and rotated among multiple agents, avoiding physical single points of failure; and it establishes a multi-agent group key system based on a logical key tree. When an agent joins or leaves, only logarithmic-level key updates are required, reducing the communication overhead of key distribution from O(N) to O(logN), significantly improving the system's efficiency and scalability when handling large-scale, highly dynamic groups.

This application provides a batch authentication and dynamic group key negotiation method for vehicle-to-everything (V2X) networks. The method includes: in the third-party authentication phase, a roadside unit (Roadside Unit) aggregates multiple vehicle authentication requests for batch verification by a trusted center, and encodes the authentication response and group key calculation parameters into a single composite value using the Chinese Remainder Theorem for broadcasting. Vehicles extract verification information and their unique parameters through modulo operation to complete bidirectional authentication. In the dynamic group key negotiation phase, the Roadside Unit maps authenticated vehicles and itself as binary tree leaf nodes, recursively generating a public group key based on the node's public key and unique parameters. When member changes, only the affected path node information is locally updated. This application integrates authentication response and key negotiation information, reducing downlink channel bandwidth usage and decreasing the group key update complexity from linear to logarithmic levels. It ensures forward and backward security while meeting the real-time communication requirements of high-concurrency access and highly dynamic topology scenarios in V2X networks.

Methods and systems for validating key rotation requests for endpoint devices are disclosed. The key rotation requests may be signed by one or more signing systems according to a set of re-keying rules for the endpoint device. The set of the re-keying rules may indicate that key rotation requests may be valid if signed using at least two different keys. The set of the re-keying rules may also indicate that each of the at least the two different keys be from a different grouping of keys of multiple groupings of keys included in a secure key repository. Each grouping of keys may be associated with a different organization. Therefore, key rotation requests may be serviced if signatures associated with the key rotation requests meet the re-keying rules thereby decreasing a likelihood of compromise of the endpoint devices via compromise of a key.

The invention provides a block cipher key security analysis method based on a neural discriminator. The method comprises the following steps: generating a plaintext pair according to a given input differential feature; the method comprises the following steps of: respectively carrying out specified round encryption operation on a plaintext pair by utilizing a grouped key to obtain a primary ciphertext pair, respectively carrying out full round encryption on the plaintext pair by utilizing a random grouped key to obtain a complete ciphertext pair, and calculating an intermediate state difference of the primary ciphertext pair; marking the complete ciphertext pair according to an intermediate difference screening mechanism to construct a training sample; training a deep learning neural network model by using the training sample; and inputting a to-be-analyzed ciphertext pair into the trained deep learning neural network model, and outputting a classification result whether a preset difference feature condition is met or not. The method shows excellent adaptive capacity to unknown encryption rounds and key variants, and the password security analysis effect is improved.

The embodiment of the invention provides a key management method and device, equipment, a medium and a product, and the method comprises the steps: responding to a first triggering event of a Kth private key in L groups of key pairs, and determining L node sets in a block chain network corresponding to the L groups of key pairs; respectively acquiring a first fusion polynomial share from the T nodes in the (K-2) th node set, and respectively acquiring a second fusion polynomial share from the T nodes in the (K-1) th node set; determining the polynomial share of the (K-1) th private key in the L groups of key pairs according to the obtained T first fusion polynomial shares and T second fusion polynomial shares; the polynomial share of the (K-1) th private key is used for generating the (K-1) th private key. According to the embodiment of the invention, the security of the private key can be improved.

The present invention discloses a group key negotiation method for area perception in an unmanned system, which mainly solves the problems in the prior art such as not supporting multi-level group division, location privacy leakage, excessive overhead, and insecure group keys. The implementation scheme is as follows: constructing a drone system; each unmanned device converts its own position coordinates into a set of hierarchical encoded bit strings with hierarchical area attributes, and calculates the matching result of the area according to this set; each unmanned device calculates the member list of each hierarchical area according to the matching result; each unmanned device generates a multi-signature for the member list, and the remote control station verifies the consistency of the member list according to the multi-signature of the unmanned device; the remote control station and the unmanned devices in each area member list jointly negotiate the group key of each area; in each time period, the group key is updated according to the change of the member list. The present invention has good privacy, high update efficiency, and strong security, and can be used for group communication in unmanned systems.

The present disclosure provides methods systems and apparatuses for use in the secure agreement of group keys in which the group key(s) are shared between multiple end-point devices, said multiple-endpoint devices being used to create the group key(s) that is / are distributed in such a manner that no other untrusted part of the system has access to sufficient information to be able to derive or determine the group key(s) and / or portions of said group key(s). This is achieved by pairs of endpoint devices agreeing pairwise keys between themselves, wherein an intermediary device that distributes encryption keys to the endpoint devices over quantum communication channels does not have sufficient information to be able to derive the identity of the pairwise keys.

A communication network comprising an access point, AP, affiliated with an AP multi-link device AP MLD, and a non-AP station, STA, affiliated with a non-AP MLD. The AP MLD transmits a frame 400 includ

The invention discloses a group key generation and management method based on position information in backscatter communication, the generation method is applied to any backscatter device Ai in a backscatter communication system, and the generation method comprises the following steps: estimating coordinate information of each other backscatter device Aj according to a received radio frequency signal and a reflection signal, wherein the radio frequency signal is a signal emitted by a radio frequency source, the reflection signal is a radio frequency signal reflected by backscattering equipment, i and j belong to {1, 2,..., N}, i is not equal to j, and N is the total number of backscattering equipment in the system; extracting shared information from the coordinate information; and sequentially carrying out quantization, information negotiation and privacy amplification operation on the shared information to obtain a group key of the system. The group key generated by the method is good in performance and high in generation efficiency.

Methods of securely distributing a message to a group of nodes within a network, wherein the network comprises a plurality of nodes and the group of nodes comprises a subset of the plurality of nodes. The methods comprise: agreeing a common group key between all of the nodes in the group of nodes; encrypting, by a first node amongst the group of nodes, a message with the group key such that only nodes that are members of the group of nodes are able to decrypt and read the message; and distributing the encrypted message through the network using a gossip-based protocol.