A Time-controlled Encryption Security Enhancement Method Based on Random Oracle Model
A technology of time control and encryption security, which is applied to key distribution, can solve the problems of security degradation, achieve security enhancement, enhance security and effectiveness, and meet the effect of anti-quantum requirements
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] The implementation of the present invention provides a time-controlled encryption security enhancement method (abbreviated BDH-ES-TRE) based on a random oracle model, including:
[0053] S101: The time server generates system parameters and time server public-private key pairs according to the given security parameter k and randomly selected generators;
[0054] S102: The system user generates his own user public key according to the public parameters issued by the time server;
[0055] Specifically, the public parameters mentioned in this step belong to the system parameters generated in step S101 and the parameters that can be public in the public-private key pair of the time server.
[0056] S103: The sender runs the preset encryption algorithm to obtain the ciphertext according to the given message to be sent, user public key, time server public key and release time, and sends the ciphertext to the receiver;
[0057] S104: The time server generates a random number,...
Embodiment 2
[0061] On the basis of the above-mentioned embodiment 1, the embodiment of the present invention provides a time-controlled encryption security enhancement method based on a random oracle model, including the following steps:
[0062] S201: Run the Setup algorithm: Given a security parameter k, the algorithm outputs system parameters params={k,q,G 1 ,G 2 ,e,P,H 1 ,H 2 ,n} and time server public-private key pair (ts pub ,ts priv ). Among them, G 1 is the additive group of elliptic curve discrete logarithms over finite fields, G 2 is the finite field discrete logarithm multiplicative group, G 1 with G 2 The order is a prime number q, and the mapping e:G 1 ×G 1 →G 2 is a bilinear map; the Hash function H 1 :{0,1} * →G 1 , H 2 :G 2 →{0,1} n , where n is the length of the plaintext; the time server randomly selects the generator time server private key Its corresponding public key ts pub = (P, sP), params and ts pub is a public parameter.
[0063] S202: Run ...
Embodiment 3
[0077] On the basis of the above-mentioned embodiment 1, the embodiment of the present invention provides a time-controlled encryption security enhancement method based on a random oracle model. Before introducing the method provided by the embodiment of the present invention, the following definition is made first: ξPKE=(Setup, Enc ,Dec) is a public key encryption algorithm, where:
[0078] Setup: generate the system public key and the user's public-private key pair (upk, usk) = (uP, u), P is for G 1 generator, G 1 is an additive group.
[0079] Enc: Use the user public key uP to encrypt the plaintext to obtain the ciphertext C PKE =Enc(M,uP).
[0080] Dec: Use the user's private key u to decrypt the plaintext, and get the plaintext M=Dec(C PKE ,u).
[0081] The PKE encryption schemes appearing in the present invention all default to the defined generalized public key encryption scheme, and the algorithms in the PKE scheme are represented by PKE.Setup, PKE.Enc and PKE....
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


