Title :
A Note on Verifiable Privacy-Preserving Tries
Author :
Kissel, Zachary A. ; Jie Wang
Author_Institution :
Dept. of Comput. Sci., Merrimack Coll., North Andover, MA, USA
fDate :
June 27 2014-July 2 2014
Abstract :
We describe a security flaw in the construction of the privacy-preserving trie presented in an ICC´12 paper. The flaw allows a semi-honest-but-curious cloud to forge a verifiable dictionary entry with a set of documents that do not contain the keyword in the query. We then proceed to offer a fix.
Keywords :
cloud computing; data privacy; document handling; query processing; documents; keyword; query; security flaw; semi-honest-but-curious cloud; verifiable dictionary entry; verifiable privacy-preserving tries; Computational modeling; Computer science; Conferences; Encryption; Indexes; Cloud computing; Cryptography; Indexes;
Conference_Titel :
Cloud Computing (CLOUD), 2014 IEEE 7th International Conference on
Conference_Location :
Anchorage, AK
Print_ISBN :
978-1-4799-5062-1
DOI :
10.1109/CLOUD.2014.134
