Research Proposal

This research proposal discusses two key researchers and their papers on dynamic proof of storage and multi-keyword ranked search scheme over encrypted cloud data. The first paper focuses on the importance of secure client-side cross-user duplication technique in multi-user cloud storage systems. The second paper presents a secure search scheme for encrypted cloud data, supporting dynamic update operations and multi-keyword ranked search. The papers propose efficient solutions and provide theoretical analysis and experimental results to demonstrate their effectiveness.

Running head: RESEARCH PROPOSAL
Research Proposal
[Name of the Student]
[Name of the University]
[Author note]

1RESEARCH PROPOSAL
Two Key Researchers and Their paper and the reason behind why they are
leading:
The first paper “DeyPoS: Deduplicatable Dynamic Proof of Storage for Multi-User
Environments” by “Kun He, Jing Chen, Ruiying Du, Qianhong Wu, Guoliang Xue, and Xiang
Zhang” has been associated with discussing the fact that Dynamic Proof of the storage is very
much useful cryptographic primitive which is generally associated with enabling the users in
becoming capable of checking the integrity of the outsources files and for effective updating of
the files in the cloud servers.
The Second paper that has been selected is “A Secure and Dynamic Multi-keyword
Ranked Search Scheme over Encrypted Cloud Data” by “Zhihua Xia, Xinhui Wang, Xingming
Sun and Qian Wang” has been associated with depicting the fact that because of the increased
popularity of the cloud computing technology, more and more people are associating themselves
with this technology.
Importance of the papers:
The first paper has been associated with depicting the fact that there exists many other
proposals by other researchers related to the numerous dynamic PoS schemes which exists in a
single user environment and besides this the problem generally exists in the multi-user
environments which lacks sufficient investigation. So it is very much essential to make sure that
the practical multi-user cloud storage system needs the secure client side cross-user duplication
technique. This in turn would be associated with allowing the users in skipping the process of
uploading and obtaining of the best ownership of the file immediately whenever the other owners
of the same file are associated with uploading those files to the cloud servers. Besides this from

2RESEARCH PROPOSAL
the paper it can be concluded that there exists no such existing dynamic PoSs that is capable of
supporting the technique. Besides this the paper has also been associated with introducing the
concept of de- duplicatable dynamic proof of the storage and has been associated with proposing
a construction which is efficient and it is known as the DeyPoS. This was mainly proposed for
the purpose of achieving the dynamic PoS and for simultaneous securing of the cross-user
duplication. In addition to all this The challenges has also been considered that are faced by the
structure diversity and the private tag generation, so as to exploit one of the novel tool which is
also known as the Homomorphic Authenticated Tree or the HAT. The paper have been
associated with proving the fact that the security of the construction of the researchers along with
the theoretical analysis and the experimental results are associated with showing the fact that the
construction is very much efficient in practice.
The second paper has been associated with depicting the fact that the data owners are also
motivated for outsourcing their data to the cloud servers so as to achieve great convenience and
for reducing the cost related to managing the data. But despite of all this the data which are
sensitive needs to eb encrypted before they are outsourced for the concerns related to privacy.
This in turn is associated with making the data utilization obsolete such as the keyword-based
retrieval of the document. The paper is also associated with presenting a secure search scheme
which is multi-keyword ranked and this is generally done over the encrypted cloud data which is
simultaneously associated with supporting the dynamic update operations such as the deletion
and the insertion of the documents. The paper has specially emphasized upon the vector space
model along with the TF*IDF model which is the most widely used. These models have been
combined in the construction of the index and for generating the query. Along with all this the
research paper has been associated with the construction of a special tree-based index structure

3RESEARCH PROPOSAL
along with proposing a “Greedy Depth-first Search” algorithm for the purpose of providing
multi-keyword ranked search which is seen to be very much efficient.
Summary of the Paper: “A Secure and Dynamic Multi-keyword Ranked
Search Scheme over Encrypted Cloud Data” by “Zhihua Xia, Xinhui Wang,
Xingming Sun and Qian Wang”.
The research paper also discusses about the kNN algorithm which is generally used for
the purpose of encrypting the index along with the query vectors. At the same time the research
paper also ensures the accurate relevance score calculation that exists between the encrypted
index and the query vector has also been done very accurately. Besides this for the purpose of
resisting the statistical attacks the phantom term has been used. This phantom term has been
added to the index vector so as to obtain blinding search results. Because of the usage of the
special tree based index structure the scheme which has been proposed in this paper makes the
users capable of achieving a sub-liner search time and for dealing with the deletion as well as the
insertion of the flexibility of the documents. The research paper has been associated with
conducting extensive experiments so as to demonstrate the efficiency of the scheme that has been
proposed.
Additionally this paper concludes with proposing all the comprehensive requirements that
exists in a multi-user cloud storage systems and has also been associated with introducing an
model of the de-duplicatable dynamic PoS. the entire report has been associated with discussing
about the new novel tool known as the HAT which is one of the most authentic and efficient
structure. And by depending upon the HAT the paper has been associated with proposing the
first practical de-duplicatable dynamic PoS scheme which is also known as the DeyPoS and has

4RESEARCH PROPOSAL
also been associated with proving the security that exists in the random oracle model. The results
which has been obtained from the theoretical as well as from the experimental results is
associated with showing the fact that the implementation of the DeyPoS is efficient and this
specially seen to be much more efficient when the size of the files and the number of blocks
which has been challenges is large.
The paper has been associated with providing a secure as well as efficient and dynamic
search scheme which is not only associated with supporting the accurate multi-keyword ranked
search but is also associated with providing a huge support to the dynamic insertion and deletion
of the documents A special keyword balance binary tree has been created which would be acting
as the index and this has initially lead to proposing of the “Greedy Depth-first Search” algorithm
for the purpose of obtaining a better efficiency than the linear search. Additionally the parallel
search processes is also carried out so as to reduce the cost related to time. The security of the
entire scheme against the two major threat models is done by making use of the kNN algorithm
and the results obtained has been associated with demonstrating the scheme that has been
proposed.

5RESEARCH PROPOSAL
Bibliography:
[1.]He, K., Chen, J., Du, R., Wu, Q., Xue, G. and Zhang, X., Deypos: Deduplicatable dynamic
proof of storage for multi-user environments, IEEE Transactions on Computers, 65(12),
pp.3631-3645, 2016.
[2.]Xia, Z., Wang, X., Sun, X. and Wang, Q., A secure and dynamic multi-keyword ranked
search scheme over encrypted cloud data, IEEE transactions on parallel and distributed
systems, 27(2), pp.340-352, 2016.
[3.]Cao, N., Wang, C., Li, M., Ren, K. and Lou, W., Privacy-preserving multi-keyword ranked
search over encrypted cloud data, IEEE Transactions on parallel and distributed
systems, 25(1), pp.222-233, 2014.
[4.]Fu, Z., Sun, X., Liu, Q., Zhou, L. and Shu, J., Achieving efficient cloud search services:
multi-keyword ranked search over encrypted cloud data supporting parallel
computing, IEICE Transactions on Communications, 98(1), pp.190-200, 2015.