Journal
JOURNAL OF COMPUTERS
Volume 7, Issue 3, Pages 716-723Publisher
ACAD PUBL
DOI: 10.4304/jcp.7.3.716-723
Keywords
searchable public key encryption; designated tester; keyword guessing attack; decryptable; re-dpeks
Funding
- Key Science Technology Project of Shandong Province [2011GGX10124]
- Outstanding Young Scientists Foundation Grant of Shandong Province [BS2009DX018]
Ask authors/readers for more resources
In a searchable public-key encryption scheme with a designated tester (dPEKS), only the designated server can test which dPEKS ciphertext is related with a given trapdoor generated by a user with a keyword w by using the server's private key, but learn nothing else. In this paper, we study the keyword guessing attack of dPEKS and shows that two dPEKS schemes are insecure against this type of attack. Then an enhanced scheme is proposed and proved secure against chosen keyword attack and keyword guessing attack. To resolve the problem that dPEKS scheme does not allow the user to decrypt the encrypted keyword which limits its applicability, we give the definition of decryptable searchable public key encryption with a designated tester which enables keyword decryption from keyword ciphertext and get a concrete construction based on our dPEKS scheme. At last, we extend the dPEKS scheme to a bidirectional searchable proxy re-encryption with a designated tester scheme(RedPEKS).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available