Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption

Masaya Yasuda; Takeshi Koshiba; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama

doi:10.1145/2732516.2732521

Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption

Masaya Yasuda, Takeshi Koshiba, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in general. To resolve the problem, re-encryption allows operations on such ciphertexts by unifying the different keys into a new one. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), and give a practical re-encryption method. Our strategy for efficient re-encryption is to simply rewrite the decryption circuit and then to evaluate the circuit homomorphically with auxiliary information. In particular, our method requires only a few homomorphic operations for re-encryption, and it can be applied to various applications such as secure key exchange for collaboratively computing multiple users' data in the cloud.

Original language	English
Title of host publication	SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015
Publisher	Association for Computing Machinery, Inc
Pages	53-61
Number of pages	9
ISBN (Electronic)	9781450334471
DOIs	https://doi.org/10.1145/2732516.2732521
Publication status	Published - 2015 Apr 14
Externally published	Yes
Event	3rd ACM International Workshop on Security in Cloud Computing, SCC 2015 - Singapore, Singapore Duration: 2015 Apr 14 → …

Publication series

Name	SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015

Other

Other	3rd ACM International Workshop on Security in Cloud Computing, SCC 2015
Country/Territory	Singapore
City	Singapore
Period	15/4/14 → …

Keywords

Homomorphic encryption
LWE assumption
Re-encryption
Secure key exchange

ASJC Scopus subject areas

Software

Access to Document

10.1145/2732516.2732521

Cite this

Yasuda, M., Koshiba, T., Shimoyama, T., Kogure, J., & Yokoyama, K. (2015). Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption. In SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015 (pp. 53-61). (SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015). Association for Computing Machinery, Inc. https://doi.org/10.1145/2732516.2732521

Secure data devolution : Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption. / Yasuda, Masaya; Koshiba, Takeshi; Shimoyama, Takeshi et al.

SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015. Association for Computing Machinery, Inc, 2015. p. 53-61 (SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yasuda, M, Koshiba, T, Shimoyama, T, Kogure, J & Yokoyama, K 2015, Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption. in SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015. SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015, Association for Computing Machinery, Inc, pp. 53-61, 3rd ACM International Workshop on Security in Cloud Computing, SCC 2015, Singapore, Singapore, 15/4/14. https://doi.org/10.1145/2732516.2732521

Yasuda M, Koshiba T, Shimoyama T, Kogure J, Yokoyama K. Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption. In SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015. Association for Computing Machinery, Inc. 2015. p. 53-61. (SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015). doi: 10.1145/2732516.2732521

Yasuda, Masaya ; Koshiba, Takeshi ; Shimoyama, Takeshi et al. / Secure data devolution : Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption. SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015. Association for Computing Machinery, Inc, 2015. pp. 53-61 (SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015).

@inproceedings{7a12861ca2a54c5b9bff6d3889a8ea66,

title = "Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption",

abstract = "Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in general. To resolve the problem, re-encryption allows operations on such ciphertexts by unifying the different keys into a new one. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), and give a practical re-encryption method. Our strategy for efficient re-encryption is to simply rewrite the decryption circuit and then to evaluate the circuit homomorphically with auxiliary information. In particular, our method requires only a few homomorphic operations for re-encryption, and it can be applied to various applications such as secure key exchange for collaboratively computing multiple users' data in the cloud.",

keywords = "Homomorphic encryption, LWE assumption, Re-encryption, Secure key exchange",

author = "Masaya Yasuda and Takeshi Koshiba and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 3rd ACM International Workshop on Security in Cloud Computing, SCC 2015 ; Conference date: 14-04-2015",

year = "2015",

month = apr,

day = "14",

doi = "10.1145/2732516.2732521",

language = "English",

series = "SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015",

publisher = "Association for Computing Machinery, Inc",

pages = "53--61",

booktitle = "SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015",

}

TY - GEN

T1 - Secure data devolution

T2 - 3rd ACM International Workshop on Security in Cloud Computing, SCC 2015

AU - Yasuda, Masaya

AU - Koshiba, Takeshi

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Yokoyama, Kazuhiro

PY - 2015/4/14

Y1 - 2015/4/14

N2 - Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in general. To resolve the problem, re-encryption allows operations on such ciphertexts by unifying the different keys into a new one. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), and give a practical re-encryption method. Our strategy for efficient re-encryption is to simply rewrite the decryption circuit and then to evaluate the circuit homomorphically with auxiliary information. In particular, our method requires only a few homomorphic operations for re-encryption, and it can be applied to various applications such as secure key exchange for collaboratively computing multiple users' data in the cloud.

AB - Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in general. To resolve the problem, re-encryption allows operations on such ciphertexts by unifying the different keys into a new one. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), and give a practical re-encryption method. Our strategy for efficient re-encryption is to simply rewrite the decryption circuit and then to evaluate the circuit homomorphically with auxiliary information. In particular, our method requires only a few homomorphic operations for re-encryption, and it can be applied to various applications such as secure key exchange for collaboratively computing multiple users' data in the cloud.

KW - Homomorphic encryption

KW - LWE assumption

KW - Re-encryption

KW - Secure key exchange

UR - http://www.scopus.com/inward/record.url?scp=84959292699&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959292699&partnerID=8YFLogxK

U2 - 10.1145/2732516.2732521

DO - 10.1145/2732516.2732521

M3 - Conference contribution

AN - SCOPUS:84959292699

T3 - SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015

SP - 53

EP - 61

BT - SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015

PB - Association for Computing Machinery, Inc

Y2 - 14 April 2015

ER -

Secure data devolution: Practical re-encryption with auxiliary data in LWE-based somewhat homomorphic encryption

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this