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

From MaRDI portal
Publication:5270359

DOI10.1007/978-3-319-56617-7_4zbMath1394.94935OpenAlexW2592956480MaRDI QIDQ5270359

Seny Kamara, Tarik Moataz

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_4




Related Items (13)


Uses Software



Cites Work




This page was built for publication: Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity