Score:0

Does the searchable encryption scheme satisfy trapdoor indistinguishability?

in flag

In a searchable encryption scheme based on the certificateless cryptosystem, the trapdoor generation algorithm only has a hash function that outputs an integer value. Does the scheme satisfy trapdoor indistinguishability? If so, how can we prove it?

Score:0
cn flag

Although without a reference, from your description the answer is likely no. For trapdoor indistinguishability (in public key searchable encryption, since you mentioned certficateless), the client must have some secret information that is used in generating the trapdoor. If the trapdoor is generated by a hash function (without a key), then the adversary can easily distinguish trapdoors by hashing a list of keywords locally and comparing them to the trapdoors.

Rabindra Moirangthem avatar
in flag
What if the client has a symmetric key shared with the data owner beforehand, encrypts the keyword using the said symmetric key, and hashes the encrypted result as the trapdoor?
Changyu Dong avatar
cn flag
Then it may be OK. Most of the time, trapdoor indistinguishability is defined as a game in which the adversary can query the trapdoor oracles with constraints that the challenge keywords cannot be queried. If the keywords are encrypted before hashed, and assuming the adversary cannot access the encryption key, it should be easy to prove this property.
Rabindra Moirangthem avatar
in flag
How can I prove, though? Because most of the proofs are based on games that involve breaking hard problems like DL, CDH, DDH, BDH.
Changyu Dong avatar
cn flag
"encrypts the keyword using the said symmetric key" so likely you can reduce to the security of encryption scheme (modelled as a pseudorandom function/permutation), i.e. if it is not trapdoor indistinguishable then the encryption scheme is not secure pseudorandom function/permutation.
Rabindra Moirangthem avatar
in flag
Can you give an example? Is there a paper you can cite?
Changyu Dong avatar
cn flag
I don't have anything at hand but if you search the literature, you should be able to find something.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.