Efficient Hidden Vector Encryption with Constant-Size Ciphertext
From MaRDI portal
Publication:5264271
Recommendations
- Fully secure hidden vector encryption under standard assumptions
- Improved hidden vector encryption with short ciphertexts and tokens
- Fully Secure Hidden Vector Encryption
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- New Constructions of Constant Size Ciphertext HIBE Without Random Oracle
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Anonymous constant-size ciphertext HIBE from asymmetric pairings
- Computationally efficient ciphertext-policy attribute-based encryption with constant-size ciphertexts
- Attribute-based encryption schemes with constant-size ciphertexts
Cited in
(11)- Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
- Hidden-Vector Encryption with Groups of Prime Order
- Fully secure hidden vector encryption under standard assumptions
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- Edit distance based encryption and its application
- Improved hidden vector encryption with short ciphertexts and tokens
- Transforming hidden vector encryption schemes from composite to prime order groups
- On Hiding a Plaintext Length by Preencryption
- New Constructions of Constant Size Ciphertext HIBE Without Random Oracle
- Fully Secure Hidden Vector Encryption
- Searching keywords with wildcards on encrypted data
This page was built for publication: Efficient Hidden Vector Encryption with Constant-Size Ciphertext
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264271)