70 results about "Bilinear pairing" patented technology

The embodiment of the invention provides an Internet of Things authentication method and electronic equipment, and relates to the technical field of communication security, and the Internet of Things authentication method comprises the steps: obtaining a dynamic key element of terminal equipment; generating a dynamic key of the terminal equipment according to the dynamic key element, the static identity public key of the terminal equipment and the identity identification information; the static identity public key is obtained through calculation based on hardware fingerprint information and identity identification information of the terminal equipment and pre-configured bilinear pair parameters; sending an authentication request to an access point accessed by the terminal equipment; the authentication request carries identity identification information and a dynamic key; and the access point is used for acquiring the static identity public key from the block chain system according to the identity information, and authenticating the dynamic key based on the static identity public key. According to the method and the device, the security of the dynamic key can be ensured from multiple aspects, the authentication process can be accurately and efficiently completed without pre-storing a public key certificate, and the communication security between the terminal equipment and the access point is improved.

The invention relates to a credible federal large model nonlinear activation function verification method based on zero knowledge proof, and belongs to the field of data security and privacy protection. The method comprises the following steps: decomposing a ReLU function into three groups of linear equations of symbol judgment, zero output and Boolean constraint according to the nonlinear characteristic of the ReLU function to form an R1CS constraint system; on the basis of the R1CS constraint system, a zero-knowledge proof protocol is adopted, a verification equation containing bilinear pairing operation is constructed, and a proof generation algorithm and a verification algorithm are defined; according to a proof generation algorithm and a verification algorithm, global public parameters are generated through a multi-party security computing protocol, participants compute and generate zero-knowledge proof tuples according to local activation values, and a server receives the proof generated by each participant and executes aggregation verification. According to the method, on the premise of protecting data privacy, completeness and correctness of activation value calculation are verified, the method can be extensively applied to federal large model training, and the collaboration problem of privacy protection and calculation credibility verification is solved.

The invention discloses a coprocessor design method suitable for implementation of an identification cryptographic algorithm, and belongs to the technical field of information security and integrated circuits. According to the method, a hardware instruction set and a coprocessor architecture are designed by analyzing and disassembling a basic operator of the identification cryptographic algorithm based on bilinear pairing operation; each hierarchical operation unit is realized by a hardware instruction layer, so that bilinear pairing operation and a complete algorithm protocol can be efficiently realized, each parameterized curve can be realized in a matched manner, the actual requirements of different performance and power consumption indexes can be met, and the flexibility is relatively high.

The invention discloses an unmanned aerial vehicle cluster dynamic cross-domain key management method and system based on the Chinese remainder theorem (CRT), a key generation center generates system public and private keys and public parameters, and a ground station and an unmanned aerial vehicle perform hierarchical registration and verify respective keys; the unmanned aerial vehicles respectively generate signature messages and send the signature messages to a specified ground station for identity verification, and the ground station constructs a group key based on CRT and publishes the group key to the block chain; when a new unmanned aerial vehicle applies for joining, a signature message is sent to the ground station, and the ground station updates and publishes the group key; when the unmanned aerial vehicle applies for leaving, a leaving message is sent to the ground station, and the ground station updates and publishes the group key. According to the method, complex operations such as bilinear pairing operation and large integer modular exponentiation operation are avoided by optimizing the group key derivation process based on the CRT, and the calculation complexity is remarkably reduced. Meanwhile, efficient cross-domain authentication and batch verification are realized through Pedersen commitment and a zero-knowledge proof technology, and communication and calculation overhead is reduced.

The invention provides a controllable anonymity optimization method for a block chain smart contract, and belongs to the technical field of block chain smart contracts, and the method comprises the steps: generating a user private key through employing a threshold secret sharing protocol and a three-layer GPU acceleration architecture, storing a corresponding relation between identity information and a Hash ciphertext to a supervision center, and carrying out the encryption of the user private key; a user signs a smart contract calling parameter by using a private key and then sends the smart contract calling parameter to a block chain network, a block chain node extracts all signatures in a transaction to construct a dependency graph and groups each parallel verification group by using a greedy coloring algorithm, and parallel verification is performed on each parallel verification group by using bilinear pairing batch processing and a three-layer GPU acceleration architecture. After verification is passed, intelligent contract service logic is executed to complete transaction uplink, the supervision user retrieves the user identity information original text through the Hash ciphertext, and the technical problem that the on-chain calculation cost is too high due to the fact that signature batch verification efficiency is low when controllable anonymity is achieved in the block chain intelligent contract is solved.

The invention discloses an identity hiding post-quantum identity-based ciphertext signcryption method, which adopts bilinear pairing as a basic structure, innovatively introduces a lattice-based post-quantum symmetric encryption algorithm, and introduces an identity hiding characteristic on the basis of a traditional identity-based signcryption scheme. Meanwhile, the post-quantum encryption algorithm is integrated into the signcryption process, so that the anti-quantum performance of the scheme is remarkably enhanced. The hybrid design not only retains the advantages of identity-based passwords, but also provides strong post-quantum security assurance.

The invention discloses an anonymous voucher generation system and method, and belongs to the technical field of computer security, and the anonymous voucher generation system comprises a certificate mechanism, a plurality of users and a server side. The certificate authority is used for sending the attribute, the credential value, the pseudonym and the accumulator evidence of the first user to the first user; the first user is configured to generate a blinded credential using the credential value, generate an accumulator auxiliary parameter based on the accumulator value and the accumulator evidence, generate a first zero knowledge proof based on the accumulator auxiliary parameter and a blinding auxiliary parameter in the blinded credential, the first zero knowledge proof is used for proving that the first user has the blinded certificate, the accumulator evidence, the accumulator auxiliary parameter and the blinding auxiliary parameter; and the server side is used for verifying the validity of the first zero knowledge proof, and verifying the correctness of the public attribute, the blinded certificate and the accumulator auxiliary parameters by adopting a bilinear pairing operation. The system can reduce the calculation overhead of the user in the anonymous credential technology.

The present application belongs to the technical field of information security, and particularly relates to a BLS traceable security threshold signature method and system based on distributed key generation. The method comprises the following steps: S1, generating a bilinear pairing environment, and initializing public security parameters; S2, determining a group mapping relationship based on a symmetric balanced incomplete block design, each participant interacting in a group to generate respective key shares and a system global public key; S3, a signer performing partial signature and zero-knowledge proof corresponding to the partial signature on a message according to the corresponding key share; S4, an aggregator collecting and verifying the partial signature, screening out an effective signature set, aggregating to generate a final signature, and generating a commitment ciphertext; S5, a verifier verifying the final signature, and confirming the signature as valid if the verification is passed; S6, when the verification is not passed, a tracing mechanism is activated, and a tracer traces the signature group; and S7, according to the group mapping relationship, regularly performing active refreshing of the key shares.

The application discloses a kind of distributed data encryption sharing methods based on block chain, and using block chain realizes the traceable management of search and authorization process.The scheme is first by multi-authorization center to carry out distributed management to attribute domain, and generates attribute key associated with identity for user;In access verification link, construct parameter masking mechanism based on bilinear pairing, so that user attribute private key is not directly exposed in block chain verification and query process.Secondly, data owner carries out layered encryption to shared data and session key, and constructs the improved multi-key search structure, index and ciphertext positioning information are recorded to block chain, to support fast positioning target ciphertext.In addition, the application uses linear secret sharing to set access structure, and designs subset determination mechanism of general attribute name set, binds the download permission of ciphertext with the attribute condition that user can satisfy, to prevent overreach download behavior.Finally, with the help of cloud, outsourcing decryption is executed to generate intermediate result, and terminal only needs to complete light recovery and decryption.The application can give consideration to fine-grained control, high-performance search access and terminal side low load, and is suitable for secure data encryption sharing in resource-limited scene.

The disclosed embodiments disclose a data processing method, apparatus, electronic device, and computer storage medium. The method comprises: obtaining side channel information collected from a cryptographic device; the side channel information is physical information leaked during the operation process in which the private key to be cracked participates when the cryptographic device performs a bilinear pairing operation; selecting target information from the side channel information; the target information is the side channel information corresponding to the private key to be cracked during the process of being moved; matching the target information with preset information templates corresponding to multiple candidate keys; the preset information templates include reference information corresponding to the candidate keys; and determining one of the multiple candidate keys as the cracked private key based on the matching result. This technical solution can crack a private key based on the characteristic that the operation process in which the private key participates is prone to information leakage during the initial relocation of the private key, thereby improving the success rate of the attack.

This invention provides an optimized method for controllable anonymity of blockchain smart contracts, belonging to the field of blockchain smart contract technology. This invention generates user private keys using a threshold secret sharing protocol and a three-layer GPU-accelerated architecture, storing the correspondence between identity information and hash ciphertext in a monitoring center. Users sign smart contract call parameters using their private keys and send the results to the blockchain network. Blockchain nodes extract all signatures from the transaction, construct a dependency graph, and group them using a greedy coloring algorithm. Each parallel verification group is then verified in parallel using bilinear pairing batch processing and a three-layer GPU-accelerated architecture. After successful verification, the smart contract business logic is executed to complete the transaction on-chain. Monitoring users retrieve the original user identity information using the hash ciphertext. This invention solves the technical problem of low efficiency in batch signature verification leading to excessively high on-chain computation costs when achieving controllable anonymity in blockchain smart contracts.

The embodiment of the invention discloses a vehicle ad hoc network efficient aggregation anonymous verification method and related device, and the method comprises the steps: firstly carrying out verification based on the freshness of a timestamp, and guaranteeing the freshness of the timestamp from the source; verifying the validity of the single signatures one by one, and rejecting the received invalid signatures; and finally, aggregated signature verification is carried out, the overall validity of all signatures can be verified through one-time bilinear pairing operation, and compared with a traditional method in which verification is carried out one by one and multiple times of bilinear pairing operation needs to be carried out, the calculation complexity can be reduced. In a high-concurrency scene, the processing delay is shortened from a second level to a hundreds of milliseconds level, the problem of low dynamic message authentication efficiency of the Internet of Things, especially the Internet of Vehicles, can be effectively solved, and the real-time requirement is met. In addition, the intelligent contract of the block chain and the distributed digital identity verification technology are introduced, hostile attacks of Internet of Things viruses or nodes can be prevented, and it is particularly important to improve privacy protection and prevent privacy disclosure.

The invention provides an SM9-based client-multi-server rapid self-adaptive key negotiation method. The SM9-based client-multi-server rapid self-adaptive key negotiation method mainly comprises the following steps: an initialization stage, a private key extraction stage, a broadcasting stage, an offline preparation stage, an online response stage and a session key generation stage. The method has the following characteristics: 1, the method is suitable for a client-multi-server scene, a client initiates a communication request, a plurality of servers are automatically adapted to communicate with the client according to states such as self load and communication delay, and a key negotiation process only needs three times of communication; 2, aiming at a client-server communication mode, computing load optimization is carried out; different from the traditional P2P key negotiation with the same calculation amount of both parties, the method migrates the calculation overhead to the server side as much as possible; and 3, the client does not need to carry out complex bilinear pairing operation, and particularly, the calculated amount in an online response stage can be almost ignored. And meanwhile, an online / offline optimization technology is adopted, so that the client can carry out pre-calculation before communication, and the online response efficiency is improved.

This invention belongs to the field of smart grid technology, specifically relating to a two-way authentication key negotiation method and an electricity consumption information collection system using this method. During the two-way authentication key negotiation process, both parties generate their own digital signatures, and include the digital signatures and timestamps in the generated authentication key negotiation request message, authentication key negotiation response message, or authentication key negotiation confirmation message. After each signature is successfully authenticated, both parties are considered to have authenticated each other's identities. This method applies a certificate-free authentication key negotiation protocol based on the elliptic curve discrete logarithm problem (without bilinear pairings) to a high-speed dual-mode communication system for electricity consumption information collection. This eliminates the necessity of traditional public key certificates in authentication key negotiation, avoiding the problems of high computational overhead, communication latency, storage space, and high power consumption caused by certificate management in the high-speed dual-mode communication system for electricity consumption information collection. Furthermore, the addition of timestamps to the messages helps resist replay attacks.

The invention relates to identity authentication middleware applied to a PaaS platform, and belongs to the field of data processing, and the identity authentication middleware comprises a user interface which is used for providing a task creation interface, a data uploading interface and an application configuration interface for a user; the identity verification module is used for verifying the identity of the user based on a bilinear pairing technology; the application program interface server is used for receiving an API request of a user; the composer is used for screening user requests initiated by the users passing the identity verification and determining resource scheduling schemes for all the user requests; the workflow engine is used for converting the resource scheduling scheme into a workflow; the execution adapter is used for converting the task description in the workflow into a specific operation command; the application directory module is used for storing all scientific applications supported by the PaaS platform and parameter templates of the scientific applications; the credential management module is used for managing keys of the user and the cloud service provider; and the message system is used for asynchronous communication among the components in the identity authentication middleware.

The invention relates to the field of information security, in particular to a bilinear pairing hardware module design optimization method and device for an algorithm. The method comprises the following steps: dividing an algorithm into a plurality of independent executable modules, namely a modular operation layer, a bottom calculation logic layer and an advanced module layer; technical optimization is carried out on operation of a modular operation layer, a bottom calculation logic layer and an advanced module layer, and the number of modular operation times and the number of elliptic curve point operation times in bilinear pairing calculation are reduced. According to the method, bilinear pairwise calculation is decomposed into a plurality of independent modules through modular design, the modular operation times and the elliptic curve point operation times in the bilinear pairwise calculation are remarkably reduced, and therefore the overall calculation efficiency is improved.

This invention discloses an identity-based encryption method for multi-owner sharing. Multiple data owners distribute and manage a share of the master secret, using a Shamir threshold mechanism to achieve secure, distributed storage and use of the master secret. The user end non-interactively generates a complete user private key by aggregating partial keys from a threshold number of data owners. The encryption end generates ciphertext using the system public key and identity identifier, and the decryption end recovers the plaintext through bilinear pairing operations. This invention completely eliminates the single point of failure risk of traditional identity-based encryption, ensuring that the master secret does not need to be reconstructed throughout the key generation process, thus improving system security and efficiency. It is suitable for privacy protection scenarios such as distributed storage and blockchain.

In a method for authenticatable data transmission via a one-to-many communication channel from a provider device to a receiver device a first key pair comprising a first private key and a first public key and supporting bilinear pairings as well as one or more second key pairs are generated and stored, each second key pair comprising a respective second private key and a respective second public key and supporting bilinear pairings. One of the second key pairs is selected. One or more messages of a first type are obtained and a respective hash is generated for each of them. An authentication message is composed including the generated hashes and either the second public key of the selected second key pair or data adapted for deriving the second public key of the selected second key pair. The composed authentication message is signed employing the first private key for producing a signed aggregated authentication message, which is distributed to the receiver device. Thereafter, the one or more messages of the first type are distributed to the receiver device. Furthermore, one or more messages of a second type are obtained and signed employing the second private key of the selected second key pair for creating an associated signature, each second type message and the respective associated signature being distributed together to the receiver device.

The invention discloses a medical image file data management system, and belongs to the technical field of zero-knowledge proof. Comprising a verifiable zero-knowledge image fingerprint generation module, a multi-modal federal feature fusion training module, a dynamic contribution intelligent quantitative excitation module, a dynamic privacy calculation sandbox module, an intelligent diagnosis routing network module and an archive evaluation optimization module. Global features and local features of an original medical image are mapped into polynomials and encrypted through a hash function, fingerprints only containing feature parameters are generated, image content is prevented from being directly exposed, and original data are not leaked while fingerprint legality is ensured through calculation of a bilinear pairing function and an elliptic curve base point in a verification stage; and the block chain evidence storage further ensures that the fingerprints cannot be tampered.

The invention relates to a proxy re-encryption method and system. The system comprises a first user side, a second user side and a proxy server side, the method comprises the following steps: a first user side and a proxy server side generate a first shared secret; the second user side and the proxy server side generate a second shared secret; the first user side encrypts the plaintext to obtain an original ciphertext; the second user side generates a second random number, calculates a first intermediate parameter, sends the first intermediate parameter to the first user side, and sends the second random number to the proxy server side; the first user side calculates a second intermediate parameter and sends the second intermediate parameter to the proxy server side; and the proxy server side calculates a conversion parameter based on the first shared secret, the second shared secret, the second random number and the second intermediate parameter, converts the original ciphertext to obtain a new ciphertext, and sends the new ciphertext to the second user side for decryption. According to the method, bilinear pair calculation is avoided, only numerical multiplication calculation is used, and the processing performance is improved.

The invention discloses a traceable multi-signature method supporting a distributed aggregator and lightweight setting, which is characterized in that a decentralized signature generation mechanism is realized by adopting a cryptographic method comprising bilinear pairing, a linear homomorphic time lock, a cryptographic hash function and a BLS signature; the method specifically comprises the steps of system initialization, key generation, authorization generation and aggregation, prompt generation, partial signature and verification, authorization verification, signature aggregation, authorization revocation, signature verification and the like. Compared with the prior art, the method has a decentralized key generation mechanism, a distributed aggregator mechanism and a signature accountability function, so that high communication overhead caused by the use of a distributed key generation protocol and a single-point fault possibly caused by excessive dependence on a single aggregator are avoided; and meanwhile, a strong association mechanism between the signer and the final multiple signatures is established, and the signer is responsible for the signature behavior of the signer, so that the problems of low efficiency and high centralization of aggregators caused by dependence on a DKG protocol are effectively solved.

The invention relates to an SM2 ring signature method based on a constant-level signature size, a digital signature technology effectively ensures the authenticity, integrity and identity verifiability of communication data, but in the scenes of anonymous voting, anonymous payment and the like, a traditional digital signature leaks sensitive information. And the ring signature can hide the signer in the user group, so that the privacy of the signer can be effectively protected. Due to the fact that the size of most existing ring signatures and the number of ring members are in a linear increasing relation, research proposes that a bilinear pair accumulator is used for achieving constant-level ring signatures, and many constant-level ring signature schemes appear subsequently and are also achieved based on bilinear pairing. However, a standard elliptic curve used by the domestic password SM2 does not support bilinear pairing, and the constant-level ring signature of the SM2 cannot be realized, so that through the fusion design of the RSA accumulator and the SM2 signature, the constant signature size is realized while the compatibility of the domestic password algorithm is kept.

The application provides a multi-key inner product function encryption method and system. The scheme ensures that each user has different keys by embedding different eliminable random factors in the keys, and ensures the vector privacy of the vector calculation party by using secret sharing. Meanwhile, the scheme does not need to run complex homomorphic calculation and bilinear pair calculation, and has high overall running efficiency.

In a method for protecting payload data transmitted via a one-to-many communication channel from a provider device to at least one receiver device a public key set (PK) supporting asymmetric bilinear pairings is generated. A number of receiver device keys (DKi) that are generated based on the public key set (PK) are distributed to respective devices including the at least one receiver device. A provider key (K) is generated based on the public key set (PK) and inter alia on an encryption random number (t) and stored in the provider device. An envelope (ENV) is generated based on the public key set (PK) and on the encryption random number (t) and is distributed, via the one-to-many communication channel, to the respective devices including the at least one receiver device. The at least one receiver device generates a receiver key, which corresponds to the provider key, based on the distributed envelope (ENV) and the distributed receiver device key (DKi). The provider device encrypts and / or signs the payload data employing the provider key (K) for producing protected payload data and distributes them via the one-to-many communication channel to the respective devices. The at least one receiver device processes, e.g. by decrypting and / or authenticating, the protected payload data employing the receiver key.

The invention provides a multi-key inner product function encryption method and system, and the method comprises the steps: enabling each user to have different keys through embedding different random factors capable of being eliminated in a key, and guaranteeing the vector privacy of a vector calculation party through secret sharing; meanwhile, according to the scheme, complex homomorphic calculation and bilinear pairwise calculation do not need to be operated, and the overall operation efficiency is high.

The application discloses an identity authentication mode of a consortium chain in a strong permission control mode based on identification, calculates a user public key from a user identification and a set of public mathematical parameters by using an elliptic curve bilinear pair theory, the user public key comprises a user identification and a version number of the user on the consortium chain, wherein the user identification is used for identity authentication, and the version number is used for key update; and a user private key corresponding to the user public key is calculated from the user identification, the set of public mathematical parameters and a secret value in a domain range, and is uniformly generated by a key generation center and downloaded to the user. The application adopts the above identity authentication mode, does not need the participation of a trusted third party, effectively resists attacks of intermediaries, does not need to bind identity information and a public key by using a digital certificate, reduces the bandwidth occupied by the transmission of a certificate in an identity authentication process, improves identity authentication efficiency, and solves the problem of IBC key update.

The embodiment of the application discloses a kind of vehicle ad hoc network efficient aggregation anonymous verification method and related device, the method is verified based on the freshness of time stamp first, guarantee the freshness of time stamp from source;Then the validity of single signature is verified one by one, eliminate received invalid signature;Finally, aggregate signature verification is carried out, and the overall validity of all signatures can be verified by once bilinear pairing operation, compared with the verification of traditional method one by one, multiple bilinear pairing operations are needed, and the calculation complexity can be reduced.In high concurrency scene, processing delay is shortened from seconds to hundreds of milliseconds, which can effectively solve the problem of low efficiency of dynamic message authentication in Internet of Things, especially in vehicle networking, and meet the real-time demand.In addition, the application also introduces the smart contract and distributed digital identity verification technology of block chain, which can prevent malicious attacks of Internet of Things virus or node, and it is particularly important to improve privacy protection and prevent privacy leakage.

The invention discloses a data sharing method based on a bilinear pairing and linear secret sharing scheme, and relates to the technical field of information security, the method comprises the following steps: step 1, inputting security parameters, and generating a main public key and a main private key; step 2, generating an encryption key based on the main private key and an attribute set S of a sender; step 3, generating a decryption key based on the main private key and an access strategy of a receiver; step 4, generating a ciphertext by using the encryption key, the attribute set S of the sender, the access strategy R of the sender and a plaintext; 5, generating a trap door for strategy matching based on the main public key and the preference of the receiver; step 6, verifying the matching between the attribute of the sender and the strategy of the receiver, and forwarding the ciphertext only when the matching succeeds; and step 7, the receiving party reconstructs the plaintext by using the decryption key.

The present disclosure relates to an elliptic curve cryptography-based search method, device, equipment and storage medium; in the present scheme, after the cloud server receives the search trapdoor sent by a second user, the matching encrypted target document information is found, the auxiliary key corresponding to the second user in the authorized user list is used to pre-decrypt the encrypted target document information, the second user uses the user key to decrypt the target document identifier, and the cloud server returns the corresponding target encrypted document to the second user; the second user decrypts the clear text document; it can be seen that the present scheme does not involve bilinear pair operation when searching, and the search efficiency is improved; in the present scheme, the private key is divided into two parts of keys, which are used by the cloud server and the second user respectively, the decryption permission of each user can be flexibly controlled, when the user is revoked, only the corresponding information needs to be deleted from the authorized user list, the revocation cost is small, and other users are not affected, nor is the existing ciphertext data affected.