Fully secure hidden vector encryption under standard assumptions
From MaRDI portal
Recommendations
- Fully Secure Hidden Vector Encryption
- Efficient Hidden Vector Encryption with Constant-Size Ciphertext
- Improved hidden vector encryption with short ciphertexts and tokens
- Transforming hidden vector encryption schemes from composite to prime order groups
- Hidden-Vector Encryption with Groups of Prime Order
Cited in
(13)- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- Improved hidden vector encryption with short ciphertexts and tokens
- Transforming hidden vector encryption schemes from composite to prime order groups
- Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
- Searching keywords with wildcards on encrypted data
- Hidden-Vector Encryption with Groups of Prime Order
- Fully Secure Hidden Vector Encryption
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency
- Framework for efficient search and statistics computation on encrypted cloud data
- Efficient Hidden Vector Encryption with Constant-Size Ciphertext
- A survey on functional encryption
- Complementary set encryption for privacy-preserving data consolidation
This page was built for publication: Fully secure hidden vector encryption under standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510126)