Efficient Hidden Vector Encryption with Constant-Size Ciphertext
From MaRDI portal
Publication:5264271
DOI10.1007/978-3-319-11203-9_27zbMATH Open1481.94120OpenAlexW1518103323MaRDI QIDQ5264271FDOQ5264271
Authors: Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo 
Publication date: 24 July 2015
Published in: Computer Security - ESORICS 2014 (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/cgi/viewcontent.cgi?article=4099&context=eispapers
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 (9)
- Hidden-Vector Encryption with Groups of Prime Order
- Improved hidden vector encryption with short ciphertexts and tokens
- Edit Distance Based Encryption and Its Application
- Fully Secure Hidden Vector Encryption
- New Constructions of Constant Size Ciphertext HIBE Without Random Oracle
- On Hiding a Plaintext Length by Preencryption
- Searching keywords with wildcards on encrypted data
- Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
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)
