The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Improving Security and Efficiency in Attribute-Based Data Sharing
Abstract
With the recent adoption and diffusion of the data sharing paradigm in distributed systems such as online social networks or cloud computing, there have been increasing demands and concerns for distributed data security. One of the most challenging issues in data sharing systems is the enforcement of access policies and the support of policies updates. Ciphertext policy attribute-based encryption (CP-ABE) is becoming a promising cryptographic solution to this issue. It enables data owners to define their own access policies over user attributes and enforce the policies on the data to be distributed. However, the advantage comes with a major drawback which is known as a key escrow problem. The key generation center could decrypt any messages addressed to specific users by generating their private keys. This is not suitable for data sharing scenarios where the data owner would like to make their private data only accessible to designated users. In addition, applying CP-ABE in the data sharing system introduces another challenge with regard to the user revocation since the access policies are defined only over the attribute universe. Therefore, in this study, we propose a novel CP-ABE scheme for a data sharing system by exploiting the characteristic of the system architecture. The proposed scheme features the following achievements: 1) the key escrow problem could be solved by escrow-free key issuing protocol, which is constructed using the secure two-party computation between the key generation center and the data-storing center, and 2) fine-grained user revocation per each attribute could be done by proxy encryption which takes advantage of the selective attribute group key distribution on top of the ABE. The performance and security analyses indicate that the proposed scheme is efficient to securely manage the data distributed in the data sharing system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
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
Attribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Attribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
Provably secure ciphertext policy ABE
Cheung, L., & Newport, C. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315302 · Cited by 814
Improving privacy and security in multi-authority attribute-based encryption
Chase, M., & Chow, S. S. M. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653678 · Cited by 795
A survey of key management for secure group communication
Rafaeli, S., & Hutchison, D. (2003) · ACM Computing Surveys · doi:10.1145/937503.937506 · Cited by 760
Identity-based encryption with efficient revocation
Boldyreva, A., Goyal, V., & Kumar, V. (2008) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1455770.1455823 · Cited by 654
Attribute based data sharing with attribute revocation
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/1755688.1755720 · Cited by 642
Bounded Ciphertext Policy Attribute Based Encryption
Goyal, V., Jain, A., Pandey, O., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_47 · Cited by 544
Over-Encryption: Management of Access Control Evolution on Encrypted Data
di Vimercati, S. D. C., Foresti, S., Jajodia, S., Paraboschi, S., & Samarati, P. (2007) · Very Large Data Bases · Cited by 371
Secure attribute-based systems
Pirretti, M., Traynor, P., McDaniel, P., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180419 · Cited by 363
Randomizable Proofs and Delegatable Anonymous Credentials
Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., & Shacham, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_7 · Cited by 269
Revocation Systems with Very Small Private Keys
Lewko, A., Sahai, A., & Waters, B. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.23 · Cited by 260
Conjunctive Broadcast and Attribute-Based Encryption
Attrapadung, N., & Imai, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03298-1_16 · Cited by 250
Mediated Ciphertext-Policy Attribute-Based Encryption and Its Application
Ibraimi, L., Petkovic, M., Nikova, S., Hartel, P., & Jonker, W. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10838-9_23 · Cited by 166
Provably secure and efficient bounded ciphertext policy attribute based encryption
Liang, X., Cao, Z., Lin, H., & Xing, D. (2009) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1533057.1533102 · Cited by 104
Kate, A., Zaverucha, G., & Goldberg, I. (2007) · Springer eBooks · doi:10.1007/978-3-540-75551-7_7 · Cited by 98
Cited by
An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing
Wang, S., Zhou, J., Liu, J. K., Yu, J., Chen, J., & Xie, W. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2523941 · Cited by 274
Attribute-based Encryption for Cloud Computing Access Control: A Survey
Zhang, Y., Deng, R. H., Xu, S., Sun, J., Li, Q., & Zheng, D. (2021) · ACM Computing Surveys · doi:10.1145/3398036 · Cited by 176
Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed Learning
Ma, C., Li, J., Wei, K., Liu, B., Ding, M., Yuan, L., Han, Z., & Vincent Poor, H. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2023.3306773 · Cited by 96
Metadata
- Authors
- Hur, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2013-10
- Volume
- 25
- Issue
- 10
- Pages
- 2271-2282
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2113857797
- Cited by
- 259
- References
- 19
- FWCI
- 6.21
- Type
- journal article
- Language
- en
- Open access
- closed
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.