A reusable and single-interactive model for secure approximate \(k\)-nearest neighbor query in cloud (Q2293034): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ins.2016.07.069 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2486089826 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Locality-sensitive hashing scheme based on p-stable distributions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Request-Based Comparable Encryption / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Short Comparable Encryption / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fully homomorphic encryption using ideal lattices / rank | |||
Normal rank | |||
Latest revision as of 17:44, 21 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reusable and single-interactive model for secure approximate \(k\)-nearest neighbor query in cloud |
scientific article |
Statements
A reusable and single-interactive model for secure approximate \(k\)-nearest neighbor query in cloud (English)
0 references
6 February 2020
0 references
secure approximate \(k\)-nearest neighbor
0 references
comparable encryption
0 references
\(\mathrm B^+\)-tree
0 references
refinements
0 references
