Anonymous HIBE with short ciphertexts: full security in prime order groups
From MaRDI portal
Publication:2256104
Abstract: Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of Identity-Based Encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to anonymous communication systems and public key encryption systems with keyword searching. However, previous anonymous HIBE schemes have some disadvantages that the security was proven in the weaker model, the size of ciphertexts is not short, or the construction was based on composite order bilinear groups. In this paper, we propose the first efficient anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and prove its security in the full model with an efficient reduction. To achieve this, we use the dual system encryption methodology of Waters. We also present the benchmark results of our scheme by measuring the performance of our implementation.
Recommendations
- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Anonymous constant-size ciphertext HIBE from asymmetric pairings
- Efficient (anonymous) compact HIBE from standard assumptions
Cites work
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 2086725 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Achieving leakage resilience through dual system encryption
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Bonsai trees, or how to delegate a lattice basis
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Delegating Capabilities in Predicate Encryption Systems
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Efficient selective identity-based encryption without random oracles
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Generalized Identity Based and Broadcast Encryption Schemes
- HIBE With Short Public Parameters Without Random Oracle
- Hierarchical ID-Based Cryptography
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Hierarchical Predicate Encryption for Inner-Products
- Identity-Based Encryption from the Weil Pairing
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Practical Identity-Based Encryption Without Random Oracles
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Public key broadcast encryption for stateless receivers
- Robust Encryption
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Unbounded HIBE and Attribute-Based Encryption
Cited in
(8)- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Efficient (anonymous) compact HIBE from standard assumptions
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- HIBE With Short Public Parameters Without Random Oracle
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Anonymous constant-size ciphertext HIBE from asymmetric pairings
- Leakage-resilient hierarchical identity-based encryption with recipient anonymity
This page was built for publication: Anonymous HIBE with short ciphertexts: full security in prime order groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256104)