Efficient Asymmetric Index Encapsulation Scheme for Named Data
From MaRDI portal
Recommendations
- Simple, secure, and efficient searchable symmetric encryption with multiple encrypted indexes
- An efficiently searchable encrypted data structure for range queries
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- I/O-efficient data structures for non-overlapping indexing
- Verifiable and forward secure dynamic searchable symmetric encryption with storage efficiency
- Data and Applications Security XIX
Cites work
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- Advances in Cryptology - EUROCRYPT 2004
- Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
- Deterministic and Efficiently Searchable Encryption
- Function-private identity-based encryption: hiding the function in functional encryption
- Identity-Based Encryption from the Weil Pairing
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- The locality of searchable symmetric encryption
- Universal classes of hash functions
- Wildcarded identity-based encryption
This page was built for publication: Efficient Asymmetric Index Encapsulation Scheme for Named Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953858)