A novel contains the security for privacy data stored main memory applications access given by the admin users (BVR)

Vijayendra Reddy Baireddy,Vijayendra520@gmail.com,

COMPUTER SCIENCE & ENGINEERING.

JAIN UNIVERSITY,KANAKAPURA,BANGLORE

ABSTRACT

To update software presented main focus on problem has been developed. We have create a new and stronger safety then previous structures of software to satisfying to client guarantees. In setting can operated by only main owner access given to others parties given search queries. Briefly defined in searchable Symmetric Encryptions(SSE) multi-purpose setting to search queries. Some few attackers particular part in privacy which disallows leakage from updated operations.To focus active research and several security design and new constructions. Experiments results on large dataset show that is high effective. We can locate place and find “ip-address” from attackers computers and as safety process that can hidde the information and convert that another language which cant be understandable language.

KEYWORDS: Cloud Computing, privacy-storage, security, private cloud services,m-way search trees and DSSE(Dynamic Searchable Symmetric Encryptions).

INTRODUCTION

In cloud computing contains storage with high availability, easy to access the data and reduced price of storing data for another users providers.we have assurances to client with many generous of sensitive data of outsources to untrusted users.

To storage the privacy systems in encrypted data using symmetric encryptions. Storage benefactors provides end-to-end privacy data protected when leaves by the client’s control. We can balance the storage of functionalities contains the insufficient for storage systems.

Due to after data leave’s the client’s machine contains the encrypted form server cannot performed to any computations import full on it. on it.

While visiting general purpose or special-work

purpose the cloud server ip-address or details of

person can be given as security mail,etc. should be given.

While for solutions also generated security properties. Another purpose are added the “SSE-

Searchable searchable Encryptions”

SSE contains the admin user can be stored the data collections of translated documents. While submitted the files generated a keywords searches revealing any information, to performed a keyword searches cannot expose any informations about contents either papers or queries. It has two(2) different types of hi levels designed reasonably efficient and secured SSE schemes.

1st method are used in associates in apiece documents an scrambledto tested for occurrence by given keyword quires.

Naturally results in time searched in linear in ‘n’-contains number of of documents in collections of sets

2nd ha associates has coded overturned index to entire documents collections. It inherently sequential, required Ω(r) time even parallel mode of calculations. Due to encrypted index are used by constructions are used to stored data at random disk locations. It access the memory locations to access at currently locations. We can can show search for frequent keyword visions the output list as per order contains thousands of documents.

Our contributions. In SSE has newly designing the sub-linear time, but its has limited inverted time will be expired. N-no. of documents, m-keywords and p-cores(processors) constructions have been followed the few steps:-

1. Searches: each keyword can be w-run in O((r/p)log n) parallel time, r-no. of documents has collected private keywords w. p=w(log n) to parallel search time is O®. less than optimal sequential searched time.

2. Updates: for a documents ‘f’ contains the

unique-q keyword is running for O((m/p)log n) are parallel updated time is o(q) less than optimal sequential updated time.

3. There is no leaks information while updating and we can newly added/deleted documents.when we search keyword previously it has present the key mean it repeated.example we have started adding no. of documents into encrypted index files show before performing any search no leakage for while updated operations.

due to strong security in this context security against Choosen-keyword attacks(CK-A2). There is competently external memory.

To encrypted KRB-trees it depends upon simple logic and effects primitives like pseudorandom function and permutations. The resulting scheme os CKA-2 protected the same efficiency an unencrypted KRB-tree.

We have designed by the idea of KRB-tree new method of multi-map data structure. There is different colour maps, we can select “red colour” to mark selected area. In KRB-based parallel and dynamic SSE constructions.

Let F=(fi1,…….,fin) to be set of documents and w=(w1,…,wM) as set of keywords .

We used followed steps in cryptographics primitives:

A pseudo-random function G:0,1k ×w1,...,wm→0,1k

Anoter pseudo-random functions P:0,1k×(w1,,……,wm0,1k

A random oracle H:0,1k×0,1.

Fig:krb-tree

RELATED WORK the problem identify the symmetrically encrypted data has been solved

generality on oblivious RAM(ORAM).It required to interaction and high for server and the client.

High involved functionalities like search. It proposed a parallel ORAM system based on binary tree method. Accordingly practical shown it requires O(√n) storage at client. O(√n) .

Table:how its works functions of systems related work

Way keyword search in memory to be performed in O(rlogn) , time and

O(r p log n) as schemes given in tables as per sequence.

2.Preliminaries:

IM-DSSE FRAMEWORK: It contain various types schemes depends upon “Indcidence Matrix”(IM) data structure. We can offer constructions of main scheme in “IM-DSSE”. Framework symbolized as IM-DSSE main. It contains several extension derived from IM-DSSE

main scheme IM-DSSE also supported next sections.

1st started with “notations and data structure”

Cryptographic primitives Searchable Symmetric Encryptions IM-DSSE𝗆𝖺𝗂𝗇Algorithms

a)Notations and data structure:

In notations and data structures operations contain the || and |x| represented it. And bit word size consists the length of variable x, 𝑥$ ←S symbolized variable x randomly and uniformly selected from set of S.(x1,…..xn)S represented as (x1,S,….,XnS ).|x| represented the size of x. as per matrix I,I[I,j] signifies the cell indexing at row ‘I’ and column j’. I[*,I] and I[j,*] signifies accessing the columns j and I-row of matrix I,.I[*,……a,….,b] denotes columns from a to b of matrix I, u[i] denotes accessing the I’ th component of vector U.

It means an IND-CPA encrypting organization scheme as a triplet E=(gen,enc,Dec);k E =(gen,enc,Dec);K E,Gen(Ik).

K contains security parameter & k is key; cE.enck(m,u) takes a input secret key k, counter ‘u’ and message M and returned to ciphertext c,ME.Deck(c,U), counter u and returns M. If k & u were the key & counter under c produced. Functions G is keyed Pseudo Random function (PRF), by tGk(x),takes input a secret key K0,1 & string x & returns a token/key r, to denote H:0,1)0,1) a Random Oracle(RO) to takes an input x and returns a bit.

IM-DSSE Data Structures: Our encoded directory an “Incidence Matrix” I. which I[I,j],vE 0,1 stores the (encrypted) connection between keywords indexing at row I &files are indexing at column and I[I,j].st E 0,1 stores a bit indicating the states of I[I,j].v. Mainly I[I,j].st is set to 1 or 0 if I[I,j].v access to updated or search a bit indicating the state of I[I,j].v. simplicity often to write I[I,j] to represent I[I,j].v and explicit about the state bit as I[I,j].st.

For encrypted index I is augmented by 2-static hash tables tw and Tf will be associate a keyword & file to a uniques row & column. Especially Tf is a file static hash table key-value pair(sid,<yj,uj>) sid Gk2(idj)for file with identifier idf, column index yj E 1,…..,n equivalent to the index if sid in Tw & uj is counter value.it can denote access operations by yJ

Tf (sidj) & uj Tf[yj].ct Tw is a keyword static hash table whose key-word values pair is swi,<xi,Ui>, where to token swi Gk2(wi) for keyword wi, row index xi E 1,….,M equal to index of swi, in tw &

ui is counter value. To access the operations by Xi Tw(Xi) and ui Tw[xi].ct. All counter values are incremental and initially set to 1. So client information in form of Tw & Tf offers on average O(1) look-up time

B)Cryptographic primitives:

In cryptographic primitives contains a private key converted from public key has generated. In process contains three polynomial-time algorithms SK=(Gen,Enc,Dec) then Gen is probabilistic algorithm takes a input a security parameters ᴧ & returns a secret key Ka, Enc is probabilistic algorithm takes input key Ks and ciphertext c and Dec is a algorithm that takes as input a key ciphertext c and returns m if ks key was under ciphertext has been encrypted system in CPA-secure for any probabilistic polynomial time and adeversary A, has exist a negligible functions equations is

Pr[privKa,s(ᴧ)=1≤ 1/2 +neg(ᴧ) for employ structures is Pseudo-random functions(PRF) is also used polynomial-time quantifiable functions. PRF can’t be Illustrious from random functions by any probabilistic from random roles by any probabilistic polynomial-time opponent. A hash functions contains a pair of probabilistic polynomial-time algorithms (Gen,H) in Gen is probabilistic process takes as input a security parameter 1n & output of a key ‘s’. then we can

assume that 1n is included in ‘s’. if to be exist a polynomial T. such as H is polynomial time algorithm takes as input a key s & any string x E0,1* , & output a string Hs(x) E0,1l(n) .then it’s not much more difficult to see the random oracle like a hash functions. To success a probability of any polynomial-time adversary ‘A’ for following game is negligible:

To random purpose H is select A succeds if it show the outputs x,x’

with formations of H(x)=H(x’) x≠x’.

c) Searchable Symmetric encryption: while client allows to generates the keys for send the encrypt data. Later it can be generated search queries in storage server queries. After submit submitted once generated keys has been to search over the translated data and return to fitting encrypted files. Once we generated the one alternate keys it should not generated the keys for security purposed.

DEFINITIONS: In Dynamic CKA-security settings are followed independent of index to client queries are better than previous results. To explain briefly let SSe=(Gen,Enc,srch Token,AddToken,DelToken,search,Add,del,Dec)it based on dynamic index based in SSE-structures

for convent as features are add. For consider the following steps are probabilistic, where A is stateful adversary S is a report adversary S is a stateful simulator & L1,L2.L3 arem stateful leakage algorithms.

Fig:keywords for indexes structures

RealA(k):if generate a key K, runs Gen(1k). A outputs f & received (ϓ,C) as pre formula (ϓ,C)

EncK(F). They makes different types of polynomial infinite number of adaptive requests(w,f1,f2) &query

q, received from opponent either from hunt a token Ts

1. Like search operations TsSrchTokenk(w)

2. Add token & secret message writing pairs

are(Ta,Cf1) operations is (Ta,Cf1)addtokenk(F1)

Or3. Delete token TdDelTokenk(f2). Atlast A

returns a bit B is output by the experiment final results.

Ideala,s(k): A outputs F. given generates & sends keys a pair (ϓ,x) to A. returns back token for another token there are different and infinite no. of tokens generated in case of add an strange operations for secret-massages. And return back for output at last.

d) IM-DSSE𝗆𝖺𝗂𝗇Algorithms: In this algorithm has been designed by im-DSSE framework(outline) systems of structures consists a following important steps are:

SETUP: while submitting the file are collected from outsource F=(fid1,…….fidn).

Admin user will be Extracted all single and original keywords are generated to upload files or downloaded ‘F’.a constructions of relationship b/w user admin keywords and outsources files as secret. Afterwards client access used ot IM-DSSE.Enc algorithms resulting all files C=(cd1,….cdn) received the data index encrypted from cloud server end to end through the file from hash table in MYSQL cmd instructions has seen it.

Search: in search a file keyword. client should searched in a row ‘I’ & column ‘j’ indexes token Tw generates Searches algorithm will be received rw sever decrypts rows and columns of IM-DSSE.Dec algorithm on each secret msg finally we can get the search results.

Updates: to add/delete a files, user admin client can be generated keywords is important due to contains column ‘J’ and encrypted file add via IM-DSSE.delete/ADD(IM-DSSE.delete/ADDresp.) algori. To update in server raises IM-DSSE.delete/ADD the deletes

and add the files in ‘c’.

Fig and table same process for add/deleting algorithm for delete

To follows the arrangement for security in lines for all structures(scheme) followed curious. In server

allows to get some information & final used for without leakage the information while functions.

3.Security Analysis(personal data usages for user admin)

We can examine the security & updated privacy for all DSSE system provided in our IM-DSSE framework.

privacy levels:

The leakage definition and official security model to imply various planes for different DSSE schemes. For important privacy notions based on various leakages characteristics to be discussed in different levels of privacy as per various steps:

Size pattern :There is different types and infinite number of actual keyword-file pairs

Forward privacy: while searching a keyword ‘W’ same keys are not leaks for same identifiers of files matching for future files

Backward privacy: A seach on a keywords ‘w’ does not leaks information past or previous or ancient updates operations are add/deletes files having this same keyword for the identifier.

Updated privacy: in updated operations may have different types of constructions depends upon information of client. It has 5-types

main constructions leaks the informations

from level-1 to level-2 follows :

Level-1(L1) during update may be required time may changes leaks

Level-2(L2) leaks from L1 plus to identifiers while file uploads no. keys are add/delet/modify,

Level-3(L3) leaks L2 plus same keywords are identifiers to be added or delete previously and also when/if same keys search before

Level-4(L4) leaks from L3 as form two files are added the same keywords was deleted/added.

Level-5(L5) it will be leaks from all combined and formed as pattern for all everything intersections are made

4.SECURE INDEX SCHEMES(secured keywords created pass to all clients)

To reach correct mutli-keyword as per rank as per searched.we divided the original long documents as per path Dd into multiple sub-paths consists subset

of keywords.

Ti and T, are become a fragment of ith level of index tree T, as shown figure. The queries vector Q is divided same way as Dd. is completed. Let Qi is queries of sub-vectors at ith equal. By the way at last scored for documents as ranked leveled-up in cloud server controls the applicable for sends/received ny security keywords as access permission as per scores depends upon usages of clients. Documents to queries and send to top-level ‘k’ most related documents back to users due to perfect keywords path set given to it. By using the other level-wise secured inner product schemes. The documents index vector Dd I & query vector of Qi are both well and strong protected.

5.Performed Evalutions:

To executed the entire secured system by using coding the python language on cloud server by using any operating systems by using any windows intel core (i3,i5…etc) and and also using linux os and cell-phones which is connect to internet server

in cloud server storage memory.

Fig:the potential speedup of IM-DSSE framework on mobile(cell-phone) and

windows RAM-storage with (a,b) fast & moderate networks.

Impact of network quality:high speed of of network not be widely available practice.to perform when network quality is dishonored.to set-up server can located the place of geographically distant from client machine network speed will be 67.5 & 46mbps. Impact it will be network latency is clearly to update operations are shown. If network is slower to delay gap may be reflected as upload or downloaded delayed is main problem to suffered in our system Fig: graphs difference size of graphs of documents

a)Different number of level are used for projected the keywords resides.

b) It can be changed number of keywords are interest in one level.

It can be generated the encrypted query of time cost contains documents and keywords used can be evaluations has been selected by random created the sets of documents contained it:

1.Precision and privacy :To Search efficiency with same 10-keywords for different size papers set with same

dictionary, n=4000,k=10. For different number of recovered documents with same and dictionary m=1000,n=4000. Its has large is tunable searched parameter at discretions of user. The selections of reflects to he/his for preference to better use of search arrangement or better protected rank privacy and keyword privacy.

2.Constructed to index tree: its show the same documents set of constructions

of time index set proportions to difference number of keywords in it. Another side in view of huge storage capacity & contains low storage cost in cloud practically affordable completely in it.

3.Query generations: in particular time the cost has been fixed by few limitations level has been produce properly by average efficient enough.

4.search efficiency: “In cloud computing searching the data is more resource ful and baseline search. addition we can increased for size of memory by searching data enjoy the increased the size of documents as a set”.we have 2-types to enjoy the same process and close

to constant search time user can request the set files as form of algorithm.

6.Framework of search over outsources encrypted cloud computing:

In cloud computing contains a new design of creativities for structures to security enables the ubiquitous, convenient & on-demand network are access to shared lake of configurations computing properties (networks, server, storage, applications & services)due to national management of elastic incomes to all users to developing X-as-a-Service(Xaas) model are outsources of cloud provider, applications developed & at last-users can be gain benefits.

To address the constructions efficient and flexible encrypted search roles , results ranking ,multi-keywords queries & search results grade functionalities to build search index founded in vectors space perfect related information search in algorithm designed as process as a privacy sets the algorithm. For against delicate information leakage to meet more strict privacy requirement under

strongest threat model known as background

prototypical

Fig :framework to search over outsources encrypted by

cloud data

Final point of efficiency of future schemes through wide-ranging experimental valuation.

Our aids are summarized to following steps are:

By information has an idea to privacy-preservative for multi-keyword script search for supporting & result search for accuracy as current as per existing state-of-art by multi-user keyword searched for allover plaintext .

There is different types of leakages information as sensitive frequency to achieved for better security of keywords. We have different types methods are user balance b/w search exactness & privacy.

With guarantee security has improves. Additionally index buildings methods are investigations has been speed-up for search at common belongings.

7.Literature Survey

In cloud computing used the incomes through software and hardware are delivered to use the service all over internet. The use of cloud computing-shaped by complexed infrastructures in shown figure. It can be access by users controlled the distant of cloud computing through software.

The cloud maintain platform and applications can run the python languages coding. Cloud users admin can be access the web-applications based upon the “web-browser & mobile application. we can located the address of data stored from the servers cloud computing allows all organizations to get applications & running faster to enchanced

running and less maintenance. It can be allow to IT-professional to adjust the resources to meet shifting & random business demand. In cloud computing architectures identify the issues of security control and administration.

We control and recovered weakness in system and reduces the effects from an attackers.

Some technical issues are given below to improve security from data loss:

A. ENCRYPTIONB. DATA LEAKAGE

A.ENCRYPTION:

In algorithms mathematical using the form of encodes secret-text into unreadable form unless cryptographic key is applied to converted. Encryptions gives the data as security and integrity. In this method has 2-major categories there are 1.symmetric and asymmetric techniques. Same keys are used for encryptions and decryptions. Insymmetric encryptions sender & receiver used to share key to encrypt or decrypt the data. Asymmetric keys will be encrypted a plain text. Here itself two keys are available ‘one of key has private key’ and another key has public. Here itself public key has converted into one private key. It keep files private and secret to owner users.

Fig: A.ENCRYPTION(fclient has requested for data for search has generated key

tokens)

B.DATA LEAKAGE:

In data leakage mean to transfer the information from secret stored inside the system of organization to an external desinations. The data leakage include loss of data or destruction of information due to hardware failures. The data leakages have done for internal user more potential to loss. To reduces or qualifications data leakage incidents for financial, business reasons & organizations may be obliged follow to various regulatory may be obliged to adhere for various regulatory requirements enforcing the preventions of data leakage.

To data loss preventions(DLP) systems help end users do not send sensitives or critical information has sended to outside of corporate network. The critical security controls data loss preventions(DLP) refers for covering people, processing & systems for all identifiers,monitor and to protect ddata in use, data in wave & data at rest through deep content inspection with a centralized to management framework .Data domination information in movement, and information at rest via deep content inspection and with a centralized management framework. records governance, risk assessment, regulatory and

privateness compliance, facts or facts classification, policies, standards, procedures, records discovery, remediation strategies and training and attention are all elements are applied with the aid of organization to powerful put in force of records leakage. the final aim to prevent data leakage is to stop sensitive information from leaving to unauthorized organization. e-mail, on the spot messaging, social media, document switch, web pages, mobile garage gadgets and difficult copies are not unusual vector for data leakage. to successfully prevent the information from leaving the enterprise to enforce their rules, it wishes to deploy DLP answers. DLP answers mounted on a user laptop can for block users from moving documents out of the control of the organization. the relaxation of this paper is prepared as follows. segment ii explains the associated researches in short. phase iii affords the info of complete system structure is executed. segment iv affords the experimental consequences and their discussions. phase v concludes the studies work.

Related work

To mentioned about hierarchical clustering method is proposed to assist more search semantics and

additionally to meet the demand for immediate cipher-textual content search inside a massive records environment. the proposed hierarchical

approach clusters the files based totally at the minimum relevance threshold, after which partitions the resulting clusters into sub-clusters till the constraint at the maximum length of cluster is reached. the test result proves that the proposed structure not handiest properly solves the multi-keyword ranked search trouble, but additionally brings an improvement in search efficiency, rank security, and the relevance between retrieved files.

System architecture

The facts proprietor has series of documents and outsources the records to the cloud server in encrypted form. in proposed scheme, statistics proprietors construct the search tree index for file series and encrypt the non-public report. the facts proprietor securely sends the encrypted document to the cloud server, after which securely distributes the key to the trapdoor technology after which decrypt the data by means of authorized facts customers.

The data customers are authorized one to access the facts owner report. the question keywords, legal consumer can generate from trapdoor consistent with seek manipulate (sc) mechanisms and fetch encrypted file from cloud server. the facts person can decrypt the statistics with the secret key send by using facts owner.

The cloud server shops the collection of encrypt document and seek tree index for statistics owner. obtain trapdoor from the records consumer, the cloud server execute search over the index tree and go back the gathering of top-okay ranked encrypted file. the cloud server is employ with the aid of lot of works on relaxed cloud facts search. the cloud server executes the query based totally on training of the designed protocol. meanwhile, cloud server evaluation obtained data, which help to collect extra facts

fig: System Architecture

In cloud server owners all data translated documents and searched tree index are stored in it. To get hold of trapdoor from the data consumer, the

cloud server execute search over the index tree and return the collection of top-ok ranked encrypted document. the cloud server is rent via lot of works on comfortable cloud facts seek. the cloud server executes the question primarily based on preparation of the designed protocol. In the meantime, cloud server analysis obtained statistics, which assist to gather extra information.

A. AES ALGORITHM

AES- Advanced encryptions standard(AES) is also contains another name is “Rijndael algorithm”. In AES has stopped by cipher security future and replace the DES for profitable applications. It used the 128-bits size and key size is 128-kb,192 or 256 bits as per different sizes but low sizes only. Compared public key for RSA & structures of AES, very protested easily and similar to algorithms.

There is 2-types of different types of main things following steps are:

1st kind of symmetric encryptions has only only public keys(shared keys secretly) due to unlock the data when shared to access it. In Asymmetric encryption splits into two keys.one made for public keys and private keys

private key used for decrypt messages. AES encryption process of converting to

plain text into readable can’t due to cipher text secrets.Series of mathematical operations are applied iteratively to get cipher text. The decryption of the information which is executed through inverting all search manage (trapdoor) the encryption operations with the same key underneath aes symmetric encryption popular. inside the decryption process the series of the differences differs from that of the encryption but the key expansion for encryption and decryption.

B)PRIVATE INFORMATION RETRIEVAL

A Private Information Retrieval(PIR) is also allowed user to recover an item from server database without see-through which item is saved. one trivial, but very inefficient manner to obtain pir is for the server to ship a whole copy of the database to the consumer. pir may be accomplished with consistent communique and k-database. ostrovsky scheme lets in a consumer to retrieve documents of interest from an untrusted server with out leaking any

statistics.

Fig:working process of saved file recovery in

server room

Resulting:

Finally resulting has been executed by programing languages web-applications form as used as per performance we can see

Fig:- web applications are use through it only saved data

username and password .

Many steps are used to performance at different levels there are Following steps are :-

A)Encryptions Performance:

Now a days are main applications are used the Advanced Encryptions Standard(AES). Its six times better and faster than the DES.A to replaced the different types of key sizes. With increases of computing power has careful defenseless against thorough key searched attacks.

Table : encryptions performance

File count Existing system(DES)

Proposed system (AES)

15 files 25-milli sec 33-milli sec

100 files 70-milli sec 58 milli sec

1000files 990-milli sec 770 milli sec

100000 files

1500 milli sec 20000 milli sec

B.Storage consumptions: In cloud computing space allocations takes size of uploading file storage of memory. To reduced size of file can be

compressed before upload the file size decreases and more files are upload to store is useful .

Fig: Storage Consumptions

Table data storage

File count

Time taken existing

Time taken to proposed system

10 files 85% 7010 files 90 7510 85 65

C.Data Leakage

Data leakeage has different types of leaks the information of data are accident or planned distributions of private data or sensitive data by using unauthorized user. Ostrovosky method is used for identifiers the

data leakages in proposed system. “if user are can’t download the files of data without getting the permissions from data owner.

“In this proposed system can detect the unauthorized user or hacked accessing the system by using different types of shcemes. At last no methods are used to find leakage”

At last a main thing is used the data user authentications protocols to avoid the data leakage.

Tables: Data leakages

File count Data download

Leakage detections levels

15 files 100% 30%100 100% 251000 100% 201-lakhs 100% 10%

Fig: data leakage

D.Searching Time

The semantic search extra clever in multi-key-word ranked seek over cloud searching time of the file extensively reduced. it reduces looking timing and gives extra correct (semantic) output than current technique. affiliation rule is used to in shape the keyword as a great deal as feasible seek. present method has taken 2000 ms(milli seconds) to go looking 10 mb file. however the proposed approach takes 1380 milliseconds to look 10 mb report

Table: Searching Time

File type (each file size 10m)

Time taken exist system (Bdrms scheme)

Time taken by proposed system(content aware dearching scheme)

Video file 1390ms 1080ms

Audio 1110ms 1080ms

Image file 1390ms 1080ms

Document file

1390ms 1080ms

Conclusions:

To proposed the systems to allows authenticated data users to achieved the secured, convenient and efficient searches over multiple data owners. Finally we can detect the hacker easily stoles the particular data. In future we can design query of keywords have to be enhancement the system & to introduce to search for protocol design the weight of keywords.

Acknowledgments

I can also see or have get entry to to documents, records, or data that consist of personal and sensitive records. i remember that this records can be exclusive and sensitive by way of virtue of the nation personnel record privateness law (g.s. 126-22 et seq.), the own family educational rights and privateness act (ferpa - 20 americac. 1232g), federal privacy act provisions governing social security numbers, the fitness coverage portability and responsibility act (hipaa), the gramm-leach-bliley act, the north Carolina kingdom identification robbery act (sb 1048), different applicable country and federal laws, and nc state records security guidelines and guidelines.under those privacy laws, i might not reveal records about university personnel, university college students, or any in my opinion identifiable economic, health or medical facts, or laptop passwords and user ids or account names, unless i am positive that a provision of the law lets in disclosure in particular situations. this is applicable whether the statistics is in paper, digital, or other layout or media. In regard to student data, i understand i might also access student records best as required in appearing my assigned obligations. but, the following data in a student's facts, unless explicitly suppressed by way of the "privateness block-out flag", is "public" and can be disclosed:

Name(s) E-mail/University address(es) Date and place of birth Telephone number(s) Major field of study

Weight and height of members of athletic teams

different facts from personnel records is non-public besides where there's statutory authority to release it.

REFERENCE

1) R.V.V Murali Krishna and Ch. Satyananda Reddy, “Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” in Proc. 8th ACM SIGSAC Symp. Inf., Comput. Commun. Secur.

2) Ning Cao, Cong Wang[2014], “PrivacyPreserving Multi-keyword Ranked Search over Encrypted Cloud Data” in Proc. Of EDBT, 2014.

3) Leonard Adleman. Two theorems on random polynomial time. In Symposium on Foundations of Computer Science (FOCS ’78), pages 75–83. IEEE Computer Society, 1978.

4) A. Adya, M. Castro, R. Chaiken, J. Douceur, J. Howell, and J. Lorch. Federated, available and reliable storage for an incompletely trusted environment (Farsite), 2002

5) CipherCloud, “Cloud data encryption”, URL: http://www.ciphercloud.com/technologies/encryption/.

6) Y.Zhang,J.Katz,andC.Papamanthou.Allyourqueriesarebelongtous:Thepoweroffile-injectionattacks onsearchableencryption. In25th USENIX Security ’16,pages707–720,Austin,TX,2016.

7) G. K. Zipf. Psycho-Biology of Languages. Houghton-Mi in, Boston, 1935.ffl

8) E. Stefanov, E. Shi, and D. Song. Towards practical oblivious ram. In Network and Distributed System Security Symposium (NDSS), 2012.

9) Y.-C. Chang and M. Mitzenmacher, “Privacy Preserving Keyword Searches on Isolated Encrypted Data,” Proc. Third Int’l Conf. Applied Cryptography and Network Security, 2005.

10) NIST. NIST’s dictionary of algorithms and data structures: inverted index. http://xlinux.nist.gov/ dads/HTML/invertedIndex.html.

11) M. Ondreiˇcka and J. Pokorn´y. Extending fagin’s algorithm for more users based on multidimensional b-tree. In Proc. of ADBIS, pages 199–214, 2008.

12) O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In STOC.