| Citation: | ZHANG Jiuling, HUANG Daochao, SHEN Shijunet al. Optimal choice of order preserving encryption scheme in encrypted document ranking[J]. Journal of Beijing University of Aeronautics and Astronautics, 2022, 48(2): 266-272. doi: 10.13700/j.bh.1001-5965.2020.0414(in Chinese)
|
Encrypting the documents before uploading them to the untrusted removable server is one of the ultimate solutions to protect the user privacy. As different encryption schemes give different ranking results, finding the order preserving encryption scheme that gives the best ranking result is the key issue to be solved. A discrimination information based on criterion for selecting the order preserving encryption scheme is proposed and then employed to compare the ranking results of two different order preserving encryption schemes. In the case the distribution of the cipher text is closer to that of the plaintext, the ranking result is closer to that in the plaintext scenario. The proposed criterion is not only instructive in theory, but also helpful practically in choosing the order preserving encryption scheme under the same safety conditions, which further lead to the optimal retrieval result.
| [1] |
SONG D X, WAGNER D, PERRIG A. Practical techniques for searches on encrypted data[C]//Proceedings of 2000 IEEE Symposium on Security and Privacy. Piscataway: IEEE Press, 2000: 44-55.
|
| [2] |
BONEH D, CRESCENZO G, OSTROVSKY R, et al. Public key encryption with keyword search[C]//Proceedings of Advances in Cryptology-Eurocrypt 2004. Berlin: Springer, 2004: 506-522.
|
| [3] |
PARK D J, KIM K, LEE P J. Public key encryption with conjunctive field keyword search[C]//International Conference on Information Security Applications. Berlin: Springer, 2005: 73-86.
|
| [4] |
SWAMINATHAN A, MAO Y N, SU G M, et al. Confidentiality preserving rank-ordered search[C]//Proceedings of the ACM Workshop on Storage Security and Survivability. New York: ACM, 2007: 7-12.
|
| [5] |
WANG C, CAO N, LI J, et al. Secure ranked keyword search over encrypted cloud data[C]//Proceedings of 30th IEEE International Conference on Distributed Computing Systems. Piscataway: IEEE Press, 2010: 253-262.
|
| [6] |
LU W J, SWAMINATHAN A, VARNA A L, et al. Enabling search over encrypted multimedia databases[C]//Media Forensics and Security. Bellingham: SPIE Press, 2009: 725418.
|
| [7] |
PHONG L T, AONO Y, HAYASHI T, et al. Privacy-preserving deep learning via additively homomorphic encryption[J]. IEEE Transactions on Information Forensics and Security, 2018, 13(5): 1333-1345. doi: 10.1109/TIFS.2017.2787987
|
| [8] |
OZSOYOGLU G, SINGER D, CHUNG S. Anti-tamper databases: Querying encrypted databases[C]//Proceedings of the 17th Annual IFIP WG. New York: ACM, 2003: 4-6.
|
| [9] |
AGRAWAL R, KIERNAN J, SRIKANT R, et al. Order preserving encryption for numeric data[C]//Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM, 2004: 563-574.
|
| [10] |
BOLDYREVA A, CHENETTE N, LEE Y, et al. Order-preserving symmetric encryption[C]//Proceedings of Advances in Cryptology-Eurocrypt 2009. Berlin: Springer, 2009: 224-241.
|
| [11] |
BOLDYREVA A, CHENETTE N, O'NEILL A. Order-preserving encryption revisited: Improved security analysis and alternative solutions[C]//Advances in Cryptology-CRYPTO 2011. Berlin: Springer, 2011: 578-595.
|
| [12] |
KHOURY E, MEDLEJ M, JAOUDE C A, et al. Novel order preserving encryption scheme for wireless sensor networks[C]//IEEE Middle East and North Africa Communications Conference (MENACOMM). Piscataway: IEEE Press, 2018: 1-6.
|
| [13] |
AHMED S, ANNIS A, ZAMAN A, et al. Semi-order preserving encryption technique for numeric database[J]. International Journal of Networking and Communication, 2019, 9(1): 111-129. http://www.researchgate.net/publication/330457745_Semi-Order_Preserving_Encryption_Technique_for_Numeric_Database
|
| [14] |
SHEN N, YEH J, CHEN C, et al. Ensuring query completeness in outsourced database using order-preserving encryption[C]//Proceedings of IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking. Piscataway: IEEE Press, 2019: 776-783.
|
| [15] |
REDDY K S, RAMACHANDRAM S. A secure, fast insert and efficient search order preserving encryption scheme for outsourced databases[J]. International Journal of Advanced Intelligence Paradigms, 2019, 13(1/2): 155-177. doi: 10.1504/IJAIP.2019.099949
|
| [16] |
DYER J, DYER M, DJEMAME K. Order-preserving encryption using approximate common divisors[J]. Journal of Information and Applications, 2019, 49: 102391. doi: 10.1016/j.jisa.2019.102391
|
| [17] |
CHOWDHURY A R, RAMANATHAN P. Public order-preserving cipher generation scheme for distributed computing[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2018: 2273-2275.
|
| [18] |
MANNING C D, RAGHAVAN P, SCHUTZE H. Introduction to information retrieval[M]. Cambridge: Cambridge University Press, 2008: 253-256.
|
| [19] |
WHISSELL J S, CLARKE C. Improving document clustering using Okapi BM25 feature weighting[J]. Information Retrieval, 2011, 14(5): 466-487. doi: 10.1007/s10791-011-9163-y
|
| [20] |
LI K, ZHANG W M, YANG C, et al. Security analysis on one-to-many order preserving encryption-based cloud data search[J]. IEEE Transactions on Information Forensics and Security, 2015, 10(9): 1918-1926. http://pdfs.semanticscholar.org/5e9a/1f22db2afcf5f428a7cf310cc672e9270437.pdf
|
Figures(3) / Tables(2)
Copyright © Journal of Beijing University of Aeronautics and Astronautics
Address: Editorial Department of Journal of Beijing University of Aeronautics and Astronautics, 37 Xueyuan Road, Haidian District, Beijing Post Code: 100191 Email: jbuaa@buaa.edu.cn
Supported by:
Beijing Renhe Information Technology Co., Ltd.
DownLoad:
