Paper 2024/1977
Bounded CCA Secure Proxy Re-encryption Based on Kyber
Abstract
Proxy re-encryption (PRE) allows semi-honest party (called proxy) to convert a ciphertext under a public key into a ciphertext under another public key. Due to this functionality, there are various applications such as encrypted email forwarding, key escrow, and securing distributed file systems. Meanwhile, post-quantum cryptography (PQC) is one of the most important research areas because development of quantum computers has been advanced recently. In particular, there are many researches on public key encryption (PKE) algorithms selected/submitted in the NIST (National Institute of Standards and Technology) PQC standardization. However, there is no post-quantum PRE scheme secure against adaptive chosen ciphertext attacks (denoted by CCA security) while many (post-quantum) PRE schemes have been proposed so far. In this paper, we propose a bounded CCA secure PRE scheme based on CRYSTALS-Kyber which is a selected algorithm in the NIST PQC competition. To this end, we present generic constructions of bounded CCA secure PRE. Our generic constructions start from PRE secure against chosen plaintext attacks (denoted by CPA security). In order to instantiate our generic constructions, we present a CPA secure PRE scheme based on CRYSTALS-Kyber.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Proxy re-encryptionLattice-based cryptographyPost-quantum cryptography
- Contact author(s)
-
sato-shingo-zk @ ynu ac jp
shikata-junji-rb @ ynu ac jp - History
- 2024-12-20: revised
- 2024-12-06: received
- See all versions
- Short URL
- https://ia.cr/2024/1977
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1977,
author = {Shingo Sato and Junji Shikata},
title = {Bounded {CCA} Secure Proxy Re-encryption Based on Kyber},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1977},
year = {2024},
url = {https://eprint.iacr.org/2024/1977}
}
