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

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

Attribute-based encryption for fine-grained access control of encrypted data

Goyal, Vipul, Pandey, Omkant, Sahai, Amit, Waters, Brent · 2006 · Proceedings of the 13th ACM conference on Computer and communications security

Abstract

As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt data stored at these sites. One drawback of encrypting data, is that it can be selectively shared only at a coarse-grained level (i.e., giving another party your private key). We develop a new cryptosystem for fine-grained sharing of encrypted data that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are labeled with sets of attributes and private keys are associated with access structures that control which ciphertexts a user is able to decrypt. We demonstrate the applicability of our construction to sharing of audit-log information and broadcast encryption. Our construction supports delegation of private keys which subsumesHierarchical Identity-Based Encryption (HIBE).

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.

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

Integrity signals

Registry

Crossref · 10.1145/1180405.1180418

Cites

35 of 35 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.

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.

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

Research works printed but not linked: 5

  1. S. G. Akl and P. D. Taylor . Cryptographic Solution to a Multi Level Security Problem.In Advances in Cryptology -- CRYPTO 1982 .]] S. G. Akl and P. D. Taylor. Cryptographic Solution to a Multi Level Security Problem.In Advances in Cryptology -- CRYPTO 1982.]]
  2. 10.1145/1102120.1102162 · doi:10.1145/1102120.1102162
  3. 10.5555/647995.742435 · doi:10.5555/647995.742435
  4. 10.1145/1030083.1030130 · doi:10.1145/1030083.1030130
  5. 10.5555/795665.796535 · doi:10.5555/795665.796535

Cited by

See all 5,009

Metadata

Authors
Goyal, V., Pandey, O., Sahai, A., & Waters, B.
Venue
Proceedings of the 13th ACM conference on Computer and communications security
Publisher
ACM
Published
2006-10-30
Pages
89-98
ISSN
1543-7221 (ISSN-L)
OpenAlex
W2138001464
Cited by
5,009
References
35
FWCI
31.94
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.