The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack
Abstract
Public-key encryption with keyword search (PEKS) is a versatile tool. It allows a third party knowing the search trapdoor of a keyword to search encrypted documents containing that keyword without decrypting the documents or knowing the keyword. However, it is shown that the keyword will be compromised by a malicious third party under a keyword guess attack (KGA) if the keyword space is in a polynomial size. We address this problem with a keyword privacy enhanced variant of PEKS referred to as public-key encryption with fuzzy keyword search (PEFKS). In PEFKS, each keyword corresponds to an exact keyword search trapdoor and a fuzzy keyword search trapdoor. Two or more keywords share the same fuzzy keyword trapdoor. To search encrypted documents containing a specific keyword, only the fuzzy keyword search trapdoor is provided to the third party, i.e., the searcher. Thus, in PEFKS, a malicious searcher can no longer learn the exact keyword to be searched even if the keyword space is small. We propose a universal transformation which converts any anonymous identity-based encryption (IBE) scheme into a secure PEFKS scheme. Following the generic construction, we instantiate the first PEFKS scheme proven to be secure under KGA in the case that the keyword space is in a polynomial size.
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.
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
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
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
Brysbaert, M., & New, B. (2009) · Behavior Research Methods · doi:10.3758/brm.41.4.977 · Cited by 2,821
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
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
Order preserving encryption for numeric data
Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007632 · Cited by 1,206
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
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
Multi-Dimensional Range Query over Encrypted Data
Shi, E., Bethencourt, J., Chan, T.-H. H., Song, D., & Perrig, A. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.29 · Cited by 552
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
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
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
Frey, G., Muller, M., & Ruck, H.-G. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771254 · Cited by 242
Camenisch, J. L., Kohlweiss, M., Rial, A., & Sheedy, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00468-1_12 · Cited by 144
Constructing PEKS schemes secure against keyword guessing attacks is possible?
Jeong, I. R., Kwon, J. O., Hong, D., et al. (2008) · Computer Communications · doi:10.1016/j.comcom.2008.11.018 · Cited by 124
Doumen, J. M., Brinkman, R. L., & Jonker, W. (2004) · University of Twente Research Information · Cited by 107
Using Internet search engines to estimate word frequency
Blair, I. V., Urland, G. R., & Ma, J. E. (2002) · Behavior Research Methods, Instruments, & Computers · doi:10.3758/bf03195456 · Cited by 87
Efficient Conjunctive Keyword-Searchable Encryption
Ryu, E., & Takagi, T. (2007) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/ainaw.2007.166 · Cited by 50
Cited by
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage
Li, J., Lin, X., Zhang, Y., & Han, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2542813 · Cited by 321
Countering Statistical Attacks in Cloud-Based Searchable Encryption
Ahsan, M. A. M., Ali, I., Bin Idris, M. Y. I., Imran, M., & Shoaib, M. (2020) · International Journal of Parallel Programming · doi:10.1007/s10766-018-0584-8 · Cited by 9
Metadata
- Authors
- Xu, P., Jin, H., Wu, Q., & Wang, W.
- Venue
- IEEE Transactions on Computers
- Published
- 2013-11
- Volume
- 62
- Issue
- 11
- Pages
- 2266-2277
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2080574324
- Cited by
- 259
- References
- 18
- FWCI
- 6.33
- Type
- journal article
- 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.