The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Practical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
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
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
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
Efficient Algorithms for Pairing-Based Cryptosystems
Barreto, P. S. L. M., Kim, H. Y., Lynn, B., & Scott, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_23 · Cited by 1,069
Privacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
(2005) · Codes · doi:10.1201/9781420035087-10 · Cited by 913
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Secure Conjunctive Keyword Search over Encrypted Data
Golle, P., Staddon, J., & Waters, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_3 · Cited by 773
Information and Communications Security
Qing, S., Wang, G., & Imai, H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77048-0 · Cited by 770
(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 709
Real life information retrieval: a study of user queries on the Web
Jansen, B. J., Spink, A., Bateman, J., & Saracevic, T. (1998) · ACM SIGIR Forum · doi:10.1145/281250.281253 · Cited by 622
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Building an Encrypted and Searchable Audit Log.
Waters, B. R., Balfanz, D., Durfee, G., & Smetters, D. K. (2004) · Cited by 372
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Knuth, D. E. (1978) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 369
The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth)
MacLaren, M. D. (1970) · SIAM Review · doi:10.1137/1012065 · Cited by 306
(2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4 · Cited by 285
Selecting Cryptographic Key Sizes: Extended Abstract
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_30 · Cited by 265
Untraceable RFID tags via insubvertible encryption
Ateniese, G., Camenisch, J., & de Medeiros, B. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102134 · Cited by 171
Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number.Preprint
Scott, M. (2002) · IACR Cryptology ePrint Archive · Cited by 114
Federal Information Processing Standards
National Cancer Institute (2020) · Definitions · doi:10.32388/91lxwc · Cited by 70
Time-Scoped Searching of Encrypted Audit Logs
Davis, D., Monrose, F., & Reiter, M. K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30191-2_41 · Cited by 18
Self-citation
Cited by
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
Self-citationHighly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_20 · Cited by 883
Secure Ranked Keyword Search over Encrypted Cloud Data
Wang, C., Cao, N., Li, J., Ren, K., & Lou, W. (2010) · 2010 IEEE 30th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2010.34 · Cited by 732
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
Wang, C., Cao, N., Ren, K., & Lou, W. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.282 · Cited by 531
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
Metadata
- Authors
- Ballard, L., Kamara, S., & Monrose, F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 414-426
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1836365731
- Cited by
- 299
- References
- 38
- FWCI
- 3.82
- 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.