Paper 2018/382
Revocable Identity-based Encryption from Codes with Rank Metric
Donghoon Chang, Amit Kumar Chauhan, Sandeep Kumar, and Somitra Kumar Sanadhya
Abstract
In this paper, we present an identity-based encryption scheme from codes with efficient key revocation. Recently, in Crypto 2017, Gaborit et al. proposed a first identity-based encryption scheme from codes with rank metric, called RankIBE. To extract the decryption key from any public identity, they constructed a trapdoor function which relies on RankSign, a signature scheme proposed by Gaborit et al. in PQCrypto 2014. We adopt the same trapdoor function to add efficient key revocation functionality in the RankIBE scheme. Our revocable IBE scheme from codes with rank metric makes use of a binary tree data structure to reduce the amount of work in terms of key updates for the key authority. The total size of key updates requires logarithmic complexity in the maximum number of users and linear in the number of revoked users. We prove that our revocable IBE scheme is selective-ID secure in the random oracle model, under the hardness of three problems: the Rank Syndrome Decoding (RSD) problem, the Augmented Low-Rank Parity Check Code (LRPC+) problem, and the Rank Support Learning (RSL) problem.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Major revision. CT-RSA 2018
- DOI
- 10.1007/978-3-319-76953-0
- Keywords
- Code-based CryptographyIdentity-based EncryptionKey RevocationRank MetricLRPC CodesRSD Problem
- Contact author(s)
- 2017csz0008 @ iitrpr ac in
- History
- 2018-04-30: received
- Short URL
- https://ia.cr/2018/382
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/382,
author = {Donghoon Chang and Amit Kumar Chauhan and Sandeep Kumar and Somitra Kumar Sanadhya},
title = {Revocable Identity-based Encryption from Codes with Rank Metric},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/382},
year = {2018},
doi = {10.1007/978-3-319-76953-0},
url = {https://eprint.iacr.org/2018/382}
}
