Topic
Keyword cipher
About: Keyword cipher is a research topic. Over the lifetime, 18 publications have been published within this topic receiving 326 citations.
Papers
TL;DR: In this paper, Li et al. proposed a public-key encryption with fuzzy keyword search (PEFKS) scheme, in which two or more keywords share the same fuzzy keyword trapdoor.
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.
248 citations
TL;DR: Author modified the traditional Caesar cipher and fixed the key size as one and checked alphabet index to increase the value by one and if alphabet index is odd decrease the keyvalue by one.
Abstract: is the process of scrambling a message so that only the intended recipient can read it. With the fast progression of digital data exchange in electronic way, Information Security is becoming much more important in data storage and transmission. Caesar cipher is a mono alphabetic cipher. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter. In this paper, author modified the traditional Caesar cipher and fixed the key size as one. Another thing alphabet index is checked if the alphabet index is even then increase the value by one else alphabet index is odd decrease the key value by one. Encryption and scrambling of the letters in the Cipher Text.
57 citations
Patent•
15 Oct 2004TL;DR: In this paper, an incremental keyword seach is performed by receiving an input keyword string comprising one or more words having one-or more symbols, creating a bit vector based at least in part on the keyword string, comparing the bit vector with other bit vectors representing at least one candidate keyword string to create a set of matching bit vectors and applying a conventional keyword matching algorithm to the at least keyword string represented by the matching bit vector.
Abstract: An incremental keyword seach may be performed by receiving an input keyword string comprising one or more words having one or more symbols, creating a bit vector based at least in part on the input keyword string, comparing the bit vector with one or more other bit vectors representing at least one candidate keyword string to create a set of matching bit vectors and applying a conventional keyword matching algorithm to the at least one candidate keyword string represented by the matching bit vectors. Any matching candidate keyword strings are presented.
53 citations
Patent•
IBM1
TL;DR: In this article, a method for searching a non-tokenized text string for matches against a keyword data structure organized as a set of one or more keyword objects is proposed, which is based on the approach described in this paper.
Abstract: A method for searching a non-tokenized text string for matches against a keyword data structure organized as a set of one or more keyword objects. The method begins by (a) indexing into the keyword data structure using a character in the non-tokenized text string. Preferably, the character is a Unicode value. The routine then continues by (b) comparing a portion of the non-tokenized text string to a keyword object. If the portion of the non-tokenized text string matches the keyword object, the routine saves the keyword object in a match list. If, however, the portion of the non-tokenized text string does not match the keyword object and there are no other keyword objects that share a root with the non-matched keyword object, the routine repeats step (a) with a new character. These steps are then repeated until all characters in the non-tokenized text string have been analyzed against the keyword data structure.
33 citations
Patent•
8 May 2013
TL;DR: In this article, the authors proposed a keyword cipher text retrieval method for cloud storage consisting of a data owner, a cloud service sever and a data user, where the data owner stores encrypted files, headlines, keywords and verify certifications of the data user and the like to the cloud service server.
Abstract: The invention provides a keyword cipher text retrieval method for cloud storage. The method comprises a data owner, a cloud service sever and a data user. The data owner stores encrypted files, headlines, keywords and verify certifications of the data user and the like to the cloud service server. The cloud service server stores and builds up corresponding relationships of the encrypted files, headlines and keywords, and stores the verify certifications of the data user and the like. When the data user visits cipher texts inside the cloud service server, the data user needs the verify certification awarded by the data owner and provides the cloud service server with information like a keyword trap door and the like, the cloud service server sends the cipher texts the user needs to the data user according to the information like the keyword trap door and the like, and the data user utilizes a secret key to decipher the cipher texts. Compared with the prior art, the keyword cipher text retrieval method for the cloud storage is high in safety, and capable of lowering burdens of communication, storage, and calculation, and improving accuracy and efficiency of retrieval of cipher texts.
14 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2016 | 1 |
| 2015 | 2 |
| 2013 | 6 |
| 2006 | 1 |
| 2004 | 2 |