Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity.
Seny KamaraTarik MoatazPublished in: EUROCRYPT (3) (2017)
Keyphrases
- linear complexity
- worst case
- average case
- upper bound
- real valued
- error bounds
- boolean functions
- greedy algorithm
- lower bound
- linear computational complexity
- digital libraries
- np hard
- approximation algorithms
- space complexity
- boolean queries
- running times
- information systems
- worst case analysis
- artificial intelligence
- genetic algorithm
- uniform distribution
- information retrieval
- databases
- clustering algorithm
- multiscale
- boolean logic
- database