{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:50:06Z","timestamp":1767772206622},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,1,21]],"date-time":"2017-01-21T00:00:00Z","timestamp":1484956800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11432-016-0242-7","type":"journal-article","created":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T10:06:37Z","timestamp":1485338797000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["hOPE: improved order preserving encryption with the power to homomorphic operations of ciphertexts"],"prefix":"10.1007","volume":"60","author":[{"given":"Yanguo","family":"Peng","sequence":"first","affiliation":[]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Junwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Changgen","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,21]]},"reference":[{"key":"242_CR1","first-page":"563","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data (ICDE), Paris","author":"R Agrawal","year":"2004","unstructured":"Agrawal R, Kiernan J, Srikant R, et al. Order preserving encryption for numeric data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (ICDE), Paris, 2004. 563\u2013574"},{"key":"242_CR2","first-page":"224","volume-title":"Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques, Cologne","author":"A Boldyreva","year":"2009","unstructured":"Boldyreva A, Chenette N, Lee Y, et al. Order-preserving symmetric encryption. In: Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques, Cologne, 2009. 224\u2013241"},{"key":"242_CR3","first-page":"463","volume-title":"Proceedings of IEEE Symposium on Security and Privacy (S&P), Berkeley","author":"R A Popa","year":"2013","unstructured":"Popa R A, Li F H, Zeldovich N. An ideal-security protocol for order-preserving encoding. In: Proceedings of IEEE Symposium on Security and Privacy (S&P), Berkeley, 2013. 463\u2013477"},{"key":"242_CR4","first-page":"42","volume-title":"Advances in Cryptology\u2014ASIACRYPT","author":"I Teranishi","year":"2014","unstructured":"Teranishi I, Yung M, Malkin T. Order-preserving encryption secure beyond one-wayness. In: Advances in Cryptology\u2014ASIACRYPT. Berlin: Springer, 2014. 42\u201361"},{"key":"242_CR5","first-page":"763","volume-title":"Proceedings of the ACM International Conference on Management of Data (SIGMOD), Melbourne","author":"C Mavroforakis","year":"2015","unstructured":"Mavroforakis C, Chenette N, O\u2019Neill A, et al. Modular order-preserving encryption, revisited. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Melbourne, 2015. 763\u2013777"},{"key":"242_CR6","first-page":"110101","volume":"58","author":"H G Zhang","year":"2015","unstructured":"Zhang H G, Han W B, Lai X J, et al. Survey on cyberspace security. Sci China Inf Sci, 2015, 58: 110101","journal-title":"Sci China Inf Sci"},{"key":"242_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J L Bentley","year":"1975","unstructured":"Bentley J L. Multidimensional binary search trees used for associative searching. ACM Commun, 1975, 18: 509\u2013517","journal-title":"ACM Commun"},{"key":"242_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer R, McCreight E. Organization and maintenance of large ordered indexes. Acta Inform, 1972, 1: 173\u2013189","journal-title":"Acta Inform"},{"key":"242_CR9","first-page":"100","volume":"28","author":"J A Hartigan","year":"1979","unstructured":"Hartigan J A, Wong M A. Algorithm as 136: a k-means clustering algorithm. J Royal Stat Soc Ser C, 1979, 28: 100\u2013108","journal-title":"J Royal Stat Soc Ser C"},{"key":"242_CR10","first-page":"47","volume-title":"Proceedings of the ACM International Conference on Management of Data (SIGMOD), Boston","author":"A Guttman","year":"1984","unstructured":"Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Boston, 1984. 47\u201357"},{"key":"242_CR11","first-page":"165","volume-title":"Proceedings of Foundations of Secure Computation, Atlanta","author":"R L Rivest","year":"1978","unstructured":"Rivest R L, Adleman L, Dertouzos M L. On data banks and privacy homomorphisms. In: Proceedings of Foundations of Secure Computation, Atlanta, 1978. 165\u2013179"},{"key":"242_CR12","first-page":"223","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201999","author":"P Paillier","year":"1999","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology\u2014EUROCRYPT\u201999. Berlin: Springer, 1999. 223\u2013238"},{"key":"242_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/1536414.1536440","volume":"9","author":"C Gentry","year":"2009","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), Bethesda, 2009. 9: 169\u2013178","journal-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), Bethesda"},{"key":"242_CR14","first-page":"129","volume-title":"Advances in Cryptology\u2014 EUROCRYPT","author":"C Gentry","year":"2011","unstructured":"Gentry C, Halevi S. Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Advances in Cryptology\u2014 EUROCRYPT. Berlin: Springer, 2011. 129\u2013148"},{"key":"242_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/2090236.2090262","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, 2012. 309\u2013325"},{"key":"242_CR16","first-page":"664","volume-title":"Proceedings of IEEE 30th International Conference on Data Engineering (ICDE)","author":"Y Elmehdwi","year":"2014","unstructured":"Elmehdwi Y, Samanthula B, Jiang W. Secure k-nearest neighbor query over encrypted data in outsourced environments. In: Proceedings of IEEE 30th International Conference on Data Engineering (ICDE), Chicago, 2014. 664\u2013675"},{"key":"242_CR17","first-page":"514","volume-title":"Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology","author":"D Boneh","year":"2001","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. In: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology. London: Springer, 2001. 514\u2013532"},{"key":"242_CR18","doi-asserted-by":"crossref","first-page":"2085","DOI":"10.1007\/s11071-015-2467-5","volume":"83","author":"Q Jiang","year":"2016","unstructured":"Jiang Q, Wei F, Fu S, et al. Robust extended chaotic maps-based three-factor authentication scheme preserving biometric template privacy. Nonlinear Dynam, 2016, 83: 2085\u20132101","journal-title":"Nonlinear Dynam"},{"key":"242_CR19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Proceedings of IMA International Conference on Cryptography and Coding, Cirencester","author":"N Koblitz","year":"2005","unstructured":"Koblitz N, Menezes A. Pairing-based cryptography at high security levels. In: Proceedings of IMA International Conference on Cryptography and Coding, Cirencester, 2005. 13\u201336"},{"key":"242_CR20","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/dac.2644","volume":"28","author":"Q Jiang","year":"2015","unstructured":"Jiang Q, Ma J, Li G, et al. Improvement of robust smart-card-based password authentication scheme. Int J Commun Syst, 2015, 28: 383\u2013393","journal-title":"Int J Commun Syst"},{"key":"242_CR21","first-page":"275","volume-title":"Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Scottsdale","author":"F Kerschbaum","year":"2014","unstructured":"Kerschbaum F, Schroepfer A. Optimal average-complexity ideal-security order-preserving encryption. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, 2014. 275\u2013286"},{"key":"242_CR22","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola R, Garay J, Kamara S, et al. Searchable symmetric encryption: improved definitions and efficient constructions. J Comput Secur, 2011, 19: 895\u2013934","journal-title":"J Comput Secur"},{"key":"242_CR23","first-page":"1156","volume-title":"Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE), Washington","author":"M Kuzu","year":"2012","unstructured":"Kuzu M, Islam M S, Kantarcioglu M. Efficient similarity search over encrypted data. In: Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE), Washington, 2012. 1156\u20131167"},{"key":"242_CR24","first-page":"185","volume-title":"Proceedings of the ACM International Conference on Management of Data (SIGMOD), San Francisco","author":"I Demertzis","year":"2016","unstructured":"Demertzis I, Papadopoulos S, Papapetrou O, et al. Practical private range search revisited. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), San Francisco, 2016. 185\u2013198"},{"key":"242_CR25","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1145\/2810103.2813629","volume-title":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS), Denver","author":"F Kerschbaum","year":"2015","unstructured":"Kerschbaum F. Frequency-hiding order-preserving encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS), Denver, 2015. 656\u2013667"},{"key":"242_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/2043556.2043566","volume-title":"Proceedings of the 23rd ACM Symposium on Operating Systems Principles, Cascais","author":"R A Popa","year":"2011","unstructured":"Popa R A, Redfield C M S, Zeldovich N, et al. CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles, Cascais, 2011. 85\u2013100"},{"key":"242_CR27","doi-asserted-by":"crossref","first-page":"289","DOI":"10.14778\/2535573.2488336","volume":"6","author":"S Tu","year":"2013","unstructured":"Tu S, Kaashoek M F, Madden S, et al. Processing analytical queries over encrypted data. Proc VLDB Endow, 2013, 6: 289\u2013300","journal-title":"Proc VLDB Endow"},{"key":"242_CR28","first-page":"2818","volume":"26","author":"S Choi","year":"2014","unstructured":"Choi S, Ghinita G, Lim H S, et al. Secure kNN query processing in untrusted cloud environments. IEEE TKDE, 2014, 26: 2818\u20132831","journal-title":"IEEE TKDE"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-0242-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-016-0242-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-0242-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T19:13:50Z","timestamp":1658517230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-016-0242-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,21]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["242"],"URL":"https:\/\/doi.org\/10.1007\/s11432-016-0242-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,21]]},"article-number":"062101"}}