Practical and Secure Nearest Neighbor Search on Encrypted Large-Scale Data Source : IEEE INFOCOM 2016 - IEEE International Conference on Computer Communications, pp. 1-9 Authors :Boyang Wang, Yantian Hou, Ming Li Speaker : Pengxu Tian Date: 2017/10/12 In this paper, authors proposed a new authentication scheme for heterogeneous WSN. Therefore, I will introduce heterogeneous WSN later.

Outline Introduction Proposed scheme Performance analysis This is my outline First, I will introduce what is heterogeneous WSN. And then is Proposed scheme.

Introduction Two directions about Searchable Encryption: Multiple data owners Similarity search

Introduction System model

Introduction R-tree Minimum bounding rectangle

Introduction R-tree

Introduction OPE (Order-Preserving Encryption)

Proposed scheme(1/9) Search process in plaintext domain

Proposed scheme(2/9) Search process in plaintext domain

Proposed scheme(3/9) Search process in plaintext domain

Proposed scheme(4/9) Search process in ciphertext domain

Proposed scheme(5/9) Search process in ciphertext domain

Proposed scheme(6/9) Search process in ciphertext domain

Proposed scheme(7/9) An example of special situation

Proposed scheme(8/9) Details:

Proposed scheme(9/9) Details:

Performance analysis identity or password bytes, nonce 16 bytes, timestamp 19 bytes, hash value 20 bytes, symmetric key 16 bytes

Performance analysis identity or password bytes, nonce 16 bytes, timestamp 19 bytes, hash value 20 bytes, symmetric key 16 bytes

Performance analysis identity or password bytes, nonce 16 bytes, timestamp 19 bytes, hash value 20 bytes, symmetric key 16 bytes

Thanks for attention