KR20130135018A - Encryption and decryption method and signature method based on method for generating secret key, and recording medium storing program for executing method of the same in computer - Google Patents

Abstract

Disclosed are encryption and decryption method and signature method based on a private key generation method. An arbitrary random value (r) is selected, a message is encrypted and an encrypt (U, V)(U = g^r, V = m·(S_UID)^r) generated and transmitted by using a user ID (U_ID), which receives an encrypted message, as a public key. The message is decoded using a private key (sk_UID,) corresponding to the U_ID which received the encrypted message. According to the present invention, a client stage is lightened, and the efficiency of private key generation is improved by layering a generation unit. Also, the layered private key generation unit is able to be applied to various fields by appropriately mixing the layered private key generation unit. [Reference numerals] (110) Root private key generation unit;(120) Sub private key generation unit;(AA) Parameter = (N, G, g, H);(BB) Root master key (mk_Root) = (p,q);(CC) Parameter = (G_ID, n, H^I,(g_1,g_2,···,g_n)) (But, g_i = H(G_ID, i)), a first sub master key set (mk_G_ID) = (x_1,x_2,···,x_n) (But, g_i = g^x_i);(DD) User (U_i) → H^I(U_i) = b_i1 || b_i2 || ··· || b_in, user (U_i) private key (sk_ui) = 誇^n_j=1 � _jb_ij;(EE) User 1 (u_1);(FF) User 2 (u_2);(GG) User n (u_n);(HH) User x (u_x)

Description

Encryption and decryption method and signature method based on method for generating secret key, and recording medium storing program for executing method of the same in computer}

The present invention relates to an encryption / decryption method and a signature method based on a secret key generation method, and a recording medium recording a program for executing the method on a computer. More specifically, the secret key generation unit is layered to create a secret key. An encryption / decryption method and a signature method based on a secret key generating device method to be generated, and a recording medium recording a program for executing the method on a computer.

Recently, due to the development of computer technology and the rapid expansion of communication network, security issues regarding computer-related resources and transmitted data are emerging as a big issue. As an alternative to solve this problem, a password-based system is used. The most important contributing system to date is the public key cryptosystem, which requires authentication of the user's public key in advance and the revocation of the problem certificate before the end of its validity period. Difficulties arise. Therefore, an ID (ID) based encryption system based on an individual's identity (ID) has been proposed.

Public key-based cryptosystems follow a method of first determining a secret key and then calculating the public key. On the other hand, the ID-based encryption system first selects an ID and calculates a secret key from it, and a private key generator (PKG) calculates a secret key from the ID and issues it through a secret channel.

The conventional ID-based cryptosystem has a disadvantage that the process performed at the client end is slow, and a new ID-based cryptosystem based on a TDL (Trapdoor Discrete Logarithm) has been proposed, but this also has a disadvantage of slow secret key issuance. Therefore, the present invention is to propose a new technology that can be equipped with both the efficiency of the user terminal (client stage) and the efficiency of key issuance.

Looking at the related art in detail, Korean Laid-Open Publication No. 2005-0037723 (name of the invention: a method for distributing a conference session key in a cryptographic system based on identity information) selects two different temporary secret keys and displays a message. Disclosed is a method for providing a protocol that uses a temporary secret key of a session initiation object when generating and generating variables for generating a session key. It consists of implementing an identity-based cryptographic system and a key sharing protocol phase, and the identity-based cryptographic system consists of a system that provides a signature. The present invention is intended to shorten the secret key generation time of the sub-secret key generation unit by stratifying the subject generating the secret key, which is different from the prior art.

In addition, Korean Laid-Open Patent Publication No. 2011-0117169 (name and method for performing an ID-based authentication key protocol) discloses an ID-based authentication key agreement protocol that does not suffer from cryptographic key escrow. This is related to the ID-based authentication key agreement protocol, which is different from the present invention which stratifies the secret key generation subject.

The technical problem to be achieved by the present invention, the encryption and decryption method and the signature method based on the secret key generation method that can ensure the light weight of the client end and the efficiency of secret key generation by layering the secret key generation unit of the ID-based encryption technology To provide. In addition, the hierarchical secret key generation unit can be mixed to suit each purpose so as to be utilized in various fields.

)를 토대로

을 이용하여 메시지를 복원하는 단계;를 포함하며, 상기 사용자 아이디에 대응되는 비밀키는, 루트 마스터 키와 소정의 루트 파라미터를 설정하고 비밀키를 발급할 수 있는 사용자의 수(n)를 설정하여 제1 해쉬 함수를 이용하여 소정의 서브 파라미터를 계산하고 상기 루트 파라미터, 서브 파라미터를 이용하여 상기 설정된 사용자의 수(n)만큼 비밀키 발급이 가능한 제1서브 마스터 키 세트를 생성하고 상기 사용자 아이디에 대해 제2 해쉬 함수를 이용하여 비트 리프리젠테이션 값을 도출하고 상기 제1서브 마스터 키 세트와 선형 결합하여 생성되는 것을 특징으로 한다. The encryption and decryption method according to the present invention for achieving the above technical problem, (e) using a user ID (U _ID ) receiving the encrypted message as a public key to select a random random value (r) to encrypt the message Generating and transmitting cipher texts U and V (U = g ^r , V = m · (S _UID ) ^r ); And (f) a secret key (sk _UID , corresponding to the user ID (U _ID ) receiving the encrypted message).

Based on

Restoring the message using a message, wherein the private key corresponding to the user ID includes: setting a root master key and a predetermined root parameter and setting a number n of users who can issue the secret key; Compute a predetermined sub-parameter using a first hash function and generate a first sub-master key set capable of issuing a private key by the set number n of the user by using the root parameter and the sub-parameter, and assigns to the user ID. Deriving the bit representation value using a second hash function for the first sub-master key set is generated by linearly combining.

)를 토대로 임의의 랜덤 값(r)을 선택하여 e=H₂(g^r,m)을 계산하여 서명(σ_UID,m, σ_UID,m=(g^r, r-e·sk_UID))을 생성하는 단계; 및 (h) 상기 생성된 서명(σ_UID,m=(U, V))을 수신한 경우, 송신자의 상기 사용자 아이디(U_ID)를 이용하여 U=g^V·(S_UID)^{H3 (U,m)}를 토대로 상기 서명의 유효성을 검증하는 단계;를 포함하며, 상기 사용자 아이디에 대응되는 비밀키는, 루트 마스터 키와 소정의 루트 파라미터를 설정하고 비밀키를 발급할 수 있는 사용자의 수(n)를 설정하여 제1 해쉬 함수를 이용하여 소정의 서브 파라미터를 계산하고 상기 루트 파라미터, 서브 파라미터를 이용하여 상기 설정된 사용자의 수(n)만큼 비밀키 발급이 가능한 제1서브 마스터 키 세트를 생성하고 상기 사용자 아이디에 대해 제2 해쉬 함수를 이용하여 비트 리프리젠테이션 값을 도출하고 상기 제1서브 마스터 키 세트와 선형 결합하여 생성되는 것을 특징으로 한다. Signature method according to the present invention for achieving the above another technical problem, (g) a secret key (sk _UID , corresponding to the user ID (U _ID ))

Select a random value r and compute e = H ₂ (g ^r , m) to generate a signature (σ _{UID, m} , σ _{UID, m} = (g ^r , re · sk _UID )). Making; And (h) the generated signature _{(σ UID, m = (U} , V)) when receiving, using the user ID of the sender ^{_{(U ID) U = g V}} · (S UID) H3 (U, ^m) verifying the validity of the signature, wherein the secret key corresponding to the user ID includes the number of users who can set a root master key and a predetermined root parameter and issue a secret key (n ) To calculate a predetermined sub-parameter using the first hash function, and to generate a first sub-master key set capable of issuing a secret key for the set number of users (n) using the root parameter and the sub-parameter. And a bit representation value is derived for the user ID by using a second hash function and is linearly combined with the first sub master key set.

According to the encryption / decryption method and signature method based on the secret key generation method according to the present invention, it is possible to reduce the weight of the client end and efficiency of secret key generation through the layering of the secret key generation unit. In addition, the hierarchical secret key generation unit may be mixed for each purpose and utilized in various fields.

1 is a block diagram showing the configuration of a secret key generating device according to the present invention;
2 is a view briefly illustrating a principle of implementing a secret key generation method according to the present invention;
3 to 4 are diagrams illustrating a process of decrypting and decrypting a signature and generating and transmitting a signature based on a secret key generated by a secret key generation method according to the present invention; and
5 is a diagram illustrating a secret key generation method according to the present invention.

Hereinafter, with reference to the accompanying drawings will be described in detail a preferred embodiment of the apparatus and method for secret key generation according to the present invention.

FIG. 1 is a block diagram showing the configuration of a secret key generating apparatus 100 according to the present invention, and FIG. 2 is a diagram briefly showing the principle of implementing a secret key generating method according to the present invention. Referring to FIG. 1, the secret key generating apparatus 100 may include a loop secret key generating unit 110 and a sub secret key generating unit 120.

The secret key generating device 100 generates a secret key corresponding to the user ID. The secret key generating apparatus 100 according to the present invention has a layered secret key generating unit which includes a root secret key generating unit 110 and a sub secret key generating unit 120.

를 만족하는 B-스무스(smooth)인 소수로 정의할 수 있다. 루트 마스터 키(mk_Root, (p, q))는 서브 비밀키 생성부(120) 또는 루트 비밀키 생성부(110)로부터 직접 비밀키를 발급받는 사용자들에게 비밀키를 생성해 줄 수 있는 마스터 비밀 정보를 갖고 있다. 따라서 도 2를 참조하면, 루트 비밀키 생성부(110)는 사용자(x)에게 직접 사용자(x) 아이디에 대응하는 비밀키를 생성하여 제공할 수 있다. 이러한 경우, 루트 비밀키 생성부(110)는 사용자로부터 사용자 아이디를 전송받아 사전 계산 테이블 데이터를 참조하여 이산 로그 값을 도출하여 사용자에게 비밀키를 발급한다. The root secret key generation unit 110 holds a root master key (mk _Root ) capable of generating a secret key. At this time, the root master key (mk _Root ) may be of the form (p, q), where p and q are

It can be defined as a prime number that is B-smooth. The root master key (mk _Root , (p, q)) is a master that can generate a secret key to users who receive a secret key directly from the sub secret key generator 120 or the root secret key generator 110. Has secret information Therefore, referring to FIG. 2, the root secret key generation unit 110 may generate and provide a secret key corresponding to the user (x) ID directly to the user (x). In this case, the root secret key generation unit 110 receives the user ID from the user, derives a discrete log value by referring to the pre-calculated table data, and issues the secret key to the user.

인 합성수, G는 Z_N(Z_N={0,1,...n-1}, 유한환)의 최대 순환 부분군, g는 G의 생성원을 말한다. H₁은 제1 해쉬 함수로 {0,1}^*→G로 정의되는 풀 도메인 해쉬 함수 일 수 있으며, 서브 비밀키 생성부(120)나 루트 비밀키 생성부(110)로부터 직접 비밀키를 발급받는 사용자의 아이디를 입력값으로 하여 이산로그를 풀 수 있는 군 G로 매핑하는 함수이다. 그리고 H₂는 제2 해쉬 함수로 {0,1}*→Z_N로 정의되는 랜덤 해쉬 함수일 수 있으며, 후술할 서명 방법에서 랜덤 해쉬 함수로 사용될 수 있다. 이러한 루트 비밀키 생성부 파라미터(N, G, g, H₁, H₂)는 본 아이디 기반 암호화 시스템(100)을 운용하기 위해 공개되는 시스템 파라미터이고, 서브 비밀키 생성부(120) 또는 본 아이디 기반 암호화 시스템을 사용하는 사용자들에게 비밀키를 제공할 수 있는 연산 과정에 이용된다. In addition, the root secret key generator 110 sets the root secret key generator parameters (N, G, g, H ₁ , H ₂ ), and each parameter may be defined as follows. N is

Phosphorus synthesis number, G is the largest cyclic subgroup of Z _N (Z _N = {0,1, ... n-1}, finite ring), g refers to the source of G. H ₁ may be a full domain hash function defined as {0,1} ^* → G as the first hash function, and issue a secret key directly from the sub secret key generation unit 120 or the root secret key generation unit 110. It is a function that maps the group G that can solve the discrete log with the ID of the receiving user as an input value. H ₂ may be a random hash function defined as {0,1} * → Z _N as a second hash function, and may be used as a random hash function in a signature method to be described later. These root secret key generation parameters (N, G, g, H ₁ , H ₂ ) are system parameters that are open to operate the ID-based encryption system 100, sub-secret key generation unit 120 or this ID It is used in the operation process that can provide the secret key to users who use the based encryption system.

The root secret key generation unit 110 limits the number of preset presets to the sub secret key generation unit 120 having the authority to issue a secret key corresponding to the user ID using the root master key and predetermined parameters. Issue a first sub-master key set that can generate a secret key within. Root private key generator 110 for this purpose are from the sub-secret key generation unit 120, the sub-secret key generation unit ID (G _ID) and service users (n) to receive the information sub secret key generation unit ID (G _ID Perform authentication on). This authentication can be done in an undisclosed channel (secret channel).

Referring to FIG. 5, if the root secret key generation unit 110 performs authentication on the sub secret key generation unit ID (G _ID ) described above, the sub secret key generation unit ID (G _ID ) and the number of service users are recognized. (n) a (G _ID, n) by performing a predetermined hash function as an input value and calculates the discrete logarithm of the result shown. In this case, n discrete log values are obtained as a result of performing a hash function with a total of n items from (G _ID , 1) to (G _ID , n). The discrete log values are the first sub master key set (mk _GID ), and the root secret key generator 110 uses the first sub master key set (mk _GID ) as the sub secret key generator 120 to establish a secret channel. Will be sent through. Where mk _GID is (x ₁ , x ₂ , ..., x _n ), where g _i = g ^xi and x _i = log _g g _i (1 ≦ _i ≦ n).

를 계산하여 서브 비밀키 생성부 파라미터(g_i, 1≤i≤n)를 생성할 수 있다. 여기서 H₁은 제1 해쉬 함수로 {0, 1}^*→G로 정의되는 풀 도메인 해쉬 함수 일 수 있고, G_ID는 서브 비밀키 생성부(120)의 아이디를 의미한다. In this case, the predetermined hash function may use a full domain hash function.

The sub secret key generator (g _i , 1 ≦ _i ≦ n) may be generated by calculating. Here, H ₁ may be a full domain hash function defined as {0, 1} ^* → G as the first hash function, and G _ID may indicate an _ID of the sub secret key generation unit 120.

The sub secret key generation unit 120 receives the first sub master key set, generates a secret key corresponding to the user ID within a preset number of users, and issues the same to the user. The sub secret key generation unit 120 may be set for each service provider. Here, the service provider may be various applications implemented on the mobile terminal, but is not limited thereto.

)를 계산하여 사용자에게 공개되지 않은 채널(비밀채널)을 통해 전송한다. 여기서, H₃는 제3 해쉬 함수로 {0,1}^*→{0,1}ⁿ로 정의되는 랜덤 해쉬 함수일 수 있다. 이때, 랜덤 해쉬 함수(H3) 결과 값은 계산상의 편의성을 위해 w-스파스(sparse)한 형태로 b_i(1≤i≤n) 중 w 개(1≤i≤n)만 '0'이 아닌 값, 즉, '1'이 되도록 할 수 있다. The sub secret key generation unit 120 derives a bit representation value using a predetermined hash function for the user ID assigned to the sub secret key generation unit, and linearly combines with the first sub master key set to correspond to the user ID. The secret key is derived and sent to the user. That is, the sub-secret key generating unit 120 for the user name (U _ID) using a random hash function _{(H 3) H 3 (U} ID) = b 1 b 2 ... Calculate b _n (binary representation, i.e., b _i ∈ {0, 1}), and calculate the calculated values (b ₁ , b ₂ ,…, b _{n )} with the first sub-master key (x ₁ , x ₂ , ..., x _n) and the linear combination the secret key corresponding to the user identity (U _ID) (sk _UID,

) Is transmitted over a channel (secret channel) that is not available to the user. Here, H ₃ may be a random hash function defined as {0,1} ^* → {0,1} ⁿ as the third hash function. At this time, the result of the random hash function (H3) is w-sparse for convenience of calculation, and only w (1≤i≤n) of b _i (1≤i≤n) is '0'. It can be set to a non-value, that is, '1'.

Accordingly, in the case of the ID-based encryption technology defined in the conventional TDL group, the discrete log result is derived by referring to a pre-computation table. However, the present invention provides a method of sub-secret key generation unit 120. The secret key can be generated by bit summation calculation, which reduces the secret key generation time.

When the sub-secret key generation unit 120 issues a secret key to a user in excess of a preset number of users, there is a fear that the secret key is exposed cryptographically. Accordingly, when the private key is to be provided in excess of a preset number, the sub secret key generator 120 may request the root secret key generator 110 to issue an additional sub master key set. When the root secret key generation unit 110 receives a sub master key set issuance request from the authenticated sub secret key generation unit 120, a second sub master key set that can generate as many private keys as the number of requested users. May be generated and provided to the sub secret key generation unit 120. In this case, the charging unit (not shown) may charge for the second sub master key set. Charging can be set in proportion to the number of users who can issue a private key and can be set in the form of the number of users * unit price. The charging unit (not shown) may be included in the loop secret key generation unit 110 and may exist independently. Through this type of billing, the sub-secret key generation unit 120 cannot arbitrarily increase the number of users without the permission of the root secret key generation unit 110, so that the billing system can be clearly established.

An encryption / decryption device (not shown) and a signature device (not shown) may be implemented based on the secret key generation device 100. The encryption / decryption apparatus may have an encryption unit and a decryption unit, and the signature apparatus may have a signature generation unit and a signature verification unit.

을 계산한다. 송신자는 송신자 및 수신자(U_ID)가 포함된 서브 비밀키 생성부(120)의 공개된 시스템 파라미터와 비트 리프리젠테이션 값을 이용하여

를 연산한다. 송신자는 임의의 랜덤 값(r)을 선택하여 메시지(m)에 대한 암호문(g^r, m·(S_UID)^r)을 생성하여 이를 수신자(U_ID)에게 전송한다. When the encryption unit transmits an encrypted message to the user whose user ID is U _ID for the message m, the sender first calculates a hash function using the user ID (U _ID ) as an input value, thereby bit-representing the U _ID .

. The sender uses the public system parameters and bit representation values of the sub-secret key generation unit 120 including the sender and the receiver (U _ID ).

. The sender selects a random random value ^r , generates a cipher text g ^r , m · (S _UID ) ^r for the message m, and sends it to the receiver U _ID .

를 이용하여

를 계산한다. 이때, 정상적인 암호화 과정을 통해 생성된 암호문이라면 U=g^r, V=m·(S_UID)^r이고, U_ID에 대응되는 정당한 비밀키를 소유한 사용자라면 비밀키(

)는

의 밑(base)을 g로 하는 이산로그 값(즉,

)이므로, 상기

를 계산한 결과는 메시지 m과 같다. The decryption unit of the user (U _ID ) receiving the encrypted message receives a pair of ciphertexts (U, V) consisting of two elements of the ring Z _N. The user (U _ID ) is a secret key issued in response to the user ID (U _ID ) from the sub-secret key generation unit 120 that includes it

Using

. At this time, if the ciphertext generated through the normal encryption process, U = g ^r , V = m · (S _UID ) ^r, and if the user owns the legitimate secret key corresponding to the U _ID , the secret key (

)

Discrete logarithm to base of g (i.e.

), So

The result of calculating is equal to the message m.

)를 토대로 임의의 랜덤 값(r)을 선택하여 e=H₂(g^r,m)을 계산하여 서명(σ_{UID ,m}, σ_{UID ,m}=(g^r, r-e·sk_UID))을 생성한다. 서명 검증부는 생성된 서명 (σ_{UID ,m}=(U, V))에 대해, 서명을 수신한 수신한 수신자는 송신자의 아이디(U_ID)를 이용하여 g^V·(S_UID)^{H3 (U,m)}를 계산하고 이 값이 U와 같은지 확인(U=g^V·(S_UID)^{H3 (U,m)}성립 여부 확인)하여 서명의 유효성을 검증한다. 여기서, m은 메시지, r은 임의의 랜덤 값으로 r∈Z_N,

이다. Signature generation unit secret key (sk _UID , corresponding to the user ID)

Select a random random value r and compute e = H ₂ (g ^r , m) to generate a signature (σ _{UID , m} , σ _{UID , m} = (g ^r , re · sk _UID )). do. For the generated signature (σ _{UID , m} = (U, V)), the signature verification unit uses the sender's ID (U _ID ) to receive the signature g ^V · (S _UID ) ^{H3 (U, m)} and verify that the value is equal to U (U = g ^V · (S _UID ) ^{H3 (U, m) is} established) to validate the signature. Where m is the message, r is any random value, r∈Z _N ,

to be.

3 to 4 illustrate a process of decrypting and decrypting a signature and generating and transmitting a signature based on a secret key generated by the secret key generation method according to the present invention, and FIG. 5 illustrates a secret key generation method according to the present invention. Figure is shown.

3 to 5, a sub-secret having the authority to issue a secret key within a preset limit by setting a root master key capable of generating a secret key and setting a predetermined root parameter. A root secret key generation unit 110 for issuing a first sub master key set capable of generating a secret key within a limited number to the key generation unit 120 is set up (S310 and S410).

In addition, by setting the number of users to have the authority to issue a secret key in advance, a sub-secret key that is provided to the first sub master key set, generates a secret key corresponding to the user ID within a preset number, and issues it to the user. Setup unit 120 is set up (S320, S420).

The root secret key generation unit 110 receives the ID of the sub secret key generation unit and the number of users set in advance from the sub secret key generation unit parameters, and authenticates the sub secret key generation unit IDs (S330 and S430). The first sub master key set obtained by calculating the discrete log values of the output values obtained by performing the function is transmitted to the sub secret key generation unit 120 (S340 and S440). If authentication for the sub secret key generation unit fails, issuance of the sub master key set for the sub secret key generation unit 120 is stopped.

The sub secret key generation unit 120 derives a bit representation value using a predetermined hash function for the user ID assigned to the sub secret key generation unit 120 and linearly combines the first sub master key set with the user. The secret key corresponding to the ID is derived and transmitted to the user (S350 and S450).

When the encryption / decryption technique is implemented based on the secret key issuing method, the message is encrypted and transmitted using the receiver ID (S360). When the encrypted message is received, the cipher text is decrypted using the secret key corresponding to the receiver ID (S370). In addition, when the signature technology is implemented based on the secret key issuing method, the signature is generated and transmitted using the secret key corresponding to the user ID to which the message is to be transmitted (S460). In addition, the received signature is verified whether the user ID and the message that transmit the message are valid (S470).

The present invention can also be embodied as computer-readable codes on a computer-readable recording medium. A computer-readable recording medium includes all kinds of recording apparatuses in which data that can be read by a computer system is stored. Examples of the computer-readable recording medium include a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like, and a carrier wave (transmission via the Internet). In addition, the computer-readable recording medium may be distributed to a computer system connected to a wired / wireless communication network, and a computer-readable code may be stored and executed in a distributed manner.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation in the embodiment in which said invention is directed. It will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the appended claims.

100: secret key generator 110: root secret key generator
120: sub secret key generation unit

Claims (4)

(e) Encrypt the message by selecting a random random value (r) using the user ID (U _ID ) receiving the encrypted message as the public key (U = V ^r (U = g ^r , V = m ·) Generating and transmitting (S _UID ) ^r ); And
(f) A secret key (sk _UID , corresponding to the user ID (U _ID ) receiving the encrypted message)

Based on

Restoring the message using;
In the secret key corresponding to the user ID, a root master key and a predetermined root parameter are set, and a number n of users who can issue the secret key is set to calculate a predetermined subparameter using the first hash function. Generate a first sub-master key set capable of issuing a secret key as many as the set number of users (n) using the root parameter and the sub-parameter, and use a second hash function for the user ID. Decryption method and generated by linear combination with the first sub master key set:
Where r is any random value r∈Z _N , U = g _r , V = m · (S _UID ) ^r ), m is an encrypted message, m 'is a decrypted message, g is the origin of G, G Is the largest cyclic subgroup of Z _N (Z _N = {0,1, ... N-1} finite rings),

to be. (g) The secret key (sk _UID , corresponding to the user ID (U _ID ))

Select a random random value r and compute e = H ₂ (g ^r , m) to generate a signature (σ _{UID , m} , σ _{UID , m} = (g ^r , re · sk _UID )). Making; And
(h) When the generated signature (σ _{UID, m} = (U, V)) is received, U = g ^V · (S _UID ) ^{H3 (U, m} ) using the sender's user ID (U _ID ). It ^includes,;) based on the step of verifying the validity of the signature
In the secret key corresponding to the user ID, a root master key and a predetermined root parameter are set, and a number n of users who can issue the secret key is set to calculate a predetermined subparameter using the first hash function. Generate a first sub-master key set capable of issuing a secret key as many as the set number of users (n) using the root parameter and the sub-parameter, and use a second hash function for the user ID. And derive a linear combination with the first sub master key set.
Where m is the message, r is any random value, r∈Z _N , g is the source of G, G is the maximum cycle of Z _N (Z _N = {0,1, ... N-1} finite rings) Subgroup, H _3, is a random hash function defined by {0,1} ^* → {0,1} ⁿ , and

to be. A computer-readable recording medium having recorded thereon a program for executing the encryption / decryption method according to claim 1 on a computer. A computer-readable recording medium having recorded thereon a program for executing the signature method of claim 2 on a computer.

Images