Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)

Threshold identity based encryption scheme on quadratic residues

Alexandra Afanasyeva, Sergey Valentinovich Bezzateev, Evgeny Linsky, Виталий Игоревич Петров, DaeYoub Kim

Published Sep 1, 2012• 1 citation
Publisher

Abstract

A new threshold identity-based encryption scheme secure against a chosen identity attack is proposed in this paper. The construction extends the identity-based encryption scheme by Cocks.
DOI
10.1109/red.2012.6338393

Related papers

Security of Identity-Based Encryption Schemes from Quadratic Residues

Ferucio Laurenţiu Ţiplea, Sorin Iftene, George Teşeleanu +1 more

Lecture notes in computer science•Jan 1, 2016•3 citations

Identity-Based Threshold Decryption Schemes Secure against Chosen Ciphertext Attacks in the Standard Model

Mei Qi, He Da

We propose two efficient Identity-Based threshold decryption schemes.They are proved secure against chosen ciphertext attacks under the standard decisional bilinear Diffie-Hellman assumption.The first one is constructed from(one of) the Selective ID-Based Encryption(Selective-IBE) scheme proposed by Boneh and Boyen recently,yet the second one is transformed from the Full ID-Based Encryption(Full-IBE) scheme obtained by Waters.As the based IBE schemes,the attacker in the first proposal has to choose the challenge identity before the common parameter is generated.while the attacker in the second one could choose the identity adaptively.To the best of our knowledge,previous related schemes could only be proved secure in the random oracle model.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2006•1 citation

A fully secure identity-based encryption scheme against chosen-ciphertext attack

Jing Ren, Ying Gao

Although getting a CPA secure IBE scheme is quite easy, achieving a fully secure IBE scheme against CCA is still a challenging problem nowadays. We get such a IBE scheme. First we propose a fully secure HIBE against CPA based on Waters' IBE [23]. And then, as IBE is a special case of HIBE, we use Boneh's result and technique [6] to construct a fully secure IBE against CCA.

International Conference on Information and Network Security (ICINS)•Jan 1, 2014•0 citations

Generic Construction of Forward-Secure Identity-Based Encryption

Yang Lu, Jiguo Li

The primitive of forward-secure identity-based encryption was proposed in order to minimize the damage of private key exposure in identity-based encryption setting. This new primitive guarantees that even if the current private keys are compromised, it is not possible to compromise past secret keys and past communications. In this paper, we propose a generic construction of forward-secure identity-based encryption. To do so, we first introduce a relaxed variant of hierarchical identity-based encryption called identity-based binary tree encryption and construct a concrete identity-based binary tree encryption scheme that is provably chosen-ciphertext secure in the standard model. We then show how to generically construct forward-secure identity-based encryption from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a forward-secure identity-based encryption scheme with chosen-ciphertext security in the standard model.

Journal of Computers•Dec 1, 2012•3 citations

Continuous Leakage-Resilient Identity-Based Encryption with Tight Security

Yanwei Zhou, Bo Yang, Hongxia Hou +3 more

Abstract In the actual applications, an adversary can break the security of cryptography scheme through various leakage attacks (e.g. side-channel attacks, cold-boot attacks, etc.), even the continuous leakage attacks. That is, a practical cryptography scheme must maintain its claimed security in the continuous leakage setting. However, the previous constructions on the leakage-resilient identity-based encryption (IBE) scheme could tolerate a leakage that is bounded, and cannot resist the continuous leakage attacks. In order to further achieve the better security, a novel method to build the continuous leakage-resilient IBE scheme with tight security is presented in this paper, and the scheme’s security is proved, in the standard model, based on a stronger security assumption that depends on the number of queries made by the adversary. In addition, our proposal has several advantages over previous such constructions, e.g. shorter public parameters, higher communication efficiency, tight security, etc.

The Computer Journal•Jan 3, 2019•10 citations

A Fuzzy Identity-Based Signcryption Scheme from Lattices

Xiuhua Lu, Qiaoyan Wen, Wenmin Li +2 more

Fuzzy identity-based cryptography introduces the threshold structure into identity-based cryptography, changes the receiver of a ciphertext from exact one to dynamic many, makes a cryptographic scheme more efficient and flexible.In this paper, we propose the first fuzzy identity-based signcryption scheme in lattice-based cryptography.Firstly, we give a fuzzy identity-based signcryption scheme that is indistinguishable against chosen plaintext attack under selective identity model.Then we apply Fujisaki-Okamoto method to obtain a fuzzy identity-based signcryption scheme that is indistinguishable against adaptive chosen ciphertext attack under selective identity model.Thirdly, we prove our scheme is existentially unforgeable against chosen message attack under selective identity model.As far as we know, our scheme is the first fuzzy identity-based signcryption scheme that is secure even in the quantum environment.

KSII Transactions on Internet and Information Systems•Nov 30, 2014•1 citation
We propose two efficient Identity-Based threshold decryption schemes.They are proved secure against chosen ciphertext attacks under the standard decisional bilinear Diffie-Hellman assumption.The first one is constructed from(one of) the Selective ID-Based Encryption(Selective-IBE) scheme proposed by Boneh and Boyen recently,yet the second one is transformed from the Full ID-Based Encryption(Full-IBE) scheme obtained by Waters.As the based IBE schemes,the attacker in the first proposal has to choose the challenge identity before the common parameter is generated.while the attacker in the second one could choose the identity adaptively.To the best of our knowledge,previous related schemes could only be proved secure in the random oracle model.
The primitive of forward-secure identity-based encryption was proposed in order to minimize the damage of private key exposure in identity-based encryption setting. This new primitive guarantees that even if the current private keys are compromised, it is not possible to compromise past secret keys and past communications. In this paper, we propose a generic construction of forward-secure identity-based encryption. To do so, we first introduce a relaxed variant of hierarchical identity-based encryption called identity-based binary tree encryption and construct a concrete identity-based binary tree encryption scheme that is provably chosen-ciphertext secure in the standard model. We then show how to generically construct forward-secure identity-based encryption from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a forward-secure identity-based encryption scheme with chosen-ciphertext security in the standard model.
Abstract In the actual applications, an adversary can break the security of cryptography scheme through various leakage attacks (e.g. side-channel attacks, cold-boot attacks, etc.), even the continuous leakage attacks. That is, a practical cryptography scheme must maintain its claimed security in the continuous leakage setting. However, the previous constructions on the leakage-resilient identity-based encryption (IBE) scheme could tolerate a leakage that is bounded, and cannot resist the continuous leakage attacks. In order to further achieve the better security, a novel method to build the continuous leakage-resilient IBE scheme with tight security is presented in this paper, and the scheme’s security is proved, in the standard model, based on a stronger security assumption that depends on the number of queries made by the adversary. In addition, our proposal has several advantages over previous such constructions, e.g. shorter public parameters, higher communication efficiency, tight security, etc.
Fuzzy identity-based cryptography introduces the threshold structure into identity-based cryptography, changes the receiver of a ciphertext from exact one to dynamic many, makes a cryptographic scheme more efficient and flexible.In this paper, we propose the first fuzzy identity-based signcryption scheme in lattice-based cryptography.Firstly, we give a fuzzy identity-based signcryption scheme that is indistinguishable against chosen plaintext attack under selective identity model.Then we apply Fujisaki-Okamoto method to obtain a fuzzy identity-based signcryption scheme that is indistinguishable against adaptive chosen ciphertext attack under selective identity model.Thirdly, we prove our scheme is existentially unforgeable against chosen message attack under selective identity model.As far as we know, our scheme is the first fuzzy identity-based signcryption scheme that is secure even in the quantum environment.