Pages that link to "Item:Q5270359"
From MaRDI portal
The following pages link to Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity (Q5270359):
Displayed 13 items.
- Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems (Q1733051) (← links)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Encrypted key-value stores (Q2152022) (← links)
- Publicly verifiable database scheme with efficient keyword search (Q2201628) (← links)
- Dynamic multi-client searchable symmetric encryption with support for Boolean queries (Q2656778) (← links)
- Efficient searchable symmetric encryption for join queries (Q6135437) (← links)
- Updatable searchable symmetric encryption: definitions and constructions (Q6144022) (← links)
- Efficient Boolean search over encrypted data with reduced leakage (Q6157564) (← links)
- Exipnos: an efficient verifiable dynamic symmetric searchable encryption scheme with forward and backward privacy (Q6157604) (← links)
- Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption (Q6163658) (← links)
- Limits of breach-resistant and snapshot-oblivious RAMs (Q6190101) (← links)
- Multi-user image retrieval with suppression of search pattern leakage (Q6195205) (← links)