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
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.
Integrity signals
Registry
Cites
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.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Shamir [33] and Blakley [6] were the first to propose a construction for secret-sharing schemes where the access structure is a threshold gate.”
BackgroundIdentity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
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
Self-citationSafeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
IEEE Symposium on Security and Privacy
(2023) · IT Professional · doi:10.1109/mitp.2023.3246667 · Cited by 1,167
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
Hierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
Self-citationChosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Secure schemes for secret sharing and key distribution
Beimel, A. (1996) · Medical Entomology and Zoology · Cited by 779
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
(2016) · Elsevier eBooks · doi:10.1016/c2013-0-19116-7 · Cited by 689
Secret sharing scheme realizing general access structure
Ito, M., Saito, A., & Nishizeki, T. (1989) · Electronics and Communications in Japan (Part III: Fundamental Electronic Science) · doi:10.1002/ecjc.4430720906 · Cited by 681
Generalized Secret Sharing and Monotone Functions
Benaloh, J., & Leichter, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_3 · Cited by 677
Toward Hierarchical Identity-Based Encryption
Horwitz, J., & Lynn, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_31 · Cited by 584
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Self-citationKarchmer, M., & Wigderson, A. (2002) · [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference · doi:10.1109/sct.1993.336536 · Cited by 486
Some Ideal Secret Sharing Schemes
Brickell, E. F. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_45 · Cited by 474
The LSD Broadcast Encryption Scheme
Halevy, D., & Shamir, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_4 · Cited by 411
Secure attribute-based systems
Pirretti, M., Traynor, P., McDaniel, P., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180419 · Cited by 363
Self-citationProblems and Theorems in Linear Algebra
Prasolov, V. (1994) · Translations of Mathematical Monographs · doi:10.1090/mmono/134 · Cited by 359
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Boneh, D., & Katz, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_8 · Cited by 283
Access control mechanisms for inter-organizational workflow
Kang, M. H., Park, J. S., & Froscher, J. N. (2001) · Proceedings of the sixth ACM symposium on Access control models and technologies · doi:10.1145/373256.373266 · Cited by 177
A unified scheme for resource protection in automated trust negotiation
Yu, T., & Winslett, M. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199331 · Cited by 171
Concealing complex policies with hidden credentials
Bradshaw, R. W., Holt, J. E., & Seamons, K. E. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030104 · Cited by 166
Automated trust negotiation using cryptographic credentials
Li, J., Li, N., & Winsborough, W. H. (2005) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1102120.1102129 · Cited by 130
Gavriloaie, R., Nejdl, W., Olmedilla, D., Seamons, K. E., & Winslett, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25956-5_24 · Cited by 123
Identity-Based Encryption Gone Wild
Abdalla, M. F., Catalano, D., Dent, A. W., Malone-Lee, J., Neven, G., & Smart, N. P. (2006) · Lecture notes in computer science · doi:10.1007/11787006_26 · Cited by 122
Methods and limitations of security policy reconciliation
MDaniel, P., & Prakash, A. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2002.1004363 · Cited by 88
Access Control Using Pairing Based Cryptography
Smart, N. P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_8 · Cited by 86
Principles of Policy in Secure Groups.
Harney, H., Colgrove, A., & McDaniel, P. D. (2001) · Cited by 51
Research works printed but not linked: 5
- 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.]]
- 10.1145/1102120.1102162 · doi:10.1145/1102120.1102162
- 10.5555/647995.742435 · doi:10.5555/647995.742435
- 10.1145/1030083.1030130 · doi:10.1145/1030083.1030130
- 10.5555/795665.796535 · doi:10.5555/795665.796535
Cited by
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-citationWaters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
Self-citationAchieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462174 · Cited by 1,602
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
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
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.