Revisiting Security Risks of Asymmetric Scalar Product Preserving Encryption and Its Variants
Authors:
- Weipeng LinWLWeipeng Lin
- Ke WangKWKe Wang
- Zhilin ZhangZhilin Zhang
- Hong ChenHCHong Chen
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636927,p. 1116-1125
Abstract
Cloud computing has emerged as a compelling vision for managing data and delivering query answering capability over the internet. This new way of computing also poses a real risk of disclosing confidential information to the cloud. Searchable encryption addresses this issue by allowing the cloud to compute the answer to a query based on the cipher texts of data and queries. Thanks to its inner product preservation property, the asymmetric scalar-product-preserving encryption (ASPE) has been adopted and enhanced in a growing number of works toperform a variety of queries and tasks in the cloud computingsetting. However, the security property of ASPE and its enhancedschemes has not been studied carefully. In this paper, we show acomplete disclosure of ASPE and several previously unknownsecurity risks of its enhanced schemes. Meanwhile, efficientalgorithms are proposed to learn the plaintext of data and queriesencrypted by these schemes with little or no knowledge beyondthe ciphertexts. We demonstrate these risks on real data sets.Keywords
This publication has 19 references indexed in Scilit:
- Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud DataIEEE Transactions on Dependable and Secure Computing, 2015
- The non-negative matrix factorization toolbox for biological data miningSource Code for Biology and Medicine, 2013
- Efficient privacy-preserving biometric identification in cloud computing2013
- Toward Secure Multikeyword Top-k Retrieval over Encrypted Cloud DataIEEE Transactions on Dependable and Secure Computing, 2013
- Locality sensitive hashing: A comparison of hash function types and querying mechanismsPattern Recognition Letters, 2010
- Privacy-preserving outsourcing support vector machines with random transformation2010
- A Survey of Attack Techniques on Privacy-Preserving Data Perturbation Methods2008
- Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysisBioinformatics, 2007
- On the privacy preserving properties of random data perturbation techniques2004
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970