The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Attribute-Based Encryption With Verifiable Outsourced Decryption
Abstract
Attribute-based encryption (ABE) is a public-key-based one-to-many encryption that allows users to encrypt and decrypt data based on user attributes. A promising application of ABE is flexible access control of encrypted data stored in the cloud, using access polices and ascribed attributes associated with private keys and ciphertexts. One of the main efficiency drawbacks of the existing ABE schemes is that decryption involves expensive pairing operations and the number of such operations grows with the complexity of the access policy. Recently, Greenproposed an ABE system with outsourced decryption that largely eliminates the decryption overhead for users. In such a system, a user provides an untrusted server, say a cloud service provider, with a transformation key that allows the cloud to translate any ABE ciphertext satisfied by that user's attributes or access policy into a simple ciphertext, and it only incurs a small computational overhead for the user to recover the plaintext from the transformed ciphertext. Security of an ABE system with outsourced decryption ensures that an adversary (including a malicious cloud) will not be able to learn anything about the encrypted message; however, it does not guarantee the correctness of the transformation done by the cloud. In this paper, we consider a new requirement of ABE with outsourced decryption: verifiability. Informally, verifiability guarantees that a user can efficiently check if the transformation is done correctly. We give the formal model of ABE with verifiable outsourced decryption and propose a concrete scheme. We prove that our new scheme is both secure and verifiable, without relying on random oracles. Finally, we show an implementation of our scheme and result of performance measurements, which indicates a significant reduction on computing resources imposed on users.
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
Divertible protocols and atomic proxy cryptography
Blaze, M., Bleumer, G., & Strauss, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054122 · Cited by 1,582
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_4 · Cited by 1,313
Decentralizing Attribute-Based Encryption
Lewko, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_31 · Cited by 1,194
Cited by
Secure attribute-based data sharing for resource-limited users in cloud computing
Li, J., Zhang, Y., Chen, X., & Xiang, Y. (2018) · Computers & Security · doi:10.1016/j.cose.2017.08.007 · Cited by 461
Securely Outsourcing Attribute-Based Encryption with Checkability
Li, J., Huang, X., Li, J., Chen, X., & Xiang, Y. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.271 · Cited by 429
Yang, Y., Zheng, X., Guo, W., Liu, X., & Chang, V. (2019) · Information Sciences · doi:10.1016/j.ins.2018.02.005 · Cited by 364
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage
Li, J., Lin, X., Zhang, Y., & Han, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2542813 · Cited by 321
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
Metadata
- Authors
- Lai, J., Deng, R. H., Guan, C., & Weng, J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2013-08
- Volume
- 8
- Issue
- 8
- Pages
- 1343-1354
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W1974267799
- Cited by
- 466
- References
- 33
- FWCI
- 31.66
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Attribute-Based Encryption With Verifiable Outsourced Decryption. https://app.cochat.ai/papers/10.1109/tifs.2013.2271848
- The paper
- Lai, J., Deng, R. H., Guan, C., & Weng, J. (2013). Attribute-Based Encryption With Verifiable Outsourced Decryption. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2013.2271848
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.