The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Practical constructions and new proof methods for large universe attribute-based encryption
Abstract
We propose two large universe Attribute-Based Encryption constructions. In a large universe ABE system any string can be used as an attribute and attributes need not be enumerated at system setup. Our first construction establishes a novel large universe Ciphertext-Policy ABE scheme on prime order bilinear groups, while the second achieves a significant efficiency improvement over the large universe Key-Policy ABE system of Lewko-Waters and Lewko. Both schemes are selectively secure in the standard model under two ``q-type'' assumptions similar to ones used in prior works. Our work brings back ``program and cancel'' techniques to this problem and aims in providing practical large universe ABE implementations. To showcase the efficiency improvements over prior constructions, we provide implementations and benchmarks of our schemes in Charm; a programming environment for rapid prototyping of cryptographic primitives. We compare them to implementations of the only three published constructions that offer unbounded ABE in the standard model.
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
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
Self-citationLewko, 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
Self-citation
Cited by
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Online/Offline Attribute-Based Encryption
Hohenberger, S., & Waters, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54631-0_17 · Cited by 268
Self-citationAttribute Based Encryption with Privacy Protection and Accountability for CloudIoT
Li, J., Zhang, Y., Ning, J., Huang, X., Poh, G. S., & Wang, D. (2022) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2020.2975184 · Cited by 258
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
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Metadata
- Authors
- Rouselakis, Y., & Waters, B.
- Venue
- Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
- Publisher
- ACM Press
- Published
- 2013
- Pages
- 463-474
- OpenAlex
- W2086298846
- Cited by
- 446
- References
- 2
- FWCI
- 19.30
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Practical constructions and new proof methods for large universe attribute-based encryption. https://app.cochat.ai/papers/10.1145/2508859.2516672
- The paper
- Rouselakis, Y., & Waters, B. (2013). Practical constructions and new proof methods for large universe attribute-based encryption. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13. https://doi.org/10.1145/2508859.2516672
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.
