The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
EASiER: encryption-based access control in social networks with efficient revocation
Abstract
A promising approach to mitigate the privacy risks in Online Social Networks (OSNs) is to shift access control enforcement from the OSN provider to the user by means of encryption. However, this creates the challenge of key management to support complex policies involved in OSNs and dynamic groups. To address this, we propose EASiER, an architecture that supports fine-grained access control policies and dynamic group membership by using attribute-based encryption. A key and novel feature of our architecture, however, is that it is possible to remove access from a user without issuing new keys to other users or re-encrypting existing ciphertexts. We achieve this by creating a proxy that participates in the decryption process and enforces revocation constraints. The proxy is minimally trusted and cannot decrypt ciphertexts or provide access to previously revoked users. We describe EASiER architecture and construction, provide performance evaluation, and prototype application of our approach on Facebook.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Secret Sharing: In Shamir’s secret sharing scheme [14], a secret S in some field F is shared among n parties by creating a random polynomial P ∈ F [x] of degree t such that P (0) = S.”
BackgroundCiphertext-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
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Information revelation and privacy in online social networks
Gross, R., & Acquisti, A. (2005) · Proceedings of the 2005 ACM workshop on Privacy in the electronic society · doi:10.1145/1102199.1102214 · Cited by 2,028 · cited 1×
“Insiders can also intentionally or accidentally release private information [4].”
Background
Cited by
Li, M., Yu, S., Zheng, Y., Ren, K., & Lou, W. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.97 · Cited by 1,189
DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems
Yang, K., Jia, X., Ren, K., Zhang, B., & Xie, R. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2279531 · Cited by 310
Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage
Yang, K., & Jia, X. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.253 · Cited by 264
Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds
Ruj, S., Stojmenovic, M., & Nayak, A. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.38 · Cited by 261
GroupIt: Lightweight group key management for dynamic iot environments
Kung, Y.-H., & Hsiao, H.-C. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2840321 · Cited by 60
“Attribute-based encryption [6], [7], [12] can be used to support fine-grained access control.”
Background
Metadata
- Authors
- Jahid, S., Mittal, P., & Borisov, N.
- Venue
- Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
- Publisher
- ACM
- Published
- 2011-03-22
- Pages
- 411-415
- OpenAlex
- W2146095252
- Cited by
- 222
- References
- 4
- FWCI
- 21.61
- Type
- conference paper
- 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.