Privacy-Preserving Data Processing with Flexible Access Control
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Cloud computing provides an efficient and convenient platform for cloud users to store, process and control their data. Cloud overcomes the bottlenecks of resource-constrained user devices and greatly releases their storage and computing burdens. However, due to the lack of full trust in cloud service providers, the cloud users generally prefer to outsource their sensitive data in an encrypted form, which, however, seriously complicates data processing, analysis, as well as access control. Homomorphic encryption (HE) as a single key system cannot flexibly control data sharing and access after encrypted data processing. How to realize various computations over encrypted data in an efficient way and at the same time flexibly control the access to data processing results has been an important challenging issue. In this paper, we propose a privacy-preserving data processing scheme with flexible access control. With the cooperation of a data service provider (DSP) and a computation party (CP), our scheme, based on Paillier's partial homomorphic encryption (PHE), realizes seven basic operations, i.e., Addition, Subtraction, Multiplication, Sign Acquisition, Absolute, Comparison, and Equality Test, over outsourced encrypted data. In addition, our scheme, based on the homomorphism of attribute-based encryption (ABE), is also designed to support flexible access control over processing results of encrypted data. We further prove the security of our scheme and demonstrate its efficiency and advantages through simulations and comparisons with existing work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131 · cited 2×
“ABE [37], [38] was widely applied in cloud storage management for achieving fine-grained access control [39], [40], [41].”
MethodA survey on trust management for Internet of Things
Yan, Z., Zhang, P., & Vasilakos, A. V. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.01.014 · Cited by 1,155
Self-citation
Cited by
Elhoseny, M., Abdelaziz, A., Salama, A. S., Riad, A. M., Muhammad, K., & Sangaiah, A. K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.03.005 · Cited by 341
A survey on data fusion in internet of things: Towards secure and privacy-preserving fusion
Ding, W., Jing, X., Yan, Z., & Yang, L. T. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.12.001 · Cited by 230
“Due to privacy and security concern, secure and flexible access control over fusion result for multi-user access would be an interesting research topic [132, 133].”
BackgroundSelf-citationA Secure and Verifiable Data Sharing Scheme Based on Blockchain in Vehicular Social Networks
Fan, K., Pan, Q., Zhang, K., Bai, Y., Sun, S., Li, H., & Yang, Y. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2968094 · Cited by 164
Bads: blockchain-based architecture for data sharing with abs and cp-abe in IoT
Zhang, Y., He, D., & Choo, K.-K. R. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/2783658 · Cited by 102
SecRec: A Privacy-Preserving Method for the Context-Aware Recommendation System
Chen, J., Liu, L., Chen, R., Peng, W., & Huang, X. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3085562 · Cited by 32
“Most twin server based solutions ([33], [58], [59], [60], [61], [62]) are based on homomorphic encryption (HE) and garbled circuit (GC).”
Background
Metadata
- Authors
- Ding, W., Yan, Z., & Deng, R. H.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2020-03-01
- Volume
- 17
- Issue
- 2
- Pages
- 363-376
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W2775901130
- Cited by
- 85
- References
- 3
- FWCI
- 4.92
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.