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
동형암호(HE)는 암호화된 데이터를 해독하지 않고 분석하는 데 유용합니다. 그러나 일반 HE를 이용하면 서로 다른 공개키로 암호화된 암호문들 간에는 동형연산을 수행할 수 없기 때문에 동형연산을 수행하여 생성된 암호문을 복호화할 수 있는 사용자는 동형평가가 수행되지 않은 암호문도 복호화할 수 있다. . 위의 문제를 해결하기 위해 PRE(프록시 재암호화)의 "키 전환" 속성과 HE의 동형 속성을 결합한 HPRE(동형 프록시 재암호화)라는 새로운 암호화 기본 요소를 도입합니다. HPRE에서는 재암호화되지 않은 원본 암호문이 CCA2 보안을 보장합니다(특히 비가단성을 충족합니다). 반면, 재암호화된 암호문은 CPA 보안만 보장하므로 동형 연산이 수행될 수 있습니다. HPRE의 기능/보안 요구사항을 정의한 후 Libert 및 Vergnaud(PKC 2008)의 PRE 체계와 CCA 보안 공개 키 암호화 체계를 기반으로 그룹 운영(이중선형 그룹의 대상 그룹에 대해)을 지원하는 특정 구성을 제안합니다. 작성자: Lai et al. (CT-RSA 2010), 표준 모델에서 보안성을 입증합니다. 또한 그룹 작업을 위한 HPRE 체계의 두 가지 확장을 보여줍니다. 또한 그리고 HPRE 계획 2차 다항식 (2차 항의 수가 일정한 경우), Catalano와 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.
부
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
부
@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},}
부
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 -