Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity.
Seny KamaraTarik MoatazPublished in: IACR Cryptol. ePrint Arch. (2017)
Keyphrases
- linear complexity
- worst case
- average case
- upper bound
- lower bound
- greedy algorithm
- approximation algorithms
- real valued
- digital libraries
- boolean functions
- np hard
- linear computational complexity
- worst case analysis
- error bounds
- running times
- sample size
- learning algorithm
- real time
- video sequences
- search engine
- space complexity
- information retrieval
- databases
- online algorithms
- boolean queries
- complexity bounds
- boolean logic