eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20110117:041825 of this paper.
See the latest version.
Paper 2011/021
Fully Secure Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
Jae Hong Seo and Jung Hee Cheon
Abstract
Efficient and privacy-preserving constructions for search functionality on encrypted data is important issues for data outsourcing, and data retrieval, etc. Fully secure anonymous Hierarchical ID-Based Encryption (HIBE) schemes is useful primitives that can be applicable to searchable encryptions [4], such as ID-based searchable encryption, temporary searchable encryption [1], and anonymous forward secure HIBE [9]. We propose a fully secure anonymous HIBE scheme with constant size ciphertexts.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- anonymity
- Contact author(s)
- jhsbhs @ gmail com
- History
- 2011-01-17: revised
- 2011-01-14: received
- See all versions
- Short URL
- https://ia.cr/2011/021
- License
-
CC BY
