1. Practical and Secure Nearest Neighbor Search on Encrypted Large-Scale Data
Source : IEEE INFOCOM 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.

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

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

4. Introduction
System model

5. Introduction
R-tree
Minimum bounding rectangle

6. Introduction
R-tree

7. Introduction
OPE (Order-Preserving Encryption)

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

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

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

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

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

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

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

15. Proposed scheme(8/9)
Details:

16. Proposed scheme(9/9)
Details:

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

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

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

20. Thanks for attention