RE-ENCRYPTION KEY GENERATION DEVICE, RE-ENCRYPTION DEVICE, RE-ENCRYPTED CIPHERTEXT DECRYPTION DEVICE, AND CRYPTOGRAPHIC SYSTEM

Abstract

A key generation device generates a decryption key dkx having a tag-added decryption key and a decryption key adkx. The tag-added decryption key includes a decryption key tdkx in which a key attribute x is set and a tag tgφ required to decrypt a ciphertext with the decryption key tdkx. In the decryption key adkx, the key attribute x is set. An encryption device generates an original ciphertext octy in which a ciphertext attribute y corresponding to the key attribute x is set and which can be decrypted with the tag-added decryption key. A re-encryption key generation device encrypts the decryption key tdkx by an attribute-based encryption scheme using a ciphertext attribute y′, so as to generate a re-encryption key rkx,y′ which is a key for generating a re-encrypted ciphertext rcty′ which can be decrypted with a decryption key adkx′ in which a key attribute x′ corresponding to the ciphertext attribute y′ is set.

Description

TECHNICAL FIELD

The present invention relates to proxy-re-encryption.

BACKGROUND ART

An attribute-based proxy-re-encryption scheme is a scheme in which decryption authority for a ciphertext can be changed without decrypting the ciphertext. In an attribute-based encryption scheme, a key attribute x is set in a decryption key, and a ciphertext attribute y is set in a ciphertext. In the attribute-based encryption scheme, the ciphertext can be decrypted only when the key attribute x and the ciphertext attribute y satisfy a relation R(x, y)=1. In the attribute-based proxy-re-encryption scheme, by using a re-encryption key, a ciphertext attribute y that is set in a ciphertext can be changed to a different ciphertext attribute y′ without decrypting the ciphertext.

Patent Literature 1 and Non-Patent Literature 1 provide descriptions related to attribute-based proxy-re-encryption schemes.

CITATION LIST

Patent Literature

• Patent Literature 1: WO 2014/112048 A1

Non-Patent Literature

• Non-Patent Literature 1: Yutaka Kawai and Katsuyuki Takashima, Fully-Anonymous Functional Proxy-Re-Encryption. Cryptology ePrint Archive: Report 2013/318

SUMMARY OF INVENTION

Technical Problem

In the attribute-based proxy-re-encryption schemes described in Patent Literature 1 and Non-Patent Literature 1, a random matrix is included in a re-encrypted ciphertext, so that the size of the re-encrypted ciphertext increases.

It is an object of the present invention to make it possible to realize an attribute-based proxy-re-encryption scheme in which an increase in the size of a ciphertext entailed in re-encryption is reduced.

Solution to Problem

A re-encryption key generation device according to the present invention includes:

• • a randomization unit to set a random number in a decryption key tdk_x in which a key attribute x is set and set a random number in a tag tg_φ used to decrypt a ciphertext with the decryption key tdk_x, so as to generate a decryption key tdk_x^{{circumflex over ( )}} and a tag tg_φ^{{circumflex over ( )}};
  • an encryption key generation unit to encrypt the decryption key tdk_x^{{circumflex over ( )}} generated by the randomization unit by an attribute-based encryption scheme using a ciphertext attribute y′, so as to generate an encryption key act_y; and
  • a re-encryption key output unit to output a re-encryption key rk_x,y′ including the encryption key act_y′ generated by the encryption key generation unit and the tag tg_φ^{{circumflex over ( )}} generated by the randomization unit.

Advantageous Effects of Invention

In the present invention, a decryption key of tag-added attribute-based encryption is encrypted using attribute-based encryption to generate a re-encryption key. This eliminates the need to include a random matrix in a re-encrypted ciphertext, so that an increase in the size of a ciphertext entailed in re-encryption can be reduced.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a configuration diagram of a cryptographic system 1 according to a first embodiment;

FIG. 2 is a configuration diagram of a key generation device 10 according to the first embodiment;

FIG. 3 is a configuration diagram of an encryption device 20 according to the first embodiment;

FIG. 4 is a configuration diagram of an original ciphertext decryption device 30 according to the first embodiment;

FIG. 5 is a configuration diagram of a re-encryption key generation device 40 according to the first embodiment;

FIG. 6 is a configuration diagram of a re-encryption device 50 according to the first embodiment;

FIG. 7 is a configuration diagram of a re-encrypted ciphertext decryption device 60 according to the first embodiment;

FIG. 8 is a flowchart of a Setup algorithm according to the first embodiment;

FIG. 9 is a flowchart of a KG algorithm according to the first embodiment;

FIG. 10 is a flowchart of an Enc algorithm according to the first embodiment;

FIG. 11 is a flowchart of an ODec algorithm according to the first embodiment;

FIG. 12 is a flowchart of an RKG algorithm according to the first embodiment;

FIG. 13 is a flowchart of an REnc algorithm according to the first embodiment;

FIG. 14 is a flowchart of an RDec algorithm according to the first embodiment;

FIG. 15 is a configuration diagram of a key generation device 10 according to a first variation;

FIG. 16 is a configuration diagram of an encryption device 20 according to the first variation;

FIG. 17 is a configuration diagram of an original ciphertext decryption device 30 according to the first variation;

FIG. 18 is a configuration diagram of a re-encryption key generation device 40 according to the first variation;

FIG. 19 is a configuration diagram of a re-encryption device 50 according to the first variation; and

FIG. 20 is a configuration diagram of a re-encrypted ciphertext decryption device 60 according to the first variation.

DESCRIPTION OF EMBODIMENTS

First Embodiment

***Description of Notations***

Notations in the following description will be described.

When A is a random variable or distribution, Formula 101 denotes that y is randomly selected from A according to the distribution of A. That is, y is a random number in Formula 101.

$\begin{array}{cc}y\stackrel{R}{⟵}A& \left[\mathrm{Formula}101\right]\end{array}$

When A is a set, Formula 102 denotes that y is uniformly selected from A. That is, y is a uniform random number in Formula 102.

$\begin{array}{cc}y\stackrel{U}{⟵}A& \left[\mathrm{Formula}102\right]\end{array}$

Formula 103 denotes that y is a set defined by z, or y is a set substituted by z.

y:=z   [Formula 103]

When a is a constant, Formula 104 denotes that a machine (algorithm) A outputs a on input x.

A(x)→a   [Formula 104]

for example,

A(x)→1

Formula 105, that is F_q, denotes a finite field of order q.

_q   [Formula 105]

A vector representation denotes a vector representation in the finite field F_q. That is, it is as indicated in Formula 106.

{right arrow over (x)} denotes

(x₁, . . . ,x_n)ϵ_qⁿ   [Formula 106]

Formula 107 denotes the inner-product, indicated in Formula 109, of two vectors x^→ and v^→ indicated in Formula 108.

{right arrow over (x)}·{right arrow over (v)}   [Formula 107]

x=(x₁, . . . ,x_n),

v=(v₁, . . . ,v_n)   [Formula 108]

Σ_i=lⁿx_iv_i

[Formula 109]

Note that X^T denotes the transpose of a matrix X.

For a basis B and a basis B* indicated in Formula 110, Formula 111 is established.

:=(b¹, . . . ,b^N),

*:=(b*¹, . . . ,b*^N)   [Formula 110]

(x_l, . . . ,x_N:=Σ_i=l^Nx_ib_i,

(y_l, . . . ,y_N:=Σ_i=l^Ny_ib_i^*

[Formula 111]

Note that e^→_j denotes a normal basis vector indicated in Formula 112.

$\begin{array}{cc}{\overrightarrow{e}}_j:\left(\stackrel{j-1}{\overbrace{0\mathrm{\cdots 0}}},1,\stackrel{n-j}{\overbrace{0\mathrm{\cdots 0}}}\right)\in {𝔽}_q^n\mathrm{for}j=1,\dots ,n,& \left[\mathrm{Formula}112\right]\end{array}$

***Description of Spaces***

Spaces used in the following description will be described.

Symmetric bilinear pairing groups will be described.

Symmetric bilinear pairing groups (q, G, G_T, g, e) are a tuple of a prime q, a cyclic additive group G of order q, a cyclic multiplicative group G_T of order q, g≠0ϵG, and a polynomial-time computable nondegenerate bilinear pairing e:G×G→G_T. The nondegenerate bilinear pairing signifies e(sg, tg)=e(g, g)^st, and e(g, g)≠1.

In the following description, let G_bpg be an algorithm that takes as input 1^λ, and outputs values of a parameter param_G:=(q, G, G_T, g, e) of bilinear pairing groups with a security parameter λ.

Dual pairing vector spaces will be described.

Dual pairing vector spaces (q, V, G_T, A, e) can be constructed by a direct product of the symmetric bilinear pairing groups (param_G:=(q, G, G_T, g, e)). The dual pairing vector spaces (q, V, G_T, A, e) are a tuple of a prime q, an N-dimensional vector space V over F_q indicated in Formula 113, a cyclic group G_T of order q, and a canonical basis A:=(a₁, . . . , a_N) of the space V, and have the following operations (1) and (2), where a, is as indicated in Formula 114.

$\begin{array}{cc}𝕍\stackrel{N}{:\overbrace{𝔾\times \cdots \times 𝔾}}& \left[\mathrm{Formula}113\right]\\ a_i:=\left(\stackrel{i-1}{\overbrace{0,\dots ,0}},g,\stackrel{N-1}{\overbrace{0,\dots ,0}}\right)& \left[\mathrm{Formula}114\right]\end{array}$

Operation (1): Nondegenerate Bilinear Pairing

A pairing on the space V is defined by Formula 115.

e(x,y):=ΠN_i=1^Ne(G_i,H_i)ϵ_T   [Formula 115]

where

(G₁, . . . ,G_N):=xϵ,

(H₁, . . . ,H_N):=yϵ

This is nondegenerate bilinear, that is, e(sx, ty)=e(x, y)^st and if e(x, y)=1 for all yϵV, then x=0. For all i and j, e(a_i, a_j)=e(g, g)^δi,j where δ_i,j=1 if i=j, and δ_i,j=0 if i≠j, and e(g, g)≠1ϵG_T.

Operation (2): Distortion Maps

Linear transformations φ_i,j on the space V indicated in Formula 116 can achieve Formula 117.

$\begin{array}{cc}\mathrm{If}{\varphi }_{i,j}\left(a_j\right)=a_i\mathrm{and}k\ne j,\mathrm{then}{\varphi }_{i,j}\left(a_k\right)=0.& \square \\ {\varphi }_{i,j}\left(x\right)=\left(\stackrel{i-1}{\overbrace{0,\dots ,0}},g,\stackrel{N-1}{\overbrace{0,\dots ,0}}\right)& \square \\ \mathrm{where}& \\ \left(g_1,\dots ,g_N\right):=x.& \end{array}$

The linear transformations φ_i,j will be called distortion maps.

In the following description, let G_dpvs be an algorithm that takes as input 1^λ and the number of dimensions N_t of the space V, and outputs values of a parameter param_v:=(q, V, G_T, A, e) of dual pairing vector spaces with a security parameter λ.

***Description of Configurations***

A configuration of a cryptographic system 1 according to a first embodiment will be described with reference to FIG. 1.

The cryptographic system 1 includes a key generation device 10, an encryption device 20, an original ciphertext decryption device 30, a re-encryption key generation device 40, a re-encryption device 50, and a re-encrypted ciphertext decryption device 60.

The key generation device 10, the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, the re-encryption device 50, and the re-encrypted ciphertext decryption device 60 are connected via transmission lines.

A configuration of the key generation device 10 according to the first embodiment will be described with reference to FIG. 2.

The key generation device 10 is a computer.

The key generation device 10 includes hardware of a processor 11, a memory 12, a storage 13, and a communication interface 14. The processor 11 is connected with other hardware components via signal lines and controls these other hardware components.

The key generation device 10 includes, as functional components, an information acceptance unit 111, a master key generation unit 112, a decryption key generation unit 113, and a key output unit 114. The functions of the functional components of the key generation device 10 are realized by software.

The storage 13 stores programs for realizing the functions of the functional components of the key generation device 10. These programs are loaded into the memory 12 by the processor 11 and executed by the processor 11. This realizes the functions of the functional components of the key generation device 10.

A configuration of the encryption device 20 according to the first embodiment will be described with reference to FIG. 3.

The encryption device 20 is a computer.

The encryption device 20 includes hardware of a processor 21, a memory 22, a storage 23, and a communication interface 24. The processor 21 is connected with other hardware components via signal lines and controls these other hardware components.

The encryption device 20 includes, as functional components, a public parameter acquisition unit 211, an information acceptance unit 212, an encryption unit 213, and a ciphertext output unit 214. The functions of the functional components of the encryption device 20 are realized by software.

The storage 23 stores programs for realizing the functions of the functional components of the encryption device 20. These programs are loaded into the memory 22 by the processor 21 and executed by the processor 21. This realizes the functions of the functional components of the encryption device 20.

A configuration of the original ciphertext decryption device 30 according to the first embodiment will be described with reference to FIG. 4.

The original ciphertext decryption device 30 is a computer.

The original ciphertext decryption device 30 includes hardware of a processor 31, a memory 32, a storage 33, and a communication interface 34. The processor 31 is connected with other hardware components via signal lines and controls these other hardware components.

The original ciphertext decryption device 30 includes, as functional components, a decryption key acquisition unit 311, a ciphertext acquisition unit 312, and a decryption unit 313. The functions of the functional components of the original ciphertext decryption device 30 are realized by software.

The storage 33 stores programs for realizing the functions of the functional components of the original ciphertext decryption device 30. These programs are loaded into the memory 32 by the processor 31 and executed by the processor 31. This realizes the functions of the functional components of the original ciphertext decryption device 30.

A configuration of the re-encryption key generation device 40 according to the first embodiment will be described with reference to FIG. 5.

The re-encryption key generation device 40 is a computer.

The re-encryption key generation device 40 includes hardware of a processor 41, a memory 42, a storage 43, and a communication interface 44. The processor 41 is connected with other hardware components via signal lines and controls these other hardware components.

The re-encryption key generation device 40 includes, as functional components, a decryption key acquisition unit 411, an information acceptance unit 412, a randomization unit 413, an encryption key generation unit 414, and a re-encryption key output unit 415. The functions of the functional components of the re-encryption key generation device 40 are realized by software.

The storage 43 stores programs for realizing the functions of the functional components of the re-encryption key generation device 40. These programs are loaded into the memory 42 by the processor 41 and executed by the processor 41. This realizes the functions of the functional components of the re-encryption key generation device 40.

A configuration of the re-encryption device 50 according to the first embodiment will be described with reference to FIG. 6.

The re-encryption device 50 is a computer.

The re-encryption device 50 includes hardware of a processor 51, a memory 52, a storage 53, and a communication interface 54. The processor 51 is connected with other hardware components via signal lines and controls these other hardware components.

The re-encryption device 50 includes, as functional components, a public parameter acquisition unit 511, a ciphertext acquisition unit 512, a re-encryption key acquisition unit 513, a verification unit 514, a decryption tag generation unit 515, a re-encryption unit 516, and a re-encrypted ciphertext output unit 517. The functions of the functional components of the re-encryption device 50 are realized by software.

The storage 53 stores programs for realizing the functions of the functional components of the re-encryption device 50. These programs are loaded into the memory 52 by the processor 51 and executed by the processor 51. This realizes the functions of the functional components of the re-encryption device 50.

A configuration of the re-encrypted ciphertext decryption device 60 according to the first embodiment will be described with reference to FIG. 7.

The re-encrypted ciphertext decryption device 60 is a computer.

The re-encrypted ciphertext decryption device 60 includes hardware of a processor 61, a memory 62, a storage 63, and a communication interface 64. The processor 61 is connected with other hardware components via signal lines and controls these other hardware components.

The re-encrypted ciphertext decryption device 60 includes, as functional components, a decryption key acquisition unit 611, a re-encrypted ciphertext acquisition unit 612, a first decryption unit 613, a second decryption unit 614, and a third decryption unit 615. The functions of the functional components of the re-encrypted ciphertext decryption device 60 are realized by software.

The storage 63 stores programs for realizing the functions of the functional components of the re-encrypted ciphertext decryption device 60. These programs are loaded into the memory 62 by the processor 61 and executed by the processor 61. This realizes the functions of the functional components of the re-encrypted ciphertext decryption device 60.

It has been described above that each of the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, the re-encryption device 50, and the re-encrypted ciphertext decryption device 60 is a separate device.

However, the cryptographic system 1 may include a device that has the functions of two or more of the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, the re-encryption device 50, and the re-encrypted ciphertext decryption device 60. For example, the cryptographic system 1 may include a plurality of devices, each having the functions of the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, and the re-encrypted ciphertext decryption device 60.

***Description of Operation*** Operation of the cryptographic system 1 according to the first embodiment will be described with reference to FIGS. 8 to 14.

The operation of the cryptographic system 1 according to the first embodiment corresponds to a cryptographic method according to the first embodiment. The operation of the cryptographic system 1 according to the first embodiment also corresponds to processes of a cryptographic program.

The cryptographic system 1 according to the first embodiment realizes an attribute-based proxy-re-encryption scheme. The attribute-based proxy-re-encryption scheme realized by the cryptographic system 1 according to the first embodiment includes seven algorithms: Setup, KG, Enc, ODec, RKG, REnc, and RDec.

The Setup algorithm according to the first embodiment will be described with reference to FIG. 8.

The Setup algorithm is executed by the key generation device 10. The Setup algorithm is a probabilistic algorithm that takes as input a security parameter λ and an attribute format Λ, and outputs a public parameter pp and a master key mk.

(Step S11: Information Acceptance Process)

The information acceptance unit 111 accepts input of a security parameter λ and an attribute format Λ. Specifically, the information acceptance unit 111 accepts the security parameter λ and the attribute format A that are input through operation of an input device by an administrator of the key generation device 10.

(Step S12: Tag-Added Master Key Generation Process)

The master key generation unit 112 executes a TSetup algorithm indicated in Formula 118, taking as input the security parameter X and the attribute format A that are accepted in step S11, so as to generate a parameter tpp and a key tmk.

$\begin{array}{cc}\mathrm{TSetup}\left(1^{\lambda },⩓\right):\left(\mathrm{param},\left({𝔹}_0,{𝔹}_0^{*}\right),\left({𝔹}_1,{𝔹}_1^{*}\right),\left({𝔹}_2,{𝔹}_2^{*}\right)\right)\stackrel{R}{\leftarrow }{G}_{\mathrm{ob}}\left(1^{\lambda },N_0=5,N_1=4n,N_2=8\right),{\widehat{𝔹}}_0=\left(b_{0,1},b_{0,2},b_{0,5}\right),{\widehat{𝔹}}_1=\left(b_{1,1},\dots ,b_{1,n},b_{1,3n+1},\dots ,b_{1,4n}\right),{\widehat{𝔹}}_2=\left(b_{2,1},b_{2,2},b_{2,7},b_{2,8}\right),{\widehat{𝔹}}_0^{*}=\left(b_{0,2}^{*},b_{0,4}^{*}\right),{\widehat{𝔹}}_1^{*}=\left(b_{1,1}^{*},\dots ,b_{1,n}^{*},b_{1,2n+1}^{*},\dots ,b_{1,3n}^{*}\right),{\widehat{𝔹}}_2^{*}=\left(b_{2,1}^{*},b_{2,2}^{*},b_{2,5}^{*},b_{2,6}^{*}\right),\mathrm{return}{t}_{\mathrm{pp}}=\left(\mathrm{param},\left\{{\widehat{𝔹}}_i,{\widehat{𝔹}}_i^{*}\right\}i=0,1,2\right),\mathrm{tmk}=b_{0,1}^{*}.& \left[\mathrm{Formula}118\right]\end{array}$

Note that an algorithm G_ob is as indicated in Formula 119.

$\begin{array}{cc}{G}_{ob}\left(1^{\lambda },\overrightarrow{N}\right):{\mathrm{param}}_G=\left(q,𝔾,{𝔾}_T,g,e\right)\stackrel{R}{⟵}{G}_{bpg}\left(1^{\lambda }\right),\psi ⟵F_q^{\times },g_T={e\left(g,g\right)}^{\psi },\mathrm{for}t\in \overrightarrow{N}:{\mathrm{param}}_{V_t}=\left(q,𝕍,{𝔾}_t,{𝔸}_t,e\right)\stackrel{R}{⟵}{G}_{dpvs}\left(1^{\lambda },N_t\right),X_t=\left(\begin{array}{c}{\overrightarrow{\varkappa }}_{t,1}\\ ⋮\\ {\overrightarrow{\varkappa }}_{t,N_t}\end{array}\right):={\left({\varkappa }_{t,i,j}\right)}_{i,j}\stackrel{U}{⟵}\mathrm{GL}\left(N_t,{𝔽}_q\right),\left(\begin{array}{c}{\overrightarrow{v}}_{t,1}\\ ⋮\\ {\overrightarrow{v}}_{t,N_t}\end{array}\right):={\left(v_{t,i,j}\right)}_{i,j}:=\psi ·{\left(X_j^T\right)}^{-1},b_{t,i}:={\sum }_{j=1}^{N_t}{\varkappa }_{t,i,j}{a}_{t,j},{𝔹}_t:=\left(b_{t,1},\dots ,b_{t,N_t}\right),b_{t,i}^{*}:={\sum }_{j=1}^{N_t}{v}_{t,i,j}{a}_{t,j},{𝔹}_t^{*}:=\left(b_{t,1}^{*},\dots ,b_{t,N_t}^{*}\right),\mathrm{param}:=\left(g_T,{\left\{{\mathrm{param}}_{V_t}\right\}}_{t\in \overrightarrow{N}}\right),\mathrm{return}\left(\mathrm{param},{\left\{{𝔹}_t,{𝔹}_t^{*}\right\}}_{t\in \overrightarrow{N}}\right).& \left[\mathrm{Formula}119\right]\end{array}$

(Step S13: Tagless Master Key Generation Process)

The master key generation unit 112 executes an ASetup algorithm indicated in Formula 120, taking as input the security parameter λ, and the attribute format Λ that are accepted in step S11, so as to generate a parameter app and a key amk.

$\begin{array}{cc}\mathrm{ASetup}\left(1^{\lambda },\Lambda \right):(\mathrm{param},\left({𝔹}_3,{𝔹}_3^{*}\right)\stackrel{R}{⟵}{G}_{ob}\left(1^{\lambda },N_3=3n+2\right),{\widehat{𝔹}}_3=\left(b_{3,1},\dots ,b_{3,n+1},b_{3,3n+2}\right),{\widehat{𝔹}}_3^{*}=\left(b_{3,2}^{*},\dots ,b_{3,n+1}^{*},b_{3,2n+2}^{*},\dots ,b_{3,3n+1}^{*}\right),\mathrm{return}\mathrm{app}=\left(\mathrm{param},{\widehat{𝔹}}_3,{\widehat{𝔹}}_3^{*}\right),\mathrm{amk}=b_{3,1}^{*}.& \left[\mathrm{Formula}120\right]\end{array}$

(Step S14: Master Key Output Process)

The key output unit 114 makes public, as a public parameter pp, the security parameter X input in step S11, the parameter tpp generated in step S12, and the parameter app generated in step S13 by, for example, transmitting them to other devices via the communication interface 14. The key output unit 114 writes the public parameter pp in the storage 13. The key output unit 114 writes, as a master key mk, the key tmk generated in step S12 and the key amk generated in step S13 in the storage 13.

The KG algorithm according to the first embodiment will be described with reference to FIG. 9.

The KG algorithm is executed by the key generation device 10. The KG algorithm is a probabilistic algorithm that takes as input the public parameter pp, the master key mk, and a key attribute x, and outputs a decryption key dk_x.

(Step S21: Information Acceptance Process)

The information acceptance unit 111 reads the public parameter pp and the master key mk from the storage 13.

The information acceptance unit 111 accepts input of a key attribute x. Specifically, the information acceptance unit 111 accepts the key attribute x that is input through operation of the input device by the administrator of the key generation device 10.

The key attribute x is an attribute of a user who uses a decryption key dk_x to be described later. As a specific example, the key attribute x is information such as a department to which the user who uses the decryption key dk_x belongs and a position in a company or the like of the user. The key attribute x is assumed here to be an attribute of a user of the original ciphertext decryption device 30. The key attribute x is assumed to be an n-dimensional vector.

(Step S22: Tag-Added Decryption Key Generation Process)

The decryption key generation unit 113 executes a TKG algorithm indicated in Formula 121, taking as input the parameter tpp, the key tmk, and the key attribute x, so as to generate a tag-added decryption key including a decryption key tdk_x and a tag tg_φ. The tag tg_φ is information used to decrypt a ciphertext with the decryption key tdk_x.

$\begin{array}{cc}\mathrm{TKG}\left(\mathrm{tpp},\mathrm{tmk},x\right):s_1,s_2,{\delta }_1,{\eta }_0\stackrel{U}{⟵}{𝔽}_q,{\overrightarrow{\eta }}_1\stackrel{U}{⟵}{𝔽}_q^n,{\overrightarrow{\eta }}_2\stackrel{U}{⟵}{𝔽}_q^2,s_0=s_1+s_2,k_0^{*}={\left(1,-s_0,0,{\eta }_0,0\right)}_{{𝔹}_0^{*}},k_1^{*}={\left(s_1{\overrightarrow{e}}_1+{\delta }_{1}x,0^n,{\overrightarrow{\eta }}_1,0^n\right)}_{{𝔹}_1^{*}},k_2^{*}={\left(s_2,0^3,{\overrightarrow{\eta }}_2,0^2\right)}_{{𝔹}_2^{*}},\mathrm{return}{\mathrm{tdk}}_x=\left(x,k_0^{*},k_1^{*}\right),{\mathrm{tg}}_{\varphi }=k_2^{*}.& \left[\mathrm{Formula}121\right]\end{array}$

(Step S23: Tagless Decryption Key Generation Process)

The decryption key generation unit 113 executes an AKG algorithm indicated in Formula 122, taking as input the parameter app, the key amk, and the key attribute x, so as to generate a decryption key adk_x.

$\begin{array}{cc}\mathrm{AKG}\left(\mathrm{app},\mathrm{amk},x\right):s_3\stackrel{U}{⟵}{𝔽}_q,{\overrightarrow{\eta }}_3\stackrel{U}{⟵}{𝔽}_q^n,k_3^{*}={\left(1,-s_{3}x,0^n,{\overrightarrow{\eta }}_3,0\right)}_{{𝔹}_3^{*}},\mathrm{return}{\mathrm{adk}}_x=\left(x,k_3^{*}\right).& \left[\mathrm{Formula}122\right]\end{array}$

(Step S24: Decryption Key Output Process)

The key output unit 114 outputs, as the decryption key dk_x, the key attribute x, the tag-added decryption key including the decryption key tdk_x and the tag tg_φ generated in step S22, and the decryption key adk_x generated in step S23 to the original ciphertext decryption device 30 and the re-encryption key generation device 40 in secrecy via the communication interface 14.

To output in secrecy means to transmit after encryption by an existing encryption scheme so as to be concealed from others.

The key generation device 10 generates a decryption key dk_x′ based on a key attribute x′ which is an attribute of a user of the re-encrypted ciphertext decryption device 60. The key attribute x′ is assumed here to be an n-dimensional vector.

Specifically, in step S21, the information acceptance unit 111 accepts input of the key attribute x′. In step S22, the decryption key generation unit 113 generates a tag-added decryption key including a decryption key tdk_x′ and a tag tg_φ′, taking as input the parameter tpp, the key tmk, and the key attribute x′. In step S23, the decryption key generation unit 113 generates a decryption key adk_x′, taking as input the parameter app, the key amk, and the key attribute x′. In step S24, the decryption key generation unit 113 outputs, as the decryption key dk_x′, the key attribute x′, the tag-added decryption key including the decryption key tdk_x′ and the tag tg_φ′, and the decryption key adk_x′ to the re-encrypted ciphertext decryption device 60 in secrecy.

The Enc algorithm according to the first embodiment will be described with reference to FIG. 10.

The Enc algorithm is executed by the encryption device 20. The Enc algorithm is a probabilistic algorithm that takes as input the public parameter pp, a ciphertext attribute y, and a message m, and outputs an original ciphertext oct_y.

(Step S31: Public Parameter Acquisition Process)

The public parameter acquisition unit 211 acquires, via the communication interface 24, the public parameter pp that is made public by the key generation device 10.

(Step S32: Information Acceptance Process)

The information acceptance unit 212 accepts input of a ciphertext attribute y and a message m. Specifically, the information acceptance unit 212 accepts the ciphertext attribute y and the message m that are input through operation of an input device by a user of the encryption device 20.

The ciphertext attribute y indicates an attribute that is allowed to decrypt the original ciphertext oct_y. The ciphertext attribute y is assumed here to correspond to the key attribute x. That is, it is assumed that the original ciphertext oct_y generated based on the ciphertext attribute y can be decrypted with the decryption key dk_x in which the key attribute x is set. The ciphertext attribute y is assumed here to be an n-dimensional vector.

The message m is data to be transmitted to a destination.

(Step S33: Signature Key Generation Process)

The encryption unit 213 executes a key generation algorithm for one-time signatures, taking as input the security parameter λ, so as to generate a signature key sk and a verification key vk for a one-time signature. As the key generation algorithm for one-time signatures, an existing algorithm may be employed.

(Step S34: Ciphertext Element Generation Process)

The encryption unit 213 executes a TEnc algorithm indicated in Formula 123, taking as input the parameter tpp, the ciphertext attribute y, the verification key vk, and the message m, so as to generate an element tct_y,vk.

$\begin{array}{cc}\mathrm{TEnc}\left(\mathrm{tpp},y,\mathrm{vk},m\right):\omega ,\zeta ,{\phi }_0\stackrel{U}{⟵}{𝔽}_q,{\overrightarrow{\phi }}_1\stackrel{U}{⟵}{𝔽}_q^n,{\overrightarrow{\phi }}_2\stackrel{U}{⟵}{𝔽}_q^2,c_0={\left(\zeta ,\omega ,0,0,{\phi }_0\right)}_{{𝔹}_0},c_1={\left(\omega y,0^{2n},{\overrightarrow{\phi }}_1\right)}_{{𝔹}_1},c_2={\left(\omega \left(1,\mathrm{vk}\right),0^4,{\overrightarrow{\phi }}_2\right)}_{{𝔹}_2},c_T=m·g_T^{\zeta },\mathrm{return}{\mathrm{tct}}_{y,vk}=\left(y,c_0,c_1,c_2,c_T\right).& \left[\mathrm{Formula}123\right]\end{array}$

That is, the encryption unit 213 encrypts the message m by tag-added attribute-based encryption, so as to generate the element tct_y,vk. At this time, the encryption unit 213 sets the verification key vk in a portion of the element tct_y,vk.

(Step S35: Signature Generation Process)

The encryption unit 213 executes a signature algorithm for one-time signatures, taking as input the signature key sk, the ciphertext attribute y, and the element tct_y,vk, so as to generate a signature σ. As the signature algorithm for one-time signatures, an existing algorithm may be employed.

(Step S36: Ciphertext Output Process)

The ciphertext output unit 214 outputs, as an original ciphertext oct_y, the ciphertext attribute y, the verification key vk generated in step S33, the element tct_y,vk generated in step S34, and the signature a generated in step S35 to the original ciphertext decryption device 30.

The ODec algorithm according to the first embodiment will be described with reference to FIG. 11.

The ODec algorithm is executed by the original ciphertext decryption device 30. The ODec algorithm is an algorithm that takes as input the public parameter pp, the decryption key dk_x, and the original ciphertext oct_y, and outputs the message m.

(Step S41: Decryption Key Acquisition Process)

The decryption key acquisition unit 311 acquires, via the communication interface 34, the decryption key dk_x and the public parameter pp that are generated by the key generation device 10.

(Step S42: Ciphertext Acquisition Process)

The ciphertext acquisition unit 312 acquires, via the communication interface 34, the original ciphertext oct_y generated by the encryption device 20.

(Step S43: Decryption Tag Generation Process)

The decryption unit 313 transforms the tag tg_φ included in the decryption key dk_x to generate a decryption tag tg_vk.

Specifically, the decryption unit 313 executes a TTag algorithm indicated in Formula 124, taking as input the parameter tpp, the tag tg_φ included in the decryption key dk_x, and the verification key vk included in the original ciphertext oct_y, so as to generate the decryption tag tg_vk.

$\begin{array}{cc}\mathrm{TTag}\left(\mathrm{tpp},{\mathrm{tg}}_{\varphi },\mathrm{vk}\right):\mathrm{parse}{\mathrm{tg}}_{\varphi }=k_2^{*}={\left(s_2,0^3,{\overrightarrow{\eta }}_2,0^2\right)}_{{𝔹}_2^{*}},{\delta }_2\stackrel{U}{⟵}{𝔽}_q,t{g}_{vk}=k_2^{*\mathrm{vk}}={\mathrm{tg}}_{\varphi }+{\left({\delta }_2\left(vk,-1\right),0^6\right)}_{{𝔹}_2^{*}},\mathrm{return}{\mathrm{tg}}_{vk}.& \left[\mathrm{Formula}124\right]\end{array}$

(Step S44: Decryption Process)

The decryption unit 313 decrypts the original ciphertext oct_y to obtain the message m.

Specifically, the decryption unit 313 executes a TDec algorithm indicated in Formula 125, taking as input the parameter tpp, the decryption key tdk_x included in the decryption key dk_x, the tag tg_vk, and the element tct_y,vk included in the original ciphertext oct_y, so as to generate the message m.

TDec(tpp,tdk_x,tg_vk,tct_y,vk):

parse tdk_x=(x,k*₀,k*₁),tg_vk=k*₂^vk,

tct _y,vk=(y,c₀,c₁,c₂,c_T),

K=e(c₀,k*₀)·e(c₁,k*₁)·e(c₂,k*₂^vk),

return m=c_T/K.   [Formula 125]

The RKG algorithm according to the first embodiment will be described with reference to FIG. 12.

The RKG algorithm is executed by the re-encryption key generation device 40. The RKG algorithm is a probabilistic algorithm that takes as input the public parameter pp, the decryption key dk_x, and the ciphertext attribute y′, and outputs a re-encryption key rk_x,y′.

(Step S51: Decryption Key Acquisition Process)

The decryption key acquisition unit 411 acquires, via the communication interface 44, the decryption key dk_x and the public parameter pp that are generated by the key generation device 10.

(Step S52: Information Acceptance Process)

The information acceptance unit 412 accepts input of a ciphertext attribute y′. Specifically, the information acceptance unit 412 accepts the ciphertext attribute y′ that is input through operation of the input device by the user of the encryption device 20.

The ciphertext attribute y′ indicates an attribute that is allowed to decrypt a re-encrypted ciphertext rct_y′. The ciphertext attribute y′ is assumed here to correspond to the key attribute x′. That is, it is assumed that the re-encrypted ciphertext rct_y′, generated based on the ciphertext attribute y′ can be decrypted with the decryption key dk_x′ in which the key attribute x′ is set. The ciphertext attribute y′ is assumed here to be an n-dimensional vector.

(Step S53: Randomization Process)

The randomization unit 413 sets a random number individually in each of the decryption key tdk_x and the tag tg_φ that are included in the decryption key dk_x, so as to generate a decryption key tdk_x^{{circumflex over ( )}} and a tag tg_φ^{{circumflex over ( )}}.

Specifically, the randomization unit 413 executes a TRand algorithm indicated in Formula 126, taking as input the parameter tpp, the decryption key tdk_x, and the tag tg_φ, so as to generate the decryption key tdk_x^{{circumflex over ( )}} and the tag tg_φ^{{circumflex over ( )}}.

$\begin{array}{cc}\mathrm{TR}\mathrm{and}\left(\mathrm{tpp},td{k}_x,{\mathrm{tg}}_{\varphi }\right):\mathrm{parse}{\mathrm{tdk}}_x=\left(x,k_0^{*},k_1^{*}\right),{\mathrm{tg}}_{\varphi }=k_2^{*},s_1^{^},s_2^{^},{\delta }_1^{^},{\eta }_0^{^}\stackrel{U}{⟵}{𝔽}_q,{\overrightarrow{\eta }}_1^{^}\stackrel{U}{⟵}{𝔽}_q^n,{\overrightarrow{\eta }}_2^{^}\stackrel{U}{⟵}{𝔽}_q^2,s_0^{^}=s_1^{^}+s_2^{^},k_0^{*^}=k_0^{*}+{\left(0,-s_0^{^},0,{\eta }_0^{^},0\right)}_{{𝔹}_0^{*}},k_1^{*^}=k_1^{*}+{\left(s_1^{^}{\overrightarrow{e}}_1+{\delta }_1^{^}x,0^n,{\overrightarrow{\eta }}_1^{^},0^n\right)}_{{𝔹}_1^{*}},k_2^{*^}=k_2^{*}+{\left(s_2^{^},0^3,{\overrightarrow{\eta }}_2^{^},0^2\right)}_{{𝔹}_2^{*}},\mathrm{return}{\mathrm{tdk}}_x^{^}=\left(x,k_0^{*^},k_1^{*^}\right),{\mathrm{tg}}_{\varphi }^{^}=k_2^{*^}.& \left[\mathrm{Formula}126\right]\end{array}$

(Step S54: Encryption Key Generation Process)

The encryption key generation unit 414 encrypts the decryption key tdk_x^{{circumflex over ( )}} by an attribute-based encryption scheme using the ciphertext attribute y′, so as to generate an encryption key act_y′.

Specifically, the encryption key generation unit 414 executes an AEnc algorithm indicated in Formula 127, taking as input the parameter app, the ciphertext attribute y′, and the decryption key tdk_x^{{circumflex over ( )}}, so as to generate the encryption key act_y′.

$\begin{array}{cc}\mathrm{AEnc}\left(\mathrm{app},y^{\prime },\mathrm{td}{k}_x^{^}\right):\omega ,\zeta ,{\phi }_0\stackrel{U}{⟵}{𝔽}_q,c_3={\left(\zeta ,\omega y^{\prime },0^n,0^n,{\phi }_0\right)}_{{𝔹}_3},c_T=td{k}_x^{^}·g_T^{\zeta },\mathrm{return}{\mathrm{act}}_{y^{\prime }}=\left(y^{\prime },c_3,c_T\right).& \left[\mathrm{Formula}127\right]\end{array}$

(Step S55: Re-Encryption Key Output Process)

The re-encryption key output unit 415 outputs, as a re-encryption key rk_x,y′, the key attribute x, the ciphertext attribute y′, the tag tg_x^{{circumflex over ( )}} generated in step S53, and the encryption key act_y′ generated in step S54 to the re-encryption device 50 in secrecy.

The REnc algorithm according to the first embodiment will be described with reference to FIG. 13.

The REnc algorithm is executed by the re-encryption device 50. The REnc algorithm is a probabilistic algorithm that takes as input the public parameter pp, the re-encryption key rk_x,y′, and the original ciphertext oct_y, and outputs a re-encrypted ciphertext rct_y′.

(Step S61: Public Parameter Acquisition Process)

The public parameter acquisition unit 511 acquires, via the communication interface 54, the public parameter pp that is made public by the key generation device 10.

(Step S62: Ciphertext Acquisition Process)

The ciphertext acquisition unit 512 acquires, via the communication interface 54, the original ciphertext oct_y generated by the encryption device 20.

(Step S63: Re-Encryption Key Acquisition Process)

The re-encryption key acquisition unit 513 acquires, via the communication interface 54, the re-encryption key rk_x,y′ generated by the re-encryption key generation device 40.

(Step S64: Relation Verification Process)

The verification unit 514 determines whether or not the key attribute x included in the re-encryption key rk_x,y′ and the ciphertext attribute y included in the original ciphertext oct_y satisfy a relation R(x, y)=1. By this, the verification unit 514 determines whether or not the original ciphertext oct_y can be decrypted by the decryption key dk_x on which the re-encryption key rk_x,y′ is based.

If R(x, y)=1 is satisfied, the verification unit 514 advances the process to step S65. On the other hand, if R(x, y)=1 is not satisfied, the verification unit 514 ends the process.

(Step S65: Signature Verification Process)

The verification unit 514 verifies the signature σ included in the original ciphertext oct_y with the verification key vk included in the original ciphertext oct_y by a verification algorithm for one-time signatures. As the verification algorithm for one-time signatures, an existing algorithm may be employed.

If the verification is successful, the verification unit 514 advances the process to step S66. On the other hand, if the verification is not successful, the verification unit 514 ends the process.

(Step S66: Decryption Tag Generation Process)

The decryption tag generation unit 515 transforms the tag tg_φ^{{circumflex over ( )}} included in the re-encryption key rk_x,y′ to generate a decryption tag tg_vk.

Specifically, the decryption tag generation unit 515 executes a TTag algorithm indicated in Formula 128, taking as input the parameter tpp, the tag tg_φ^{{circumflex over ( )}}, and the verification key vk included in the original ciphertext oct_y, so as to generate the decryption tag tg_yk.

$\begin{array}{cc}\mathrm{TTag}\left(\mathrm{tpp},{\mathrm{tg}}_{\varphi }^{^},\mathrm{vk}\right):\mathrm{parse}{\mathrm{tg}}_{\varphi }^{^}=k_2^{*}+\alpha ,{\delta }_2\stackrel{U}{⟵}{𝔽}_q,{\mathrm{tg}}_{\mathrm{vk}}=k_2^{*\mathrm{vk}}={\mathrm{tg}}_{\varphi }^{^}+{\left({\delta }_2\left(\mathrm{vk},-1\right),0^6\right)}_{{𝔹}_2^{*}},\mathrm{return}{\mathrm{tg}}_{\mathrm{vk}}.& \left[\mathrm{Formula}128\right]\end{array}$

(Step S67: Re-Encryption Process)

The re-encryption unit 516 encrypts the original ciphertext oct_y, the encryption key act_y′ included in the re-encryption key rk_x,y′, and the decryption tag tg_vk by an attribute-based encryption scheme using the ciphertext attribute y′ included in the re-encryption key rk_v,y′, so as to generate a re-encrypted ciphertext rct_y′.

Specifically, the re-encryption unit 516 executes an AEnc algorithm indicated in Formula 129, taking as input the parameter app, the ciphertext attribute y′, and data oct_y∥act_y·∥tg_vk which is a concatenation of the original ciphertext oct_y, the encryption key act_y′, and the decryption tag tg_vk, so as to generate the re-encrypted ciphertext rct_y′.

$\begin{array}{cc}\mathrm{AEnc}\left(\mathrm{app},y^{\prime },\mathrm{oc}{t}_y{\mathrm{act}}_{y^{\prime }}{\mathrm{tg}}_{vk}\right):\omega ,\zeta ,{\phi }_0\stackrel{U}{⟵}{𝔽}_q,c_3={\left(\zeta ,\omega y^{\prime },0^n,0^n,{\phi }_0\right)}_{{𝔹}_3},c_T=oc{t}_y{\mathrm{act}}_{y^{\prime }}{\mathrm{tg}}_{vk}·g_T^{\zeta },\mathrm{return}{\mathrm{rct}}_{y^{\prime }}=\left(y^{\prime },c_3,c_T\right).& \left[\mathrm{Formula}129\right]\end{array}$

(Step S68: Re-Encrypted Ciphertext Output Process)

The re-encrypted ciphertext output unit 517 outputs the re-encrypted ciphertext rct_y′ generated in step S67 to the re-encrypted ciphertext decryption device 60.

The RDec algorithm according to the first embodiment will be described with reference to FIG. 14.

The RDec algorithm is executed by the re-encrypted ciphertext decryption device 60. The RDec algorithm is an algorithm that takes as input the public parameter pp, the decryption key dk_x′, and the re-encrypted ciphertext ra_y′, and outputs the message m.

(Step S71: Decryption Key Acquisition Process)

The decryption key acquisition unit 611 acquires, via the communication interface 64, the decryption key dk_x′ and the public parameter pp that are generated by the key generation device 10.

(Step S72: Re-Encrypted Ciphertext Acquisition Process)

The re-encrypted ciphertext acquisition unit 612 acquires, via the communication interface 64, the re-encrypted ciphertext rct_y′ generated by the re-encryption device 50.

(Step S73: First Decryption Process)

The first decryption unit 613 decrypts the re-encrypted ciphertext rct_y′ with the decryption key adk_x′ in which the key attribute x′ corresponding to the ciphertext attribute y′ is set, so as to obtain the original ciphertext oct_y, the encryption key act_y′, and the decryption tag tg_vk^{{circumflex over ( )}}.

Specifically, the first decryption unit 613 executes an ADec algorithm indicated in Formula 130, taking as input the parameter app, the decryption key adk_x′ included in the decryption key dk_x′, and the re-encrypted ciphertext rct_y′, so as to generate the original ciphertext oct_y, the encryption key act_y′, and the decryption tag tg_vk.

ADec(app,adk_x′,rct_y′):

parse adk_x′=(x′,k*₃),rct_y′=(y′,c₃,c_T),

K=e(c₃,k*₃),

return oct_y∥act_y′∥tg_vk=c_T/K  [Formula 130]

(Step S74: Second Decryption Process)

The second decryption unit 614 decrypts the encryption key act_y′ with the decryption key adk_x′, so as to obtain the decryption key tdk_x^{{circumflex over ( )}} in which the random number is set.

Specifically, the second decryption unit 614 executes an ADec algorithm indicated in Formula 131, taking as input the parameter app, the decryption key adk_x′ included in the decryption key dk_x′, and the encryption key act_y′, so as to generate the decryption key tdk_x^{{circumflex over ( )}}.

ADec(app,adk_x′,act_y′):

parse adk_x′=(x′,k*₃),act_y′=(y′,c₃,c_T),

K=e(c₃,k*₃),

return tdk_φ^{{circumflex over ( )}}=c_T/K.   [Formula 131]

(Step S75: Third Decryption Process)

The third decryption unit 615 decrypts the original ciphertext oct_y to obtain the message m.

Specifically, the third decryption unit 615 executes a TDec algorithm indicated in Formula 132, taking as input the parameter tpp, the decryption key tdk_x^{{circumflex over ( )}}, the decryption tag tg_vk, and the element tct_y,vk included in the original ciphertext oct_y, so as to generate the message m.

TDec(tpp,tdk_φ^{{circumflex over ( )}},tg_vk,tct_y,vk):

parse tdk_x^{{circumflex over ( )}}=(x,k*₀^{{circumflex over ( )}},k*₁^{{circumflex over ( )}}),tg_vk=k*₂^vk,

tct _y,vk=(y,c₀,c₁,c₂,c_T),

K=e(c₀,k*₀^{{circumflex over ( )}})·e(c₁,k*₁^{{circumflex over ( )}})·e(c₂,k*₂^vk),

return m=c_T/K.   [Formula 132]

Effects of First Embodiment

As described above, the cryptographic system 1 according to the first embodiment realizes an attribute-based proxy-re-encryption scheme, using tag-added attribute-based encryption and tagless attribute-based encryption. The cryptographic system 1 according to the first embodiment encrypts a decryption key of tag-added attribute-based encryption using attribute-based encryption, so as to generate a re-encryption key. This eliminates the need to include a random matrix in a re-encrypted ciphertext, so that an increase in the size of a ciphertext entailed in re-encryption can be reduced.

In the cryptographic system 1 according to the first embodiment, the re-encryption key generation device 40 encrypts the decryption key tdk_φ^{{circumflex over ( )}} using the ciphertext attribute y′ when generating the re-encryption key rk_x,y′. Therefore, the re-encryption device 50 cannot decrypt the original ciphertext oct_y with the re-encryption key rk_x,y′.

In the cryptographic system 1 according to the first embodiment, the re-encryption key generation device 40 does not encrypt the tag tg_φ^{{circumflex over ( )}} when generating the re-encryption key rk_v,y′. Therefore, the re-encryption device 50 can generate the decryption tag tg_vk by setting the verification key vk in the tag tg_φ^{{circumflex over ( )}}. The decryption tag tg_vk in which the verification key vk is set, instead of the tag tg_φ^{{circumflex over ( )}}, is included in the re-encrypted ciphertext rct_y′, so that the re-encrypted ciphertext decryption device 60 can decrypt only a ciphertext in which the verification key vk is set.

Note that in the first embodiment, the verification key vk is set in the original ciphertext oct_y and the decryption tag tg_vk. However, even when different data vk, instead of the verification key vk, is set in the original ciphertext oct_y and the decryption tag tg_vk, it is possible to obtain the effect of allowing the re-encrypted ciphertext decryption device 60 to decrypt only a ciphertext in which the data vk is set.

***Other Configurations***

<First Variation>

In the first embodiment, the functional components of the key generation device 10, the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, the re-encryption device 50, and the re-encrypted ciphertext decryption device 60 are realized by software. However, as a first variation, the functional components may be realized by hardware. Differences in this first variation from the first embodiment will be described.

A configuration of a key generation device 10 according to the first variation will be described with reference to FIG. 15.

When the functions are realized by hardware, the key generation device 10 includes an electronic circuit 15 in place of the processor 11, the memory 12, and the storage 13. The electronic circuit 15 is a dedicated electronic circuit that realizes the functions of the memory 12, the storage 13, and the functional components of the key generation device 10.

A configuration of an encryption device 20 according to the first variation will be described with reference to FIG. 16.

When the functions are realized by hardware, the encryption device 20 includes an electronic circuit 25 in place of the processor 21, the memory 22, and the storage 23. The electronic circuit 25 is a dedicated electronic circuit that realizes the functions of the memory 22, the storage 23, and the functional components of the encryption device 20.

A configuration of an original ciphertext decryption device 30 according to the first variation will be described with reference to FIG. 17.

When the functions are realized by hardware, the original ciphertext decryption device 30 includes an electronic circuit 35 in place of the processor 31, the memory 32, and the storage 33. The electronic circuit 35 is a dedicated electronic circuit that realizes the functions of the memory 32, the storage 33, and the functional components of the original ciphertext decryption device 30.

A configuration of a re-encryption key generation device 40 according to the first variation will be described with reference to FIG. 18.

When the functions are realized by hardware, the re-encryption key generation device 40 includes an electronic circuit 45 in place of the processor 41, the memory 42, and the storage 43. The electronic circuit 45 is a dedicated electronic circuit that realizes the functions of the memory 42, and the storage 43, and the functional components of the re-encryption key generation device 40.

A configuration of a re-encryption device 50 according to the first variation will be described with reference to FIG. 19.

When the functions are realized by hardware, the re-encryption device 50 includes an electronic circuit 55 in place of the processor 51, the memory 52, and the storage 53. The electronic circuit 55 is a dedicated electronic circuit that realizes the functions of the memory 52, the storage 53, and the functional components of the re-encryption device 50.

A configuration of a re-encrypted ciphertext decryption device 60 according to the first variation will be described with reference to FIG. 20.

When the functions are realized by hardware, the re-encrypted ciphertext decryption device 60 includes an electronic circuit 65 in place of the processor 61, the memory 62, and the storage 63. The electronic circuit 65 is a dedicated electronic circuit that realizes the functions of the memory 62, the storage 63, and the functional components of the re-encrypted ciphertext decryption device 60.

Each of the electronic circuits 15, 25, 35, 45, 55, and 65 is assumed to be a single circuit, a composite circuit, a programmed processor, a parallel-programmed processor, a logic IC, a gate array (GA), an application specific integrated circuit (ASIC), and a field-programmable gate array (FPGA).

The functions of the functional components of the key generation device 10 may be realized by one electronic circuit 15, or the functions of the functional components may be distributed to and realized by a plurality of electronic circuits 15. Similarly, the functions of the functional complements of the encryption device 20, the original ciphertext decryption device 30, the re-encryption key generation device 40, the re-encryption device 50, and the re-encrypted ciphertext decryption device 60 may be realized by one electronic circuit 25, 35, 45, 55, and 65, respectively, or the functions of the functional components may be distributed to and realized by a plurality of electronic circuits 25, 35, 45, 55, and 65, respectively.

<Second Variation>

As a second variation, some of the functions may be realized by hardware, and the rest of the functions may be realized by software. That is, some functions of the functional components may be realized by hardware, and the rest of the functions may be realized by software.

Each of the processors 11, 21, 31, 41, 51, and 61, the memories 12, 22, 32, 42, 52, and 62, and the electronic circuits 15, 25, 35, 45, 55, and 65 is referred to as processing circuitry. That is, the functions of the functional components are realized by the processing circuitry.

REFERENCE SIGNS LIST

1: cryptographic system, 10: key generation device, 11: processor, 12: memory, 13: storage, 14: communication interface, 15: electronic circuit, 111: information acceptance unit, 112: master key generation unit, 113: decryption key generation unit, 114: key output unit, 20: encryption device, 21: processor, 22: memory, 23: storage, 24: communication interface, 25: electronic circuit, 211: public parameter acquisition unit, 212: information acceptance unit, 213: encryption unit, 214: ciphertext output unit, 30: original ciphertext decryption device, 31: processor, 32: memory, 33: storage, 34: communication interface, 35: electronic circuit, 311: decryption key acquisition unit, 312: ciphertext acquisition unit, 313: decryption unit, 40: re-encryption key generation device, 41: processor, 42: memory, 43: storage, 44: communication interface, 45: electronic circuit, 411: decryption key acquisition unit, 412: information acceptance unit, 413: randomization unit, 414: encryption key generation unit, 415: re-encryption, key output unit, 50: re-encryption device, 51: processor, 52: memory, 53: storage, 54: communication interface, 55: electronic circuit, 511: public parameter acquisition unit, 512: ciphertext acquisition unit, 513: re-encryption key acquisition unit, 514: verification unit, 515: decryption tag generation unit, 516: re-encryption unit, 517: re-encrypted ciphertext output unit, 60: re-encrypted ciphertext decryption device, 61: processor, 62: memory, 63: storage, 64: communication interface, 65: electronic circuit, 611: decryption key acquisition unit, 612: re-encrypted ciphertext acquisition unit, 613: first decryption unit, 614: second decryption unit, 615: third decryption unit

Claims

1-9. (canceled)

10. A re-encryption key generation device comprising: processing circuitry to:set a random number in a decryption key tdkx in which a key attribute x is set and set a random number in a tag tgφ used to decrypt a ciphertext with the decryption key tdkx, so as to generate a decryption key tdkx{circumflex over ( )} and a tag tgφ{circumflex over ( )};encrypt the generated decryption key tdkx{circumflex over ( )} by an attribute-based encryption scheme using a ciphertext attribute y′, so as to generate an encryption key acty; andoutput a re-encryption key rkx,v′ including the encryption key acty′ and the tag tgφ{circumflex over ( )} that are generated.

11. The re-encryption key generation device according to claim 10, wherein the re-encryption key rkx,y′ is a key for generating, from an original ciphertext octy in which a ciphertext attribute y corresponding to the key attribute x is set, a re-encrypted ciphertext rety′ that can be decrypted with a decryption key adkx′ in which a key attribute x′ corresponding to the ciphertext attribute y′ is set.

12. The re-encryption key generation device according to claim 10, wherein the processing circuitry generates the decryption key tdkx{circumflex over ( )} and the tag tgφ{circumflex over ( )}, as indicated in Formula 1, andgenerates the encryption key acty′, as indicated in Formula 2

13. The re-encryption key generation device according to claim 11, wherein the processing circuitry generates the decryption key tdkx{circumflex over ( )} and the tag tgφ{circumflex over ( )}, as indicated in Formula 3, andgenerates the encryption key acty′, as indicated in Formula 4

14. A re-encryption device comprising: processing circuitry to:acquire an original ciphertext octy in which a ciphertext attribute y is set;acquire a re-encryption key rkx,y′ including an encryption key acty′ and a tag tgφ{circumflex over ( )}, the encryption key acty′ being generated by setting a random number in a decryption key tdkx in which a key attribute x corresponding to the ciphertext attribute y is set and then encrypting the decryption key tdkx by an attribute-based encryption scheme using a ciphertext attribute y′, the tag tgφ being obtained by setting a random number in a tag tgφ used to decrypt a ciphertext with the decryption key tdkx;transform the tag tgφ{circumflex over ( )} included in the acquired re-encryption key rkx,y′, so as to generate a decryption tag tgvk; andencrypt the acquired original ciphertext octy, the encryption key acty′ included in the acquired re-encryption key rkx,y′, and the generated decryption tag tgvk by an attribute-based encryption scheme using the ciphertext attribute y′, so as to generate a re-encrypted ciphertext rcty′.

15. The re-encryption device according to claim 14, wherein data vk is set in the original ciphertext octy, andwherein the processing circuitry generates the decryption tag tgvk by setting the data vk in the tag tgφ{circumflex over ( )}.

16. The re-encryption device according to claim 14, wherein the processing circuitry generates the decryption tag tgvk, as indicated in Formula 5, andgenerates the re-encrypted ciphertext rcty′, as indicated in Formula 6

17. The re-encryption device according to claim 15, wherein the processing circuitry generates the decryption tag tgyk, as indicated in Formula 7, andgenerates the re-encrypted ciphertext rety′, as indicated in Formula 8

18. A re-encrypted ciphertext decryption device comprising: processing circuitry to:acquire a re-encrypted ciphertext rcty′ generated by encrypting an original ciphertext octy in which a ciphertext attribute y is set, an encryption key acty′, and a decryption tag tgvk by an attribute-based encryption scheme using a ciphertext attribute y′, the encryption key acty′ being generated by setting a random number in a decryption key tdkx in which a key attribute x corresponding to the ciphertext attribute y is set, and then encrypting the decryption key tdkx by an attribute-based encryption scheme using a ciphertext attribute y′, the decryption tag tgvk being generated from a tag tgφ used to decrypt a ciphertext with the decryption key tdkx;decrypt the acquired re-encrypted ciphertext rcty′ with a decryption key adkx′ in which a key attribute x′ corresponding to the ciphertext attribute y′ is set, so as to generate the original ciphertext octy, the encryption key acty′, and the decryption tag tgvk;decrypt the generated encryption key acty′ with the decryption key adkx′, so as to generate a decryption key tdkx{circumflex over ( )} in which a random number is set; anddecrypt the original ciphertext octy, using the generated decryption key tdkx{circumflex over ( )} in which the random number is set and the decryption tag tgyk.

19. The re-encrypted ciphertext decryption device according to claim 18, wherein the processing circuitry acquires the re-encrypted ciphertext rcty′ indicated in Formula 9,generates the original ciphertext octy the encryption key acty′, and the decryption tag tgvk, as indicated in Formula 10,generates the decryption key tdkx, as indicated in Formula 11, anddecrypts the original ciphertext octy, as indicated in Formula 12

20. A cryptographic system comprising: a key generation device to generate a decryption key dkx having a tag-added decryption key and a decryption key adkx, the tag-added decryption key including a decryption key tdkx in which a key attribute x is set and a tag tgφ used to decrypt a ciphertext with the decryption key tdkx, the decryption key adkx being a key in which the key attribute x is set;an encryption device to generate an original ciphertext octy in which a ciphertext attribute y corresponding to the key attribute x is set and which can be decrypted with the tag-added decryption key generated by the key generation device; anda re-encryption key generation device to encrypt the decryption key tdkx generated by the key generation device by an attribute-based encryption scheme using a ciphertext attribute y′, so as to generate a re-encryption key rkx,y′ which is a key for generating a re-encrypted ciphertext rcty′ that can be decrypted with a decryption key adkx′ in which a key attribute x′ corresponding to the ciphertext attribute y′ is set.