Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity

@inproceedings{Kamara2017BooleanSS,
  title={Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity},
  author={Seny Kamara and Tarik Moataz},
  booktitle={IACR Cryptology ePrint Archive},
  year={2017}
}
Recent work on searchable symmetric encryption (SSE) has focused on increasing its expressiveness. A notable example is the OXT construction (Cash et al., CRYPTO ’13 ) which is the first SSE scheme to support conjunctive keyword queries with sub-linear search complexity. While OXT efficiently supports disjunctive and boolean queries that can be expressed in searchable normal form, it can only handle arbitrary disjunctive and boolean queries in linear time. This motivates the problem of… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
24 Citations
35 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Secure indexes. Technical Report 2003/216

  • E.-J. Goh
  • IACR ePrint Cryptography Archive,
  • 2003
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…