Anonymous HIBE with short ciphertexts: full security in prime order groups
From MaRDI portal
Publication:2256104
DOI10.1007/S10623-013-9868-6zbMATH Open1320.94071arXiv1502.07812OpenAlexW3103636374WikidataQ123247105 ScholiaQ123247105MaRDI QIDQ2256104FDOQ2256104
Authors: Yanyan Li 
Publication date: 19 February 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1502.07812
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
bilinear mapsidentity-based encryptionanonymityfull model securityhierarchical identity-based encryption (HIBE)
Cites Work
- Public key broadcast encryption for stateless receivers
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Robust Encryption
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Practical Identity-Based Encryption Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hierarchical ID-Based Cryptography
- Title not available (Why is that?)
- Identity-Based Encryption from the Weil Pairing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Efficient selective identity-based encryption without random oracles
- Achieving leakage resilience through dual system encryption
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Hierarchical Predicate Encryption for Inner-Products
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Advances in Cryptology - EUROCRYPT 2004
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Generalized Identity Based and Broadcast Encryption Schemes
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Unbounded HIBE and Attribute-Based Encryption
- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- Delegating Capabilities in Predicate Encryption Systems
- HIBE With Short Public Parameters Without Random Oracle
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
Cited In (7)
- Anonymous constant-size ciphertext HIBE from asymmetric pairings
- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Leakage-resilient hierarchical identity-based encryption with recipient anonymity
- Efficient (anonymous) compact HIBE from standard assumptions
- HIBE With Short Public Parameters Without Random Oracle
Uses Software
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)
