Efficient Privacy-Preserving Protocol for<i> k</i>-NN Search over Encrypted Data in Location-Based Service

<div><svg height="11.6425pt" id="M291" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -11.4361 11.3068 11.6425" width="11.3068pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M545 106L524 126C493 85 467 65 455 65C438 65 427 113 405 238C448 295 498 362 543 439L533 448L478 435C453 386 423 331 398 295H395C370 404 347 448 282 448C169 448 23 309 23 153C23 54 65 -12 128 -12C203 -12 283 70 339 155H341C360 29 380 -12 411 -12C444 -12 491 11 545 106ZM333 204C265 95 210 54 169 54C137 54 113 96 113 171C113 302 191 405 252 405C301 405 318 306 333 204Z" id="g113-223"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.385,-5.741)"><path d="M310 541L304 571C290 586 211 619 185 610L80 76L131 52L310 541Z" id="g50-31"></path></g></svg> versus<i> k</i> of the uniform dataset.</div>

Complexity

fig8

Figure 8

Figure 8: Efficient Privacy-Preserving Protocol for<i> k</i>-NN Search over Encrypted Data in Location-Based Service 

Complexity

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

Figure 8