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

Lecture notes in computer science

Security of Identity-Based Encryption Schemes from Quadratic Residues

Ferucio Laurenţiu Ţiplea, Sorin Iftene, George Teşeleanu, Anca-Maria Nica

Published Jan 1, 2016• 4 citations
Publisher
DOI
10.1007/978-3-319-47238-6_4

Related papers

A Non-committing Encryption Scheme Based on Quadratic Residue

Feiyu Lei, Wen Chen, Kefei Chen

Lecture notes in computer science•Jan 1, 2006•4 citations

Threshold identity based encryption scheme on quadratic residues

Alexandra Afanasyeva, Sergey Valentinovich Bezzateev, Evgeny Linsky +2 more

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.

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)•Sep 1, 2012•1 citation

Relations Among Notions of Security for Identity Based Encryption Schemes

Nuttapong Attrapadung, Yang Cui, David Galindo +6 more

Lecture notes in computer science•Jan 1, 2006•15 citations

On the Power of Hierarchical Identity-Based Encryption

Mohammad Mahmoody, Ameer Mohammed

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

Constructing Forward-Secure Identity-Based Encryption from Identity-Based Binary Tree Encryption

Yang Lu, Jiguo Li

In this paper, we propose a generic construction of forward-secure identity-based encryption. 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 which is provably secure in the standard model. We then show that forward-secure identity-based encryption can be generically constructed from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a direct chosen-ciphertext secure forward-secure identity-based encryption scheme without random oracles.

International Symposium on Information Science and Engineering•Dec 1, 2012•1 citation

More Efficient Adaptively Secure Lattice-Based IBE with Equality Test in the Standard Model

Kyoichi Asano, Keita Emura, Atsushi Takayasu

Identity-based encryption with equality test (IBEET) is a variant of identity-based encryption (IBE), in which any user with trapdoors can check whether two ciphertexts are encryption of the same plaintext. Although several lattice-based IBEET schemes have been proposed, they have drawbacks in either security or efficiency. Specifically, most IBEET schemes only satisfy selective security, while public keys of adaptively secure schemes in the standard model consist of matrices whose numbers are linear in the security parameter. In other words, known lattice-based IBEET schemes perform poorly compared to the state-of-the-art lattice-based IBE schemes (without equality test). In this paper, we propose a semi-generic construction of CCA-secure lattice-based IBEET from a certain class of lattice-based IBE schemes. As a result, we obtain the first lattice-based IBEET schemes with adaptive security and CCA security in the standard model without sacrificing efficiency. This is because, our semi-generic construction can use several state-of-the-art lattice-based IBE schemes as underlying schemes, e.g. Yamada's IBE scheme (CRYPTO'17).

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 4, 2023•1 citation
In this paper, we propose a generic construction of forward-secure identity-based encryption. 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 which is provably secure in the standard model. We then show that forward-secure identity-based encryption can be generically constructed from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a direct chosen-ciphertext secure forward-secure identity-based encryption scheme without random oracles.
Identity-based encryption with equality test (IBEET) is a variant of identity-based encryption (IBE), in which any user with trapdoors can check whether two ciphertexts are encryption of the same plaintext. Although several lattice-based IBEET schemes have been proposed, they have drawbacks in either security or efficiency. Specifically, most IBEET schemes only satisfy selective security, while public keys of adaptively secure schemes in the standard model consist of matrices whose numbers are linear in the security parameter. In other words, known lattice-based IBEET schemes perform poorly compared to the state-of-the-art lattice-based IBE schemes (without equality test). In this paper, we propose a semi-generic construction of CCA-secure lattice-based IBEET from a certain class of lattice-based IBE schemes. As a result, we obtain the first lattice-based IBEET schemes with adaptive security and CCA security in the standard model without sacrificing efficiency. This is because, our semi-generic construction can use several state-of-the-art lattice-based IBE schemes as underlying schemes, e.g. Yamada's IBE scheme (CRYPTO'17).