Anonymous HIBE with short ciphertexts: full security in prime order groups
From MaRDI portal
Publication:2256104
DOI10.1007/s10623-013-9868-6zbMath1320.94071arXiv1502.07812OpenAlexW3103636374WikidataQ123247105 ScholiaQ123247105MaRDI QIDQ2256104
Publication date: 19 February 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07812
anonymitybilinear mapsidentity-based encryptionfull model securityhierarchical identity-based encryption (HIBE)
Related Items
Revocable hierarchical identity-based encryption with shorter private keys and update keys, Leakage-Resilient Hierarchical Identity-Based Encryption with Recipient Anonymity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient selective identity-based encryption without random oracles
- 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
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
- Achieving Leakage Resilience through Dual System Encryption
- Unbounded HIBE and Attribute-Based Encryption
- Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
- 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
- Delegating Capabilities in Predicate Encryption Systems
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product 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
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Practical Identity-Based Encryption Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Generalized Identity Based and Broadcast Encryption Schemes
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Hierarchical Predicate Encryption for Inner-Products
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hierarchical ID-Based Cryptography
- Identity-Based Encryption from the Weil Pairing
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Advances in Cryptology - EUROCRYPT 2004
- 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
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- HIBE With Short Public Parameters Without Random Oracle
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
