Efficient subtree-based encryption for fuzzy-entity data sharing
From MaRDI portal
Publication:1626290
DOI10.1007/S00500-017-2743-ZzbMath1402.68056OpenAlexW2742281664WikidataQ122173434 ScholiaQ122173434MaRDI QIDQ1626290
David Naccache, Houda Ferradi, Bo Qin, Qianhong Wu, Weiran Liu, Jian-wei Liu
Publication date: 27 November 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-017-2743-z
Related Items (2)
An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem ⋮ An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Provably secure threshold public-key encryption with adaptive security and short ciphertexts
- Anonymous spatial encryption under affine space delegation functionality with full security
- Signatures in hierarchical certificateless cryptography: efficient constructions and provable security
- Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
- Fully CCA2 secure identity based broadcast encryption without random oracles
- Cryptanalysis of GGH Map
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Identity-Based Cryptosystems and Signature Schemes
- Verifiable Auditing for Outsourced Database in Cloud Computing
- Cost-Effective Authentic and Anonymous Data Sharing with Forward Security
- Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
- 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
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Practical Identity-Based Encryption Without Random Oracles
- Generalized Identity Based and Broadcast Encryption Schemes
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Hierarchical ID-Based Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- Candidate Multilinear Maps from Ideal Lattices
- Hierarchical Identity-Based Broadcast Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Efficient subtree-based encryption for fuzzy-entity data sharing