Book ChapterDOI
Revocable Identity-Based Encryption from Codes with Rank Metric
Donghoon Chang,Amit Kumar Chauhan,Sandeep Kumar,Sandeep Kumar,Somitra Kumar Sanadhya +4 more
- pp 435-451
Reads0
Chats0
TLDR
In this article, the authors proposed an identity-based encryption scheme from codes with efficient key revocation using a binary tree data structure to reduce the amount of work in terms of key updates for the key authority.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 (\(\textsf {LRPC}^+\)) problem, and the Rank Support Learning (RSL) problem.read more
Citations
More filters
Book ChapterDOI
Lattice-Based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance.
TL;DR: Revocable identity-based encryption (RIBE) is an extension of IBE that supports a key revocation mechanism, which is an indispensable feature for practical cryptographic schemes.
Book ChapterDOI
Identity-Based Broadcast Encryption with Efficient Revocation
TL;DR: Li et al. as discussed by the authors proposed a revocable identity-based broadcast encryption (IBBE) scheme, where a key authority releases a key update material periodically in such a way that only non-revoked users can update their decryption keys.
Journal ArticleDOI
Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
TL;DR: This paper proposes the first lattice-based RHIBE scheme with DKER without relying on the key re-randomization property, departing from all the previously known methods.
Posted Content
Adaptively Secure Revocable Hierarchical IBE from k-linear Assumption.
TL;DR: This paper provides a generic design framework for RHIBE based on an HIBE scheme with a few properties and proves adaptive security by developing a new proof technique for RH IBE.
Journal ArticleDOI
Revocable Identity-based Encryption with Bounded Decryption Key Exposure Resistance: Lattice-based Construction and More
TL;DR: B-DKER is a weak version of DKER, but it seems to be sufficient for practical use and the first pairing-based RIBE scheme that simultaneously realizes anonymity and B-Dker is proposed, which is the first lattice-based construction resilient to decryption key exposure.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Book ChapterDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
Book ChapterDOI
Identity-based cryptosystems and signature schemes
TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Journal ArticleDOI
On the inherent intractability of certain coding problems (Corresp.)
TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Related Papers (5)
Adaptive-ID Secure Revocable Identity-Based Encryption from Lattices via Subset Difference Method
Shantian Cheng,Juanyang Zhang +1 more