Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
From MaRDI portal
Publication:6124593
DOI10.1016/j.tcs.2024.114502OpenAlexW4392883772MaRDI QIDQ6124593
Subhranil Dutta, Ratna Dutta, Tapas Pal
Publication date: 28 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114502
Cites Work
- Unnamed Item
- Strongly full-hiding inner product encryption
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- Efficient functional encryption for inner-product values with full-hiding security
- Doubly spatial encryption from DBDH
- A taxonomy of pairing-friendly elliptic curves
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
- Function private predicate encryption for low min-entropy predicates
- Unbounded inner-product functional encryption with succinct keys
- Inner-product encryption under standard assumptions
- Elliptic curves suitable for pairing based cryptography
- Fully secure unbounded zero inner product encryption with short ciphertexts and keys
- Function-Hiding Inner Product Encryption
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Simple Functional Encryption Schemes for Inner Products
- Unbounded HIBE and Attribute-Based Encryption
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage
- Privacy in Encrypted Content Distribution Using Private Broadcast Encryption
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Hierarchical Predicate Encryption for Inner-Products
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Shorter IBE and Signatures via Asymmetric Pairings
- Hierarchical Identity-Based Broadcast Encryption
- Advances in Cryptology – CRYPTO 2004
- Fuzzy Identity-Based Encryption
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
- Pairing-Friendly Elliptic Curves of Prime Order
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate- and Attribute-Hiding Inner Product Encryption in a Public Key Setting
- Unbounded inner product functional encryption from bilinear maps
This page was built for publication: Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting