The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Hierarchical Predicate Encryption for Inner-Products
Open accessOverview
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
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
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
Attribute-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
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
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
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
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
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Efficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
Attribute-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
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 709
Traitor Tracing with Constant Transmission Rate
Kiayias, A., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_30 · Cited by 675
Secure Identity Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_27 · Cited by 621
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
Horadam, K. (2003) · Lecture notes in computer science · doi:10.1007/b93924 · Cited by 524
Advances in Cryptology – EUROCRYPT 2008
Tillich, J., & Zémor, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78967-3 · Cited by 521
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
Boyen, X., & Waters, B. R. (2006) · Lecture notes in computer science · doi:10.1007/11818175_17 · Cited by 495
Iwata, T., & Cheon, J. H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48800-3 · Cited by 476
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3 · Cited by 395
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
Hutchison, D., Naor, M., Takeo Kanade, A., Kittler, J., Kleinberg, J. M., Mitchell, J. C., Nierstrasz, O., Pandu Rangan, C., Pieprzyk, J., Steffen, B., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7 · Cited by 308
Generalized Identity Based and Broadcast Encryption Schemes
Boneh, D., & Hamburg, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_28 · Cited by 218
Delegating Capabilities in Predicate Encryption Systems
Shi, E., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_46 · Cited by 169
Hierarchical Identity Based Encryption with Polynomially Many Levels
Gentry, C., & Halevi, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_26 · Cited by 140
Homomorphic Encryption and Signatures from Vector Decomposition
Okamoto, T., & Takashima, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85538-5_4 · Cited by 134
Self-citation
Cited by
Lewko, 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-citationPredicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Functional Encryption: Definitions and Challenges
Boneh, D., Sahai, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_16 · Cited by 1,010
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Okamoto, T., & Takashima, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_11 · Cited by 507
Self-citationVABKS: Verifiable attribute-based keyword search over outsourced encrypted data
Zheng, Q., Xu, S., & Ateniese, G. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6847976 · Cited by 499
Metadata
- Authors
- Okamoto, T., & Takashima, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 214-231
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1511513446
- Cited by
- 290
- References
- 35
- FWCI
- 13.16
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.