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

The DOI matches its Crossref record; 1 of the 1 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
DOI 10.1145/1180405.1180418
Open this paper in CoChat — free account

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.

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/1180405.1180418

Cites

1 of 1 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 1 references

Research works printed but not linked: 32

  1. 10.1007/11787006_26 · DOI
  2. 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.]]
  3. 10.1145/168588.168596 · DOI · Paper page
  4. J. Benaloh and Leichter J . Generalized Secret Sharing and Monotone Functions.In Advances in Cryptology -- CRYPTO volume 403 of LNCS pages 27--36 . Springer , 1988 .]] J. Benaloh and Leichter J. Generalized Secret Sharing and Monotone Functions.In Advances in Cryptology -- CRYPTO volume 403 of LNCS pages 27--36. Springer, 1988.]]
  5. G. R. Blakley . Safeguarding cryptographic keys.In National Computer Conference pages 313 -- 317 . American Federation of Information Processing Societies Proceedings , 1979 .]] G. R. Blakley. Safeguarding cryptographic keys.In National Computer Conference pages 313--317. American Federation of Information Processing Societies Proceedings, 1979.]]
  6. D. Boneh and X. Boyen . Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 223--238 . Springer , 2004 .]] D. Boneh and X. Boyen. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 223--238. Springer, 2004.]]
  7. D. Boneh , G. D. Crescenzo , R. Ostrovsky , and G. Persiano . Public-Key Encryption with Keyword Search.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 506--522 . Springer , 2004 .]] D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public-Key Encryption with Keyword Search.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 506--522. Springer, 2004.]]
  8. D. Boneh and M. Franklin . Identity Based Encryption from the Weil Pairing . In Advances in Cryptology -- CRYPTO volume 2139 of LNCS pages 213--229 . Springer , 2001 .]] D. Boneh and M. Franklin. Identity Based Encryption from the Weil Pairing. In Advances in Cryptology -- CRYPTO volume 2139 of LNCS pages 213--229. Springer, 2001.]]
  9. 10.1007/11535218_16 · DOI · Paper page
  10. 10.1007/978-3-540-30574-3_8 · DOI · Paper page
  11. 10.1145/1102120.1102162 · doi:10.1145/1102120.1102162
  12. 10.1145/1030083.1030104 · DOI
  13. E.F. Brickell . Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 6 : 105 -- 113 , 1989 .]] E.F.Brickell.Some ideal secret sharing schemes.Journal of Combinatorial Mathematics and Combinatorial Computing 6:105--113, 1989.]]
  14. R. Canetti , S. Halevi , and J. Katz . A Forward-Secure Public-Key Encryption Scheme.In Advances in Cryptology -- Eurocrypt volume 2656 of LNCS Springer , 2003 .]] R. Canetti, S. Halevi, and J. Katz. A Forward-Secure Public-Key Encryption Scheme.In Advances in Cryptology -- Eurocrypt volume 2656 of LNCS Springer, 2003.]]
  15. R. Canetti , S. Halevi , and J. Katz . Chosen Ciphertext Security from Identity Based Encryption.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 207--222 . Springer , 2004 .]] R. Canetti, S. Halevi, and J. Katz. Chosen Ciphertext Security from Identity Based Encryption.In Advances in Cryptology -- Eurocrypt volume 3027 of LNCS pages 207--222. Springer, 2004.]]
  16. 10.5555/647995.742435 · doi:10.5555/647995.742435
  17. 10.1145/1030083.1030130 · doi:10.1145/1030083.1030130
  18. Rita Gavriloaie , Wolfgang Nejdl , Daniel Olmedilla , Kent E. Seamons , and Marianne Winslett . No registration needed:How to use declarative policies and negotiation to access sensitive resources on the semantic web . In ESWS pages 342 -- 356 , 2004 .]] Rita Gavriloaie, Wolfgang Nejdl, Daniel Olmedilla, Kent E. Seamons, and Marianne Winslett. No registration needed:How to use declarative policies and negotiation to access sensitive resources on the semantic web. In ESWS pages 342--356, 2004.]]
  19. Craig Gentry and Alice Silverberg . Hierarchical id-based cryptography . In ASIACRYPT pages 548 -- 566 , 2002 .]] Craig Gentry and Alice Silverberg. Hierarchical id-based cryptography. In ASIACRYPT pages 548--566, 2002.]]
  20. D. Halevy and A. Shamir . The LSD Broadcast Encryption Scheme . In Advances in Cryptology -- CRYPTO volume 2442 of LNCS pages 47--60 . Springer , 2002 .]] D. Halevy and A. Shamir. The LSD Broadcast Encryption Scheme. In Advances in Cryptology -- CRYPTO volume 2442 of LNCS pages 47--60. Springer, 2002.]]
  21. Hugh Harney , Andrea Colgrove , and Patrick Drew McDaniel . Principles of policy in secure groups.In NDSS 2001 .]] Hugh Harney, Andrea Colgrove, and Patrick Drew McDaniel. Principles of policy in secure groups.In NDSS 2001.]]
  22. Jeremy Horwitz and Ben Lynn . Toward hierarchical identity-based encryption . In Lars R.Knudsen editor EUROCRYPT volume 2332 of Lecture Notes in Computer Science pages 466 -- 481 . Springer 2002 .]] Jeremy Horwitz and Ben Lynn. Toward hierarchical identity-based encryption. In Lars R.Knudsen editor EUROCRYPT volume 2332 of Lecture Notes in Computer Science pages 466--481. Springer 2002.]] · DOI
  23. M. Ito , A. Saito , and T. Nishizeki . Secret Sharing Scheme Realizing General Access Structure . In IEEE Globecom IEEE , 1987 .]] M. Ito, A. Saito, and T. Nishizeki. Secret Sharing Scheme Realizing General Access Structure. In IEEE Globecom IEEE, 1987.]]
  24. 10.1145/373256.373266 · DOI · Paper page
  25. 10.1145/1102120.1102129 · DOI
  26. Patrick Drew McDaniel and Atul Prakash . Methods and limitations of security policy reconciliation . In IEEE Symposium on Security and Privacy pages 73 -- 87 , 2002 .]] Patrick Drew McDaniel and Atul Prakash. Methods and limitations of security policy reconciliation. In IEEE Symposium on Security and Privacy pages 73--87, 2002.]]
  27. 10.1145/1180405.1180419 · DOI · Paper page
  28. 10.5555/795665.796535 · doi:10.5555/795665.796535
  29. 10.1007/11426639_27 · DOI · Paper page
  30. A. Shamir . Identity Based Cryptosystems and Signature Schemes . In Advances in Cryptology -- CRYPTO volume 196 of LNCS pages 37--53 . Springer , 1984 .]] A. Shamir. Identity Based Cryptosystems and Signature Schemes. In Advances in Cryptology -- CRYPTO volume 196 of LNCS pages 37--53. Springer, 1984.]]
  31. Nigel P. Smart . Access control using pairing based cryptography . In CT-RSA pages 111 -- 121 , 2003 .]] Nigel P. Smart. Access control using pairing based cryptography. In CT-RSA pages 111--121, 2003.]]
  32. Ting Yu and Marianne Winslett . A unified scheme for resource protection in automated trust negotiation . In IEEE Symposium on Security and Privacy pages 110 -- 122 , 2003 .]] Ting Yu and Marianne Winslett. A unified scheme for resource protection in automated trust negotiation. In IEEE Symposium on Security and Privacy pages 110--122, 2003.]]

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)
DOI
10.1145/1180405.1180418
OpenAlex
W2138001464
Cited by
5,009
References
1
FWCI
31.94
Type
conference paper
Language
en
Open access
closed
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)

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 fine-grained access control of encrypted data. https://app.cochat.ai/papers/10.1145/1180405.1180418
The paper
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006). Attribute-based encryption for fine-grained access control of encrypted data. Proceedings of the 13th ACM conference on Computer and communications security. https://doi.org/10.1145/1180405.1180418

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.