Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 406

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Attribute-based encryption for circuits

Gorbunov, Sergey, Vaikuntanathan, Vinod, Wee, Hoeteck·2013·Proceedings of the forty-fifth annual ACM symposium on Theory of Computing

Abstract

In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an l-bit public index pind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows to decrypt the ciphertext and learn m iff P(pind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2488608.2488677

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 406

Metadata

Authors
Gorbunov, S., Vaikuntanathan, V., & Wee, H.
Venue
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
Publisher
ACM
Published
2013-06
Pages
545-554
OpenAlex
W2008701790
Cited by
406
References
2
FWCI
36.64
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: Attribute-based encryption for circuits. https://app.cochat.ai/papers/10.1145/2488608.2488677
The paper
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2013). Attribute-based encryption for circuits. Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. https://doi.org/10.1145/2488608.2488677

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.