The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A criptografia homomórfica (HE) é útil para analisar dados criptografados sem descriptografá-los. No entanto, ao usar HE comum, um usuário que pode descriptografar um texto cifrado gerado pela execução de operações homomórficas, também pode descriptografar textos cifrados nos quais avaliações homomórficas não foram realizadas, uma vez que operações homomórficas não podem ser executadas entre textos cifrados que são criptografados sob diferentes chaves públicas. . Para resolver o problema acima, introduzimos uma nova primitiva criptográfica chamada Homomorphic Proxy Re-Encryption (HPRE) combinando a propriedade de “troca de chave” da Proxy Re-Encryption (PRE) e a propriedade homomórfica de HE. Em nosso HPRE, os textos cifrados originais (que não foram recriptografados) garantem a segurança CCA2 (e, em particular, satisfazem a não maleabilidade). Por outro lado, os textos cifrados recriptografados apenas garantem a segurança do CPA, para que operações homomórficas possam ser realizadas neles. Definimos os requisitos funcionais/de segurança do HPRE e, em seguida, propomos uma construção específica de suporte à operação do grupo (sobre o grupo-alvo em grupos bilineares) com base no esquema PRE de Libert e Vergnaud (PKC 2008) e no esquema de criptografia de chave pública segura CCA por Lai et al. (CT-RSA 2010), e comprovar sua segurança no modelo padrão. Além disso, mostramos duas extensões do nosso esquema HPRE para operação em grupo: um esquema HPRE para Adição e um esquema HPRE para polinômios de grau 2 (em que o número de termos do grau 2 é constante), utilizando a técnica do trabalho recente de Catalano e Fiore (ACMCCS 2015).
Yutaka KAWAI
Mitsubishi Electric
Takahiro MATSUDA
National Institute of Advanced Industrial Science and Technology (AIST)
Takato HIRANO
Mitsubishi Electric
Yoshihiro KOSEKI
Mitsubishi Electric
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology (AIST)
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yutaka KAWAI, Takahiro MATSUDA, Takato HIRANO, Yoshihiro KOSEKI, Goichiro HANAOKA, "Proxy Re-Encryption That Supports Homomorphic Operations for Re-Encrypted Ciphertexts" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 1, pp. 81-98, January 2019, doi: 10.1587/transfun.E102.A.81.
Abstract: Homomorphic encryption (HE) is useful to analyze encrypted data without decrypting it. However, by using ordinary HE, a user who can decrypt a ciphertext that is generated by executing homomorphic operations, can also decrypt ciphertexts on which homomorphic evaluations have not been performed, since homomorphic operations cannot be executed among ciphertexts which are encrypted under different public keys. To resolve the above problem, we introduce a new cryptographic primitive called Homomorphic Proxy Re-Encryption (HPRE) combining the “key-switching” property of Proxy Re-Encryption (PRE) and the homomorphic property of HE. In our HPRE, original ciphertexts (which have not been re-encrypted) guarantee CCA2 security (and in particular satisfy non-malleability). On the other hand, re-encrypted ciphertexts only guarantee CPA security, so that homomorphic operations can be performed on them. We define the functional/security requirements of HPRE, and then propose a specific construction supporting the group operation (over the target group in bilinear groups) based on the PRE scheme by Libert and Vergnaud (PKC 2008) and the CCA secure public key encryption scheme by Lai et al. (CT-RSA 2010), and prove its security in the standard model. Additionally, we show two extensions of our HPRE scheme for the group operation: an HPRE scheme for addition and an HPRE scheme for degree-2 polynomials (in which the number of degree-2 terms is constant), by using the technique of the recent work by Catalano and Fiore (ACMCCS 2015).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.81/_p
Copiar
@ARTICLE{e102-a_1_81,
author={Yutaka KAWAI, Takahiro MATSUDA, Takato HIRANO, Yoshihiro KOSEKI, Goichiro HANAOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Proxy Re-Encryption That Supports Homomorphic Operations for Re-Encrypted Ciphertexts},
year={2019},
volume={E102-A},
number={1},
pages={81-98},
abstract={Homomorphic encryption (HE) is useful to analyze encrypted data without decrypting it. However, by using ordinary HE, a user who can decrypt a ciphertext that is generated by executing homomorphic operations, can also decrypt ciphertexts on which homomorphic evaluations have not been performed, since homomorphic operations cannot be executed among ciphertexts which are encrypted under different public keys. To resolve the above problem, we introduce a new cryptographic primitive called Homomorphic Proxy Re-Encryption (HPRE) combining the “key-switching” property of Proxy Re-Encryption (PRE) and the homomorphic property of HE. In our HPRE, original ciphertexts (which have not been re-encrypted) guarantee CCA2 security (and in particular satisfy non-malleability). On the other hand, re-encrypted ciphertexts only guarantee CPA security, so that homomorphic operations can be performed on them. We define the functional/security requirements of HPRE, and then propose a specific construction supporting the group operation (over the target group in bilinear groups) based on the PRE scheme by Libert and Vergnaud (PKC 2008) and the CCA secure public key encryption scheme by Lai et al. (CT-RSA 2010), and prove its security in the standard model. Additionally, we show two extensions of our HPRE scheme for the group operation: an HPRE scheme for addition and an HPRE scheme for degree-2 polynomials (in which the number of degree-2 terms is constant), by using the technique of the recent work by Catalano and Fiore (ACMCCS 2015).},
keywords={},
doi={10.1587/transfun.E102.A.81},
ISSN={1745-1337},
month={January},}
Copiar
TY - JOUR
TI - Proxy Re-Encryption That Supports Homomorphic Operations for Re-Encrypted Ciphertexts
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 81
EP - 98
AU - Yutaka KAWAI
AU - Takahiro MATSUDA
AU - Takato HIRANO
AU - Yoshihiro KOSEKI
AU - Goichiro HANAOKA
PY - 2019
DO - 10.1587/transfun.E102.A.81
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2019
AB - Homomorphic encryption (HE) is useful to analyze encrypted data without decrypting it. However, by using ordinary HE, a user who can decrypt a ciphertext that is generated by executing homomorphic operations, can also decrypt ciphertexts on which homomorphic evaluations have not been performed, since homomorphic operations cannot be executed among ciphertexts which are encrypted under different public keys. To resolve the above problem, we introduce a new cryptographic primitive called Homomorphic Proxy Re-Encryption (HPRE) combining the “key-switching” property of Proxy Re-Encryption (PRE) and the homomorphic property of HE. In our HPRE, original ciphertexts (which have not been re-encrypted) guarantee CCA2 security (and in particular satisfy non-malleability). On the other hand, re-encrypted ciphertexts only guarantee CPA security, so that homomorphic operations can be performed on them. We define the functional/security requirements of HPRE, and then propose a specific construction supporting the group operation (over the target group in bilinear groups) based on the PRE scheme by Libert and Vergnaud (PKC 2008) and the CCA secure public key encryption scheme by Lai et al. (CT-RSA 2010), and prove its security in the standard model. Additionally, we show two extensions of our HPRE scheme for the group operation: an HPRE scheme for addition and an HPRE scheme for degree-2 polynomials (in which the number of degree-2 terms is constant), by using the technique of the recent work by Catalano and Fiore (ACMCCS 2015).
ER -