Cryptographic system, key generation device, encryption device, decryption device, method and program
The cryptographic system efficiently handles any conditional expression in attribute-based encryption without increasing ciphertext or secret key size, addressing inefficiencies in existing methods and improving computational performance.
Patent Information
- Application Number
- JP2023039565
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2023-03-14
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2039-07-10
AI Technical Summary
Existing attribute-based encryption methods, such as the OT method, are inefficient in operation and difficult to perform key generation, encryption, and decryption, especially on devices with limited computational resources, and require increased ciphertext or private key sizes to handle policies with multiple occurrences of the same attribute labels.
A cryptographic system that generates public and private keys using bilinear groups, allowing any conditional expression as a policy without increasing the size of the ciphertext or secret key, utilizing linear secret sharing and bilinear maps to efficiently perform encryption and decryption.
Enables efficient attribute-based encryption capable of handling any conditional expression without enlarging the ciphertext or secret key, reducing computational overhead and accelerating encryption, key generation, and decryption processes.
Smart Images

Figure 0007586210000065 
Figure 0007586210000066 
Figure 0007586210000001
Abstract
Description
[Technical field]
[0001] The present invention relates to a cryptosystem, a key generation device, an encryption device, a decryption device, a method, and a program. [Background technology]
[0002] Attribute-based encryption is known as an encryption method that allows complex decryption control. Attribute-based encryption is mainly divided into two types: key policy attribute-based encryption and ciphertext policy attribute-based encryption. In key policy attribute-based encryption, attribute information is embedded in the ciphertext in addition to the plaintext, and a policy (a sort of conditional expression for the attributes) is embedded in the private key. When the ciphertext is decrypted with the private key, it can be decrypted only if the attributes embedded in the ciphertext satisfy the policy embedded in the private key. On the other hand, ciphertext policy attribute-based encryption is the counterpart of key policy attribute-based encryption, in which a policy is embedded in the ciphertext and attribute information is embedded in the private key.
[0003] One of the important properties of attribute-based encryption is the expressiveness of the policy. The expressiveness of the policy generally refers to how finely the decryption conditions can be described. The more finely the decryption conditions can be described, the higher the expressiveness of the policy. In general, policies are often expressed as logical expressions. For example, they are expressed as "(position = manager) and (department = general affairs department)". This is a policy that allows decryption only if the person has the attribute of manager as a position and the attribute of general affairs department as a department.
[0004] One of the items related to the expressive power of a policy is whether or not it can handle negation in a conditional expression. That is, for example, whether or not it can handle a conditional expression such as "(position = manager) and (department ≠ general affairs department)". The OT method is known as an encryption method that can express a conditional expression including negation in this way and does not impose restrictions on the size of the attribute set or policy within the method (for example, see Non-Patent Document 1). [Prior art documents] [Non-patent literature]
[0005] [Non-Patent Document 1] Okamoto T., Takashima K. (2012) Fully Secure Unbounded Inner-Product and Attribute-Based Encryption. In: Wang X., Sako K. (eds) Advances in Cryptology - ASIACRYPT 2012. ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658. Springer, Berlin, Heidelberg Summary of the Invention [Problem to be solved by the invention]
[0006] While the OT method is excellent in terms of its high expressiveness and the fact that there are no restrictions on the size of attribute sets or policies, it is inefficient in operation and may require time for key generation, encryption, decryption, etc. Attribute-based encryption can also be applied to smartphones, etc., and it is desirable for it to operate within a practical time even on devices with relatively small computing resources.
[0007] Furthermore, in order to handle policies that contain many identical attribute labels, the OT method needs to increase the number of elements on the side where attributes are embedded in proportion to the maximum number of occurrences of the same attribute label. For example, considering a conditional expression such as "((job title = manager) and (department = general affairs department)) or ((job title = section manager) and (department = accounting department))," the attribute labels "job title" and "department" are each included twice in this conditional expression. In order to handle such a conditional expression, the size of the ciphertext in key policy attribute-based encryption (private key in ciphertext policy attribute-based encryption) needs to be doubled compared to the original OT method. In order to handle a conditional expression in which the same attribute label appears more frequently, the size of the ciphertext or private key must be made larger.
[0008] An embodiment of the present invention has been made in consideration of the above points, and aims to realize efficient attribute-based encryption that can use any conditional expression as a policy without increasing the size of the ciphertext or secret key. [Means for solving the problem]
[0009] In order to achieve the above-mentioned object, the cryptographic system according to this embodiment is characterized by comprising: a setup means for generating a public key and a master private key used in attribute-based encryption; an encryption means for taking as input at least one of the public key, an attribute, and a policy expressed by an arbitrary conditional expression related to the attribute, and generating at least a ciphertext in which one of the attribute and the policy is embedded; a key generation means for taking as input the public key, the master private key, and the other of the attribute and the policy different from the one of the attribute and the policy, and generating a private key in which the other is embedded; and a decryption means for decrypting the ciphertext by taking as input the public key, the ciphertext, and the private key. Effect of the Invention
[0010] Any conditional expression can be used as a policy without increasing the size of the ciphertext or secret key, making it possible to realize efficient attribute-based encryption. [Brief description of the drawings]
[0011] [Figure 1] FIG. 1 is a diagram illustrating an example of an overall configuration of a cryptographic system according to an embodiment of the present invention. [Diagram 2] 2 is a diagram illustrating an example of the hardware configuration of a key generation device, an encryption device, and a decryption device according to the present embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] Hereinafter, an embodiment of the present invention (hereinafter also referred to as "the present embodiment") will be described. In the present embodiment, a cryptosystem 1 that realizes attribute-based encryption that can use any conditional expression as a policy without increasing the size of the ciphertext or private key and that operates efficiently will be described.
[0013] <Preparation> First, notations, concepts, etc. necessary for explaining this embodiment will be described.
[0014] ·notation Let p be a prime number and let the field Z / pZ be Z p The set of all bit strings of finite length is denoted as {0,1} * For example, let n be a natural number, and let the set of all bit strings of length n be {0,1} n This is expressed as:
[0015] For a natural number n, {1, , n} is represented as [n]. Let S be a set, and uniformly selecting s from set S is represented as s←S. For matrices A1 and A2 with the same number of rows, the concatenation of A1 and A2 is
[0016]
number
[0017] Let i∈{1,2,T}, and Z p The matrix A:=(a j,l ) j,l For a cyclic group G of order p i In the above matrix, the (j,l) element is
[0018]
number
[0019]
number
[0020]
number
[0021]
number
[0022] Logical formula A logical formula is an expression in which Boolean variables are connected with "AND", "OR", and "NOT". A logical formula can be easily converted into a logical circuit with a fan-in of 2 and a fan-out of 1. A logical formula that does not contain negation (NOT) is called a monotone Boolean formula, and a logical formula that contains negation (NOT) is called a non-monotone Boolean formula. In this embodiment, it is assumed that the logical formula is represented by a logical circuit.
[0023] Attributes and policies In this embodiment, the set of attributes is defined by the following formula (1).
[0024]
number
[0025] Moreover, a set of policies is defined by the following formula (2).
[0026]
number
[0027]
number
[0028] In the attribute-based encryption described in this embodiment, each attribute is an element of the set defined by the above formula (1), and each policy is an element of the set defined by the above formula (2).
[0029] Also, the attribute
[0030]
number
[0031]
number
[0032] For attribute x and policy y, b = (b1, , b n )∈{0,1} n is defined by the following equation (3).
[0033]
number
[0034]
number
[0035]
number
[0036]
number
[0037] Note that the above formulas (1) and (2) are notations in the case of key policy attribute-based encryption, and in ciphertext policy attribute-based encryption, the definitions of the set of attributes and the set of policies are reversed.
[0038] ·Linear secret sharing In this embodiment, a linear secret sharing scheme is used. The linear secret sharing scheme uses a function f:{0,1} n →{0,1} and assign secret vector k to σ1, σ n This method distributes the secret vector k to the bit string b. If we collect the distributions that correspond to the bits of the bit string b that satisfy f(b)=1, the original secret vector k can be restored. In other words, there exists a set S that can be easily calculated from f and b,
[0039]
number
[0040] The linear secret sharing scheme is realized by the following algorithms (S1) to (S4). Here, the input of the linear secret sharing scheme is a monotonic logical formula f:{0,1} n →{0,1} and the secret vector
[0041]
number
[0042] (S1) A vector σ is applied to the output line of the monotonic logic formula f represented by a logic circuit (i.e., the output line of the logic circuit). out Set :=k.
[0043] (S2) The input lines of each AND gate in the logic circuit are a and b, and the output line is c. Then, vector σ c For each AND gate with , the vector
[0044]
number
[0045] (S3) The input lines of each OR gate in the logic circuit are a and b, and the output line is c. Then, vector σ c For each OR gate with a vector σ a :=σ c and σ b :=σ c and are set to input line a and input line b, respectively.
[0046] (S4) σ1, , σ set to the input lines 1, , n of the monotonic logic formula f (i.e., the input lines 1, , n of the logic circuit in question). nis output as the assignment of secret vector k.
[0047] It should be noted that this linear secret sharing algorithm Share can also be applied to vectors of group elements in the same way.
[0048] <Attribute-based encryption according to this embodiment> As the attribute-based encryption according to the present embodiment, a key policy attribute-based encryption according to the present embodiment and a ciphertext policy attribute-based encryption according to the present embodiment will be described. The attribute-based encryption is composed of four algorithms (i.e., a setup algorithm Setup, an encryption algorithm Enc, a key generation algorithm KeyGen, and a decryption algorithm Dec). In this embodiment, cyclic groups G1, G2, and G T Then, the bilinear map e:G1×G2→G T These cyclic groups and bilinear maps are collectively called bilinear groups. A known bilinear group may be used, or it may be generated by the setup algorithm Setup.
[0049] Matrix notation First, a description will be given of matrix notation used in the description of each algorithm of attribute-based encryption and each algorithm of attribute-based Key Encapsulation Mechanism (KEM), which will be described later.
[0050] Let k be any natural number,
[0051]
number
[0052]
number
[0053]
number
[0054]
number
[0055]
number
[0056]
number
[0057] Also, let matrix B, vector b1, and vector b2 be respectively the matrix
[0058]
number
[0059] Similarly, matrix B * , vector b1 * and vector b2 * respectively,
[0060]
number
[0061] Also, for simplicity,
[0062]
number
[0063] Key policy attribute-based encryption according to this embodiment In the following, each algorithm of the key policy attribute-based encryption according to this embodiment will be described.
[0064]
number
[0065]
number
[0066]
number
[0067] Setup(): The setup algorithm Setup outputs the public key pk and the master private key msk according to the following:
[0068]
number
[0069] Enc(pk, x, M): The encryption algorithm Enc is a public key pk and an attribute
[0070]
number
[0071]
number
[0072]
number
[0073]
number
[0074] Dec(pk,ct x ,sk y ): The decryption algorithm Dec uses a public key pk and a ciphertext ct x and the private key sk y Input the above, calculate b from x and y using the above formula (3), and if f(b)=0, output ⊥ indicating a decoding failure. On the other hand, if f(b)≠0,
[0075]
number
[0076]
number
[0077] Ciphertext policy attribute-based encryption according to this embodiment In the following, each algorithm of the ciphertext policy attribute-based encryption according to the present embodiment will be described. k (Z p ) to Z of size k p The general linear group above,
[0078]
number
[0079]
number
[0080]
number
[0081] Setup(): The setup algorithm Setup outputs the public key pk and the master private key msk according to the following:
[0082]
number
[0083] Enc(pk, x, M): The encryption algorithm Enc is a public key pk and a policy
[0084]
number
[0085]
number
[0086] KeyGen(pk,msk,y): The key generation algorithm KeyGen takes a public key pk, a master private key msk, and attributes
[0087]
number
[0088]
number
[0089]
number
[0090]
number
[0091] <Attribute-based KEM according to this embodiment> The key policy attribute-based encryption and ciphertext policy attribute-based encryption according to the present embodiment described above can also be applied to the KEM method. Since public key encryption technology generally operates slowly, when encrypting large amounts of data, the private key used in the symmetric key encryption is securely delivered by public key encryption, and the data itself is often encrypted by symmetric key encryption. The method used to securely deliver the private key for the symmetric key encryption (hereinafter also referred to as the "symmetric key") is called KEM.
[0092] Therefore, we will explain key policy attribute-based KEM in which the key policy attribute-based encryption of this embodiment is applied to KEM, and ciphertext policy attribute-based KEM in which the ciphertext policy attribute-based encryption of this embodiment is applied to KEM.
[0093] Key policy attribute-based KEM according to this embodiment In the following, each algorithm of the key policy attribute-based KEM according to this embodiment will be described. K is the same as in the above-described "key policy attribute-based encryption method according to the present embodiment,"
[0094]
number
[0095]
number
[0096] Setup(): The setup algorithm Setup outputs the public key pk and the master private key msk according to the following:
[0097]
number
[0098] Enc(pk,x): The encryption algorithm Enc is a public key pk and an attribute
[0099]
number
[0100]
number
[0101]
number
[0102]
number
[0103] Dec(pk,ct x ,sk y ): The decryption algorithm Dec uses a public key pk and a ciphertext ct x and the private key sky Input the above, calculate b from x and y using the above formula (3), and if f(b)=0, output ⊥ indicating a decoding failure. On the other hand, if f(b)≠0,
[0104]
number
[0105]
number
[0106] Ciphertext policy attribute-based KEM according to this embodiment In the following, each algorithm of the ciphertext policy attribute-based KEM according to this embodiment will be described. K is the same as in the above-described “ciphertext policy attribute-based encryption according to the present embodiment”,
[0107]
number
[0108]
number
[0109] Setup(): The setup algorithm Setup outputs the public key pk and the master private key msk according to the following:
[0110]
number
[0111] Enc(pk,x): The encryption algorithm Enc is a combination of a public key pk and a policy
[0112]
number
[0113]
number
[0114] KeyGen(pk,msk,y): The key generation algorithm KeyGen takes a public key pk, a master private key msk, and attributes
[0115]
number
[0116]
number
[0117]
number
[0118]
number
[0119] <Overall configuration of cryptosystem 1> Next, the overall configuration of a cryptosystem 1 that realizes the above-described "key policy attribute-based encryption according to this embodiment," "ciphertext policy attribute-based encryption according to this embodiment," "key policy attribute-based KEM according to this embodiment," and "ciphertext policy attribute-based KEM according to this embodiment" will be described with reference to Fig. 1. Fig. 1 is a diagram showing an example of the overall configuration of the cryptosystem 1 according to this embodiment.
[0120] As shown in Fig. 1, the cryptosystem 1 according to this embodiment includes a key generation device 10, an encryption device 20, and a decryption device 30. These devices are communicatively connected via a communication network N such as the Internet. Note that, although the example shown in Fig. 1 shows a case where there is one encryption device 20 and one decryption device 30, there may be a plurality of each of these devices. There may also be a plurality of key generation devices 10.
[0121] The key generation device 10 is a computer or computer system that executes a setup algorithm Setup and a key generation algorithm KeyGen to generate a key. Here, the key generation device 10 has a setup processing unit 101, a key generation processing unit 102, and a storage unit 103. Note that the setup processing unit 101 and the key generation processing unit 102 are realized by processing that one or more programs installed in the key generation device 10 cause a processor or the like to execute. Also, the storage unit 103 can be realized using various types of memory such as an auxiliary storage device, for example.
[0122] The setup processing unit 101 executes a setup algorithm Setup. The key generation processing unit 102 executes a key generation algorithm KeyGen. The storage unit 103 stores various data (for example, the public key pk and the master secret key msk output by the setup algorithm Setup).
[0123] The encryption device 20 is a computer or computer system that executes an encryption algorithm Enc to generate ciphertext. Here, the encryption device 20 has an encryption processing unit 201 and a storage unit 202. The encryption processing unit 201 is realized by a process executed by a processor or the like by one or more programs installed in the encryption device 20. Also, the storage unit 202 can be realized by using various memories such as an auxiliary storage device, for example.
[0124] The encryption processing unit 201 executes the encryption algorithm Enc. The storage unit 202 stores various data (for example, data to be input to the encryption algorithm Enc, etc.).
[0125] The decryption device 30 is a computer or computer system that executes a decryption algorithm Dec to decrypt a ciphertext. Here, the decryption device 30 has a decryption processing unit 301 and a storage unit 302. The decryption processing unit 301 is realized by a process executed by a processor or the like by one or more programs installed in the decryption device 30. Also, the storage unit 302 can be realized by using various memories such as an auxiliary storage device.
[0126] The decoding processing unit 301 executes the decoding algorithm Dec. The storage unit 302 stores various data (for example, data input to the decoding algorithm Dec, data output by the decoding algorithm Dec, etc.).
[0127] 1 is merely an example, and other configurations may be used. For example, the encryption device 20 and the decryption device 30 may be implemented in a single device. In this case, the device includes, for example, an encryption processing unit 201, a decryption processing unit 301, and a storage unit.
[0128] <Processing flow executed by encryption system 1> The flow of processing executed by the cryptographic system 1 according to this embodiment will be described below.
[0129] Key policy attribute-based encryption according to this embodiment When the cryptosystem 1 according to this embodiment realizes the "key policy attribute-based encryption according to this embodiment", the following Steps 1-1 to 1-4 are executed.
[0130] Step 1-1) The setup processing unit 101 of the key generating device 10 executes a setup algorithm Setup of the key policy attribute-based encryption according to this embodiment. As a result, a public key pk and a master private key msk are generated and output. The public key pk and the master private key msk are stored in the storage unit 103. In addition, the public key pk is made public.
[0131] Step 1-2) The encryption processing unit 201 of the encryption device 20 executes the encryption algorithm Enc of the key policy attribute-based encryption according to this embodiment, using the public key pk, the attribute x, and the message M as input. As a result, the attribute-added ciphertext ct x The attributed ciphertext ct is output. x is transmitted to the decryption device 30 via a communication network N. xmay be stored in the storage unit 202.
[0132] Step 1-3) The key generation processing unit 102 of the key generation device 10 executes the key generation algorithm KeyGen of the key policy attribute-based encryption according to this embodiment, using the public key pk, the master private key msk, and the policy y as input. As a result, the policy-attached private key sk y A policy-attached private key sk is generated. y is transmitted to the decoding device 30 via the communication network N, for example.
[0133] Step 1-4) The decryption processing unit 301 of the decryption device 30 receives the public key pk and the attribute-added ciphertext ct x and the policy-protected private key sk y Using these as inputs, the decryption algorithm Dec of the key policy attribute-based encryption according to this embodiment is executed. As a result, either ⊥ indicating a decryption failure or a message M' is output. This output result is stored in the storage unit 302, for example.
[0134] Ciphertext policy attribute-based encryption according to this embodiment When the cryptosystem 1 according to this embodiment realizes the "ciphertext policy attribute-based encryption according to this embodiment", the following Steps 2-1 to 2-4 are executed.
[0135] Step 2-1) The setup processing unit 101 of the key generating device 10 executes a setup algorithm Setup of the ciphertext policy attribute-based encryption according to this embodiment. As a result, a public key pk and a master private key msk are generated and output. The public key pk and the master private key msk are stored in the storage unit 103. In addition, the public key pk is made public.
[0136] Step 2-2) The encryption processing unit 201 of the encryption device 20 executes the encryption algorithm Enc of the ciphertext policy attribute-based encryption according to this embodiment, using the public key pk, the policy x, and the message M as input. As a result, the policy-attached ciphertext ct x The policy-enhanced ciphertext ct is output.x is transmitted to the decryption device 30 via a communication network N. x may be stored in the storage unit 202.
[0137] Step 2-3) The key generation processing unit 102 of the key generation device 10 executes the key generation algorithm KeyGen of the ciphertext policy attribute-based encryption according to this embodiment with the public key pk, the master private key msk, and the attribute y as input. As a result, the attribute-attached private key sk y A private key with attributes sk is generated. y is transmitted to the decoding device 30 via the communication network N, for example.
[0138] Step 2-4) The decryption processing unit 301 of the decryption device 30 receives the public key pk and the ciphertext with policy ct x and the attributed private key sk y The decryption algorithm Dec of the ciphertext policy attribute-based encryption according to this embodiment is executed using the above as input. As a result, either ⊥ indicating a decryption failure or a message M' is output. This output result is stored in the storage unit 302, for example.
[0139] Key policy attribute-based KEM according to this embodiment When the cryptosystem 1 according to this embodiment realizes the "key policy attribute-based KEM according to this embodiment", the following Steps 3-1 to 3-4 are executed.
[0140] Step 3-1) The setup processing unit 101 of the key generating device 10 executes a setup algorithm Setup of the key policy attribute-based KEM according to this embodiment. As a result, a public key pk and a master private key msk are generated and output. The public key pk and the master private key msk are stored in the storage unit 103. In addition, the public key pk is made public.
[0141] Step 3-2) The encryption processing unit 201 of the encryption device 20 executes the encryption algorithm Enc of the key policy attribute-based KEM according to this embodiment using the public key pk and the attribute x as input. As a result, the attribute-attached ciphertext ct x and the common key L are output. x is transmitted to the decryption device 30 via a communication network N. x may be stored in the storage unit 202. In addition, the common key L is stored in the storage unit 202.
[0142] Step 3-3) The key generation processing unit 102 of the key generation device 10 executes the key generation algorithm KeyGen of the key policy attribute-based KEM according to this embodiment with the public key pk, the master private key msk, and the policy y as input. As a result, the policy-attached private key sk y A policy-attached private key sk is generated. y is transmitted to the decoding device 30 via the communication network N, for example.
[0143] Step 3-4) The decryption processing unit 301 of the decryption device 30 receives the public key pk and the attribute-added ciphertext ct x and the policy-protected private key sk y Using these as inputs, the decryption algorithm Dec of the key policy attribute-based KEM according to this embodiment is executed. As a result, either ⊥ indicating a decryption failure or the common key K' is output. This output result is stored in the storage unit 302, for example.
[0144] Ciphertext policy attribute-based KEM according to this embodiment When the cryptosystem 1 according to this embodiment realizes the "ciphertext policy attribute-based KEM according to this embodiment", the following Steps 4-1 to 4-4 are executed.
[0145] Step 4-1) The setup processing unit 101 of the key generating device 10 executes a setup algorithm Setup of the ciphertext policy attribute-based KEM according to this embodiment. As a result, a public key pk and a master private key msk are generated and output. The public key pk and the master private key msk are stored in the storage unit 103. In addition, the public key pk is made public.
[0146] Step 4-2) The encryption processing unit 201 of the encryption device 20 executes the encryption algorithm Enc of the ciphertext policy attribute-based KEM according to this embodiment with the public key pk and the policy x as input. As a result, the policy-attached ciphertext ct x and the common key L are output. x is transmitted to the decryption device 30 via a communication network N. x may be stored in the storage unit 202. In addition, the common key L is stored in the storage unit 202.
[0147] Step 4-3) The key generation processing unit 102 of the key generation device 10 executes the key generation algorithm KeyGen of the ciphertext policy attribute-based KEM according to this embodiment with the public key pk, the master private key msk, and the attribute y as input. As a result, the attribute-attached private key sk y A private key with attributes sk is generated. y is transmitted to the decoding device 30 via the communication network N, for example.
[0148] Step 4-4) The decryption processing unit 301 of the decryption device 30 receives the public key pk and the ciphertext with policy ct x and the attributed private key sk y Using these as inputs, the decryption algorithm Dec of the ciphertext policy attribute-based KEM according to this embodiment is executed. As a result, either ⊥ indicating a decryption failure or the common key L' is output. This output result is stored in the storage unit 302, for example.
[0149] <Hardware configurations of the key generation device 10, the encryption device 20, and the decryption device 30> Next, the hardware configurations of the key generation device 10, encryption device 20, and decryption device 30 included in the cryptosystem 1 according to this embodiment will be described with reference to Fig. 2. Fig. 2 is a diagram showing an example of the hardware configurations of the key generation device 10, encryption device 20, and decryption device 30 according to this embodiment. Note that the key generation device 10, encryption device 20, and decryption device 30 according to this embodiment can be realized with the same hardware configuration, so hereinafter, the hardware configuration of the key generation device 10 will mainly be described.
[0150] 2, the key generation device 10 according to this embodiment includes an input device 501, a display device 502, a RAM (Random Access Memory) 503, a ROM (Read Only Memory) 504, a processor 505, an external I / F 506, a communication I / F 507, and an auxiliary storage device 508. Each of these pieces of hardware is connected to each other via a bus 509 so as to be able to communicate with each other.
[0151] The input device 501 is, for example, a keyboard, a mouse, a touch panel, etc. The display device 502 is, for example, a display, etc. Note that the key generation device 10, the encryption device 20, and the decryption device 30 do not necessarily have at least one of the input device 501 and the display device 502.
[0152] The RAM 503 is a volatile semiconductor memory that temporarily stores programs and data. The ROM 504 is a non-volatile semiconductor memory that can store programs and data even when the power is turned off. The processor 505 is, for example, a CPU (Central Processing Unit) or the like, and is an arithmetic device that reads programs and data from the ROM 504, auxiliary storage device 508, etc. onto the RAM 503 and executes processing.
[0153] The external I / F 506 is an interface with an external device, such as a recording medium 506a, such as a CD (Compact Disc), a DVD (Digital Versatile Disk), an SD memory card (Secure Digital memory card), or a USB (Universal Serial Bus) memory card.
[0154] The communication I / F 507 is an interface for connecting to a communication network and communicating with other devices. The auxiliary storage device 508 is a non-volatile storage device such as a hard disk drive (HDD) or a solid state drive (SSD).
[0155] The key generation device 10, encryption device 20, and decryption device 30 according to the present embodiment have the hardware configuration shown in Fig. 2, and can execute the above-mentioned algorithms to realize various processes. Note that Fig. 2 shows a case where the key generation device 10, encryption device 20, and decryption device 30 according to the present embodiment are realized by one device (computer), but this is not limited to this. The key generation device 10, encryption device 20, and decryption device 30 according to the present embodiment may be realized by multiple devices (computers). Furthermore, one device (computer) may include multiple processors 505 and multiple memories (RAM 503, ROM 504, auxiliary storage device 508, etc.).
[0156] <Summary> As described above, the cryptosystem 1 according to the present embodiment can realize "key policy attribute-based encryption according to the present embodiment", "ciphertext policy attribute-based encryption according to the present embodiment", "key policy attribute-based KEM according to the present embodiment", and "ciphertext policy attribute-based KEM according to the present embodiment". These encryption methods and KEM methods are based on the configuration technology of a method called FAME, which is efficient but has lower expressiveness than the OT method. For details about FAME, please refer to, for example, the literature "S. Agrawal and M. Chase. FAME: Fast attribute-based message encryption. In ACM CCS, 2017."
[0157] While FAME has an efficient structure, it cannot use negation in a conditional expression that expresses a policy. In contrast, the encryption method according to this embodiment (and the KEM method applying this encryption method) are designed to allow negation of a conditional expression and multiple occurrences of an attribute label while maintaining the property of efficient operation by referring to the structure of FAME. As a result, the encryption system 1 according to this embodiment can realize efficient attribute-based encryption (and KEM applying this attribute-based encryption) that can use any conditional expression as a policy without increasing the size of the ciphertext or private key.
[0158] More specifically, in the attribute-based encryption (and KEM to which this attribute-based encryption is applied) realized by the encryption system 1 according to this embodiment, firstly, the number of group elements of the ciphertext and private key is reduced compared to the OT scheme, so that the number of exponentiation calculations, which are relatively heavy calculations during encryption and key generation, can be significantly reduced. Therefore, the calculation time for encryption and key generation can be reduced.
[0159] Secondly, the number of pairing calculations, which are heavy calculations required for decryption, is greatly reduced, so decryption is also faster than the OT method. In particular, the number of pairing calculations depends on the policy used, but in fast cases, decryption can be several times faster than the variables of the policy. For example, when decryption is performed using a ciphertext or private key with a policy consisting of 20 variables, it can be more than 20 times faster.
[0160] Furthermore, in the attribute-based encryption implemented by the encryption system 1 according to this embodiment (and the KEM to which this attribute-based encryption is applied), any conditional expression can be used as a policy without increasing the size of the ciphertext or key. In other words, an attribute label may appear any number of times in a conditional expression.
[0161] The present invention is not limited to the above-described embodiments specifically disclosed, and various modifications and variations are possible without departing from the scope of the claims. [Explanation of symbols]
[0162] 1. Cryptographic Systems 10 Key generator 20 Encryption device 30 Decryption device 101 Setup processing section 102 Key generation processing unit 103 Storage section 201 Encryption processing unit 202 Storage section 301 Decryption processing unit 302 Storage section
Claims
1. an encryption means for receiving as input at least one of a public key used in attribute-based encryption and an attribute and a policy expressed by an arbitrary conditional expression related to the attribute, and generating a ciphertext in which the attribute or the policy is embedded; a key generation means for generating a secret key in which one of the attributes and the policy is embedded, using as input the public key, a master secret key used in the attribute-based encryption, and the other of the attributes and the policy that is different from the other; a decryption means for decrypting the ciphertext using the public key, the ciphertext, and the private key as inputs; having The conditional expression is expressed by any logical expression including a non-monotonic logical expression, The key generation means When the encryption means generates a ciphertext in which the policy is embedded, the encryption means generates the secret key having a key size independent of the number of occurrences of the same attribute label in the policy; The encryption means includes: a cryptosystem that generates a ciphertext having a size independent of the number of occurrences of the same attribute label in the policy when the key generation means generates a secret key in which the policy is embedded.
2. a key generation means for receiving as input either a public key and a master private key used in the attribute-based encryption, or either an attribute or a policy expressed by an arbitrary conditional expression related to the attribute, and generating a private key in which either the attribute or the policy is embedded; having The conditional expression is expressed by any logical expression including a non-monotonic logical expression, The key generation means A key generating device that generates the secret key having a key size that is independent of the number of times the same attribute label appears in the policy.
3. an encryption means for receiving as input at least one of a public key used in the attribute-based encryption and an attribute and a policy expressed by an arbitrary conditional expression related to the attribute, and generating a ciphertext in which the attribute or the policy is embedded; having The conditional expression is expressed by any logical expression including a non-monotonic logical expression, The encryption means includes: An encryption device that generates a ciphertext having a size independent of the number of occurrences of the same attribute label in the policy.
4. a decryption means for decrypting a ciphertext using as input a public key used in the attribute-based encryption, a ciphertext in which either an attribute or a policy expressed by an arbitrary conditional expression related to the attribute is embedded, and a private key in which the other of the attribute and the policy, which is different from either the attribute or the policy, is embedded; having The conditional expression is expressed by any logical expression including a non-monotonic logical expression, A decryption device characterized in that the size of either the private key or the ciphertext does not depend on the maximum number of occurrences of the same attribute label in the policy, depending on whether the policy is embedded in the ciphertext or the private key.
5. an encryption step in which an encryption device receives as input at least one of a public key used in attribute-based encryption and an attribute and a policy expressed by an arbitrary conditional expression related to the attribute, and generates a ciphertext in which the attribute or the policy is embedded; a key generation step in which a key generation device generates a secret key in which one of the attribute and the policy is embedded, using as input the public key, a master secret key used in the attribute-based encryption, and the other of the attribute and the policy, the other being different from the one of the attribute and the policy; a decryption step in which a decryption device decrypts the ciphertext using the public key, the ciphertext, and the private key as inputs; Run The conditional expression is expressed by any logical expression including a non-monotonic logical expression, The key generation step includes: When a ciphertext in which the policy is embedded is generated in the encryption procedure, the secret key is generated with a key size that is independent of the number of occurrences of the same attribute label in the policy; The encryption step comprises: generating a ciphertext whose size does not depend on the number of occurrences of the same attribute label in the policy when the key generation procedure generates a secret key into which the policy is embedded.
6. A program for causing a computer to function as each of the means in the cryptographic system according to claim 1, each of the means in the key generation device according to claim 2, each of the means in the encryption device according to claim 3, or each of the means in the decryption device according to claim 4.
Citation Information
Patent Citations
Functional encryption system, key generation device, encryption device, decryption device, functional encryption method, and program
JP2014095847A
