The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Secure attribute-based systems
Abstract
Attributes define, classify, or annotate the datum to which they are assigned. However, traditional attribute architectures and cryptosystems are ill-equipped to provide security in the face of diverse access requirements and environments. In this paper, we introduce a novel secure information management architecture based on emerging attribute-based encryption (ABE) primitives. A policy system that meets the needs of complex policies is defined and illustrated. Based on the needs of those policies, we propose cryptographic optimizations that vastly improve enforcement efficiency. We further explore the use of such policies in two example applications: a HIPAA compliant distributed file system and a social network. A performance analysis of our ABE system and example applications demonstrates the ability to reduce cryptographic costs by as much as 98% over previously proposed constructions. Through this, we demonstrate that our attribute system is an efficient solution for securely managing information in large, loosely-coupled, distributed systems.
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×
“The decryption algorithm interpolates a polynomial in the exponent using Shamir’s [38] secret sharing method.”
Identity-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
Role-based access control models
Sandhu, R. S., Coyne, E. J., Feinstein, H. L., & Youman, C. E. (1996) · Computer · doi:10.1109/2.485845 · Cited by 5,892
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-citationAttribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Self-citationRandom 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-citationProposed NIST standard for role-based access control
Ferraiolo, D. F., Sandhu, R., Gavrila, S., Kuhn, D. R., & Chandramouli, R. (2001) · ACM Transactions on Information and System Security · doi:10.1145/501978.501980 · Cited by 2,544
(2011) · IEEE Software · doi:10.1109/ms.2011.67 · Cited by 1,989
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Access control: principle and practice
Sandhu, R. S., & Samarati, P. (1994) · IEEE Communications Magazine · doi:10.1109/35.312842 · Cited by 1,292
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
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP
Santesson, S., Myers, M., Ankney, R., Malpani, A., Galperin, S., & Adams, C. (2013) · doi:10.17487/rfc6960 · Cited by 804
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
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
Design and implementation of the idemix anonymous credential system
Camenisch, J., & Van Herreweghen, E. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586114 · Cited by 555
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP
Myers, M., Ankney, R., Malpani, A., Galperin, S., & Adams, C. (1999) · doi:10.17487/rfc2560 · Cited by 448
Ten Risks of Pki: WHAT YOU ARE NOT BEING TOLD ABOUT PUBLIC KEY INFRASTRUCTURE
Schneier, B., & Ellison, C. (2004) · Public Key Infrastructure · doi:10.1201/9780203498156.ch23 · Cited by 284
Compliance checking in the PolicyMaker trust management system
Blaze, M., Feigenbaum, J., & Strauss, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055488 · Cited by 239
Attribute-Based Publishing with Hidden Credentials and Hidden Policies.
Kapadia, A. C., Tsang, P. P., & Smith, S. W. (2007) · Cited by 124
The Multicast Group Security Architecture
T, T. H. M. I., & Weis, B. (2004) · doi:10.17487/rfc3740 · Cited by 120
Secret Handshakes with Dynamic and Fuzzy Matching.
Ateniese, G., Kirsch, J., & Blanton, M. (2007) · IRIS Research product catalog (Sapienza University of Rome) · Cited by 101
Antigone: a flexible framework for secure group communication
McDaniel, P. D., Prakash, A., & Honeyman, P. (1999) · Deep Blue (University of Michigan) · Cited by 60
Self-citationA Response to “Can We Eliminate Certificate Revocation Lists?”
McDaniel, P. D., & Rubin, A. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45472-1_17 · Cited by 48
Self-citationRealizing Massive-Scale Conditional Access Systems Through Attribute-Based Cryptosystems.
Traynor, P., Butler, K. R. B., Enck, W., & McDaniel, P. D. (2008) · Cited by 36
Self-citationUsing Threshold Attribute-Based Encryption for Practical Biometric-Based Access Control
Nali, D., Adams, C. M., & Miri, A. (2005) · doi:10.6633/ijns.200511.1(3).09 · Cited by 35
On the performance, feasibility, and use of forward-secure signatures
Cronin, E., Jamin, S., Malkin, T., & McDaniel, P. D. (2003) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/948109.948130 · Cited by 34
Self-citation
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-citationAttribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Self-citationWaters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
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-citationAttribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
Self-citation
Metadata
- Authors
- Pirretti, M., Traynor, P., McDaniel, P., & Waters, B.
- Venue
- Proceedings of the 13th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2006-10-30
- Pages
- 99-112
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2160608575
- Cited by
- 363
- References
- 32
- FWCI
- 12.73
- 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.