Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage-IEEE PROJECT 2015-2016

1,199 views

Published on

MICANS INFOTECH offers Projects in CSE ,IT, EEE, ECE, MECH , MCA. MPHILL , BSC, in various domains JAVA

,PHP, DOT NET , ANDROID , MATLAB , NS2 , EMBEDDED , VLSI , APPLICATION PROJECTS , IEEE

PROJECTS.

CALL : +91 90036 28940 +91 94435 11725

MICANSINFOTECH@GMAIL.COM


WWW.MICANSINFOTECH.COM
COMPANY PROJECTS,
INTERNSHIP TRAINING,
MECHANICAL PROJECTS,
ANSYS PROJECTS,
CAD PROJECTS,
CAE PROJECTS,
DESIGN PROJECTS,
CIVIL PROJECTS,
IEEE MCA PROJECTS,
IEEE M.TECH PROJECTS,
IEEE PROJECTS,
IEEE PROJECTS IN PONDY,
IEEE PROJECTS,
EMBEDDED PROJECTS,
ECE PROJECTS PONDICHERRY,
DIPLOMA PROJECTS,
FABRICATION PROJECTS,
IEEE PROJECTS CSE,
IEEE PROJECTS CHENNAI,
IEEE PROJECTS CUDDALORE,
IEEEPROJECTSINPONDICHERRY,
PROJECTDEVELOPMENTCENTRE

Published in: Engineering
  • Be the first to comment

  • Be the first to like this

Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage-IEEE PROJECT 2015-2016

  1. 1. miccansinfotech +91 90036 28940 +91 94435 11725 ' 'l'—I‘-Ii: -1‘ 3-3:1-I-III-111-i-—-1-I | =l= l; r"nn=4-1 -I-. w-. il-1,-iui-. m I-1 'lIll'l'-lI~‘lWl= «l~‘——= l-lilo}-1-‘ li‘l! ll: . IL‘! -, III-, All-"lI: I‘l! l:, -.111-‘J-'. 'l_: l_= l_Ilj-Ii‘. 9:4.-I-u -I-—w-it-1,-I-umlutIr. 'l: Hui 0|! ‘ iT“, ":(”l, " ": l’- 1'17.-XII, -:l, =‘ Bl-‘L Bl-1‘ 'l! ~‘ll . 'LlIlII, |'-'1|1"i. 1:li‘lt‘| Ell~ i'ill I: (|1li‘lI1‘| ,' §1'i| §l,1!l. 'l! .' I(IIl; lflIIl'I~‘- "Il, l'l:7£lt‘| l Tell ml: .': HI: (f-li‘Il’f-‘. WI: l=lI, =i~"l-‘~i‘l= tIWel: l:, Il. 'Ii‘I: ' Bli'iIi‘l, =II M-1:1 '. ilIIIlI: _-llIIl‘—l-IL‘ : k4-'«-iltznuc l'lll”, 'iTi‘l-'- | :h‘l: uII; (f1:l _IllIl'HIl= l~‘ I, =l.1.= 1'- -i. -1,-in-rcm-1-. .sinnzi-I-in-in '1~13.I'. ._1Z3.il13.i'iIiI? Z:l. '2mIL. i'ilf': ,.m. .l; ('2:L. i'i. .r': Il! ll, .i'iI;1:, IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED KEY-AGGREGATE SEARCHABLE ENCRYPTIQN (KASE) FOR GROUP DATA SHARING VIA CLOUD STORAGE ABSTRACT: The capability of selectively sharing encrypted data with different users via public cloud storage may greatly ease security concerns over inadvertent data leaks in the cloud. A key challenge to designing such encryption schemes lies in the efficient management of encryption keys. The desired flexibility of sharing any group of selected documents with any group of users demands different encryption keys to be used for different documents. However, this also implies the necessity of securely distributing to users a large number of keys for both encryption and search, and those users will have to securely store the received keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search miccmsinfotech, NO:8.100 FEET ROAD. PONDlCHERRY. WNW. M|CAN S| NFOTECH. COM ; MICANSlNFOTECH@GMAlL. COM +91 90036 28940; +91 94435 11725
  2. 2. miccansinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—e= nL~ cl‘ 9Z(I('-J| l'—JIl-('—<~'1Iw I11; l"nn=4-i -‘I-. w:H-1,-In-I= m 1-) | IIll'l'-lI»*lWl'~J~‘——= l-tio}-1* ll‘l! l7:. IL7‘, II: -, : Il: 'II: M!V: , -. m-‘I-‘ll-'L= I,= I,| l,= Il‘. 9:4.-I-u -I-—w-—: I-1,-I-maulI: .'l: . !1"l all : h‘l! l:(Il| !‘ "H5 l'l7:IL-Ll? ‘ N-‘ll N-'2‘ 'l! ~‘ll . '2,luIl, I'-'1|l'l. 1:h‘ll‘l, =I: ~ Ml Z: (I1wIt‘I, | . =h'l| ,=l1Il, |l§1! : (H;1aIIl'I: l t'll, l’I:7:h‘| ( ', -.1! t'll,1.':7:I: (:-h‘Il'f: . w| :t: I_= t~s: ..aI: uwem: . -1.-ml! ’ IImIl‘I, =ir emu '. i,lIIIII: _IllIIl‘-ML‘ : ?,4-'«-m= m1»- l'AI[’, 'i‘N~'~ | :h‘| :uII; (f1:l _t)lu'Il-l= I~‘ I11? 1* -I. -I. -In-r-. m-n. ni-Il= t-u-In-I-1 ’I~‘I5.IL. ,l Z. 's. ,=I4,‘a. l'll, =I»'Z‘-‘L. '2|VAlL. l'll?7:. .l'l. .l; ('2:L. l'l. .?': |I! lL, .t'A| ;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED over the shared data. The implied need for secure communication, storage, and complexity clearly renders the approach impractical. In this paper, we address this practical problem, which is largely neglected in the literature, by proposing the novel concept of key—aggregate searchable encryption (KASE) and instantiating the concept through a concrete KASE scheme, in which a data owner only needs to distribute a single key to a user for sharing a large number of documents, and the user only needs to submit a single, trapdoor to the cloud for querying the shared documents. The security analysis and performance evaluation both confirm that our proposed schemes are provably secure and practically efficient. EXISTING SYSTEM: The convenience of sharing data via cloud storage, users are also increasingly concerned about inadvertent data leaks in the cloud. Such data leaks, caused by a malicious adversary or a misbehaving cloud operator, can usually lead miccmsinfotech, NO:8.100 FEET ROAD. PONDlCHERRY. WWW. M|CAN S| NFOTECH. COM ; M| CANS| NFOTECH@GMAlL. COM +91 90036 28940; +91 94435 11725
  3. 3. miccansinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—e= nL~ -I‘ 2-3:1-I-4|! -ant-i-—e~'i-« | =I= I; "i0II= «lII -‘I-. w:ll-1,-in-I= m I-i | lIIl'l'-IKIIIIJ-‘——= l-tio}-1~‘ li‘l! ll: . IL7‘, II: -, . ‘l| I-"lI: Ié1!I3, -. m-‘I-‘ll-'L= l.= l.| l,= li‘. 9:4.-I-u -I-—w-—: I-1,-I-maulI: .'l: . ! I"l all iT“, ":(. II, " ": lv'A i'l7:Il, -Ll? ‘ DI-‘ll k‘I~*‘ 'l! ~‘ll . '2.luIl, I'-'1li'l. 1:h‘li‘l, =l: ~ Ml Z: (IWlIi‘I, | . =Ii'l| ,=l1Il, |l. =1! : (0l;1aIIl'I: T i'il, l’I:7:li‘| t ', -Jl i'il,1.':7:I: (:-h‘Il'f: . WI: I=1I, =l~‘l: ~i‘l: tIWIl: l:. -1.-ml! ’ IIl'lIi‘I, =ir emu '. i,lIIIlI: _-in-It-.1-tr : ?,4-'«-llhamc I'lII’, 'iI‘I-'9 | :h‘| :uII; (f1:l _IllIl'IlII= l~‘ I, =l1=l'v -I. -I. -III-r-. m-n. pit-Il= i-I-In-I-1 ’I~‘l5.IL. ,l Z. 's. ,=I4,‘a. l'll, =I»'Z‘-‘I. '2|VAlL. l'll?7:. .l'l. .l; ('2:L. l'l. .?': |I! lL. .l'l| ;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED to serious breaches of personal privacy or business secrets (eg, the recent high profile incident of celebrity photos being leaked in iCloud). To address users’ concerns over potential data leaks in cloud storage, a common approach is for the data owner to encrypt all the data before uploading them to the cloud, such that later the encrypted data may be retrieved and decrypted by those who have the decryption keys. Such cloud storage is often called the cryptographic cloud storage. The encryption of data makes it challenging for users to search and then selectively retrieve only the data containing given keywords. First of all, the need for selectively sharing encrypted data with different users (e. g., sharing a photo with certain friends in a social network application, or sharing a business document with certain colleagues on a cloud drive) usually demands different encryption keys to be used for different files. However, this implies the number of keys that need to be distributed to users, both for them to miccmsinfotech, NO:8.100 FEET ROAD. PONDlCHERRY. WWW. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  4. 4. miccmsinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—I= nL~ -I‘ 2-3:1-I-4|! -—m-I-—~T-« I11; "i0II= «lII iI: I'l: IIII,0lIII'-«III I-i 'lIIl'l'-lI~‘IIII'~I~‘——= l-Into)-1? lI‘I! Il: . IL7‘, II: -, . ‘l| I-"lI: Ié1!I3, -. m-‘I-‘'I'L= I.= I.| l,= Ii‘. ‘ 9:4.-I-u -I-—w-—II-I, -I-ImhrI: .'l: . ! I"l GL1‘ iT“, ":(. II, " ": I?- i'I7:ll, -Ll? ‘ DI-‘ll Bl-1‘ 'l! ~‘ll . '2.luII, I'-'1Ii'I. 1:h‘li‘I, =I: ~ Ml 2:(IWIIi‘I, | .1i'I| ,=I,1,Il, |l.1,| :(9I; IaIII'I~‘T i'il,1’I:7:li‘| r ', -Jl i'Il,1.': r:I: (:-h‘II'f: . mII: I=1I; t~'1:~i‘I: tIwcI: I:. -1.-ma’ sIl'lIi‘I,1r ‘ emu '. i,lIIIlI: _-IlIIl‘—I-I4-‘ : k4-'«-Ilhamc I'III', 'iT‘I: ‘ | :h‘| :uII; (f1:l _IllII'HII= I~‘ I11? 1* -I. -I. -III-r-. m-n. pit-Il= i-I-In-I-I ’I~‘I5.I'. ._1Z3.113.l'lliIiZ: l.'2|VIlL. l'll? ':. .l'l. .l1'2:L. l'I. .r': |I! lL. .l'lI;7:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED search over the encrypted files and to decrypt the files, will be proportional to the number of such files. Such a large number of keys mustnot only be distributed to users via secure channels, but also be securely stored and managed by the users in their devices. In addition, a large number of trapdoors must be generated by users and submitted to the cloud in order to perform a keyword search over many files. The implied need for secure communication, storage, and computational complexity may render such a system inefficient and impractical. DISADVANTAGES: i. This implied need for secure communication, storage, and computational complexity may render such a system inefficient and impractical. ii. A large number of trapdoors must be generated by users and submitted to the cloud in order to perform a keyword search over many files. miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNlN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  5. 5. miccmsinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—e= nL~ -I‘ ; t:(-I-4|! -—m-I-—~T-« I11; "i0II= «lII -‘I-. w:Il-I, -luum I-i 'lIII'l'-lI~‘IIII'~I~‘——= l-Into)-1? lI‘I! II: . IL7‘, II: -, . ‘l| I-"lliléllll, -. m-‘I-‘'I'I; I;I. |l; Ii‘. 9:4.-I-u -I-—w-—II-I, -I-ImhrI: .'l: . ! I"l GL1‘ iTk‘I, 'III. II, " ": I?- i'l7:Il, -Ll; DI-‘ll Bl-1‘ 'l! ~‘ll . '2.luII, I'-'1Ii'I. 1:h‘li‘I; I:~ Ml 2:(IWIIi‘I, | ; Ii'I| ,=I,1,Il, |l.1,| :(BI; IaIII'I~‘r i'il,1’I:7:li‘| r ', -Jl I'II,1.': r:I: (:-h‘II'f: . mII: I=1Il,1~‘l: ~i‘I: tIwcI: I:. -1.-ma’ sIl'lIi‘I,1r emu '. i,lIIIlI: _IIlIII‘-I-IL‘ : k4-'«-IIt= m1»- I'III', 'iI‘I: ‘ | :h‘| :uII; (f1:l _IllII'lIII= I~‘ I11; 1* -I. -I. -III-r-. m-n. pit-Il= i-I-In-t-I ’I~‘I5.I'. .,1Z3.; I13.l'll; IiZ: l.'2IVIlL. l'll?7:. .l'l. .l1'2:L. l'I. .r': |I! lL. .l'lI;7:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED PROPOSED SYSTEM: In proposed system, the novel concept of key-aggregate searchable encryption (KASE), and instantiating the concept through a concrete KASE scheme. The proposed KASE scheme applies to any cloud storage that supports the search—able group data sharing functionality, which means any user may selectively share a group of selected files with. a group of selected users, while allowing the latter to perform keyword search over the former. To support searchable group data sharing the main requirements for efficient key management are twofold. First, a data owner only needs to distribute a single aggregate key (instead of a group of keys) to a user for sharing any number of . files. Second, the user only needs to submit a single aggregate trapdoor (instead of a group of trapdoors) to the cloud for performing keyword search over any number of shared files. To the best of our knowledge, the miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNlN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  6. 6. micansinfotech +91 90036 23940 +91 94435 11725 ‘r 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , NS2 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, N Projects 100% WORK| N:CODE + DOCUMENTAT| ON+ EXPLAINATION — LOW PRICE GUARANTEED KASE scheme proposed in this paper is the first known s e both requirements. ADVANTAGES: i. Both functional and security requ' designing a valid KASE scheme. ii. The efficiency of the sch lish its security through detailed analysis. MODULES: i. Key-aggre on for Data Sharing. A oncret up Data Sharing System. of the Group Data Sharing System mlcunsinfotech, NO: 3 , 100 FEET ROAD, PONDlCHERRY. WWWMICANSIN FOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725
  7. 7. miccansinfotech +91 90036 28940 +91 94435 11725 ' 'l'—I‘-Ii: -I‘ ; t:(-I-4|! -—m-I-—-«Tn I11; 7‘i0II= «lII -I-. w:Il-I, -lun-. m I-i II-Ii'I-—iwItII-.4-urn-I-lm- lI‘I! II: . ILY‘, III-, All-"lI: I‘I! I:, -. ul-‘. '-'I'I; I;I_Il; Ii‘. 9:4.-I-u -I-—w-—II-I, -I-metalIr. 'l: . um GL1‘ iT“, 'III'II, " ": I?- i'I7:ll, -Ll; DI-‘ll Bl-1‘ 'l! ~‘ll . 'LlIIII, |'-'1Ii"I. 1:Ii‘Ii‘IEIl~ 'lIl I: (|lll‘IIi‘| ,' §t'AI§I1|I! l!. ' I(5l; lflIII'I~‘i "lI, l'i:7£It‘Il Tell i'II,1.':7:I: (i= II‘Il’f~‘. WI: I1I; I~"l-‘~i‘I= tIWeI: I:, Il. 'li‘l1' 5Il'lIl‘l,1l emu '. i,lIIIlI: _IIlIII‘-I-I4-' : k4-'«-III= m1»- l'III’, 'iII‘I-" | :h‘I: uII; (f1:l _IllII'lI-I= I~‘ I11; 1* -I. -I. -lit-r-. m-n. pit-Ilzi-I-In-t-I ’I~‘I3.I'. ._1Z3.; I13.l'll; IiZ: l.'2IVIIL. l'll? ':. .l'l. .l; ('2:I. l'l. .r': II! IL, .l'lI;7:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED KEY-AGGREGATE ENCRYPTION FOR DATA SHARING: Data sharing systems based on cloud storage have attracted much attention. Consider how to reduce the number of distributed data encryption keys. To share several documents with different encryption keys with the same user, the data owner will need to distribute all such keys to him/ her in a traditional approach which is usually impractical. Aiming at this challenge, a key-aggregate Encryption (KAE) scheme for data sharing is proposed to generate an aggregate key for the user to decrypt all the documents. To allow a set of documents encrypted by different keys to be decrypted with a single aggregate key, user could encrypt a message not only under a public- key, but also underthe identifier of each document. The construction is inspired by miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNlN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  8. 8. miccansinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—I= nL~ -I‘ ; t:(-t: I|I: anx-I-mi-« I11; "i0II= «lII -‘I-. w:Il-I, -luum I-i 'lIII'l'-I$. ‘IIII'~I~‘——= I-Ila)-1-‘ lI‘I! II: . IL7‘, II: -, . ‘l| I-"lliléllll, -. m-‘I-‘'I'I; I;I. |l; Ii‘. 9:4.-I-u -I-—w-—II-1,-I-ImhrI: .'l: . ! l"l GL1‘ iTk‘I, 'III. II, " ": Iv'A i'l7:Il, -Ll; DI-‘ll k‘I~*‘ 'l! ~‘ll . '2.luII, I'-'1Ii'I. 1:In‘li‘I; I:~ Ml Z: (IWIIi‘I, | ; Ii'I| ,=I,1,Il, |l.1! : (0I; laIII'I~‘r i'il,1’I:7:Ii‘| t ‘LII I'II,1.': r:I: (:-h‘II'f: . IIIIIII: I,**‘-<l‘| =|IIIl'I: I:. -1.-mI; I' IIl'lII‘I,1r emu '. i,lIIIlI: _-IlIII‘—I0l4-‘ : ?,4-'«-Ilhamc I'III', 'iI‘I: ‘ | :h‘| :uII; (f1:l _IllIl'IItI= I~‘ I11; 1* -I. -I. -III-r-. m-n. pit-Il= i-I-In-t-I ’I~‘I5.IL. ,l Z3.; I1,‘a. l'll; IiZ‘-‘I. '2IVIlL. l'll?7:. .l'l. .l; ('2:L. l'I. .?': |I! IL. .l'lI;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED the broadcast encryption scheme. In this construction, the data owner can be regarded as the broadcaster, who has public key and master—secret key each document with identifier can be regarded as a receiver listening to the broadcast channel, and a public information used in decryption is designed to be relevant to both the owner’s and the encryption key; the message encryption process is similar to data encryption using symmetric encryption in BE, but the key aggregation and data decryption can be simply regarded as the further mathematical transformation of BE. Encrypt algorithm and BE. Decrypt algorithm respectively. The scheme allows efficiently delegating tlie decryption rights to other users, and is the main inspiration of our study, but it does not support any search over the encrypted data. In the cloud environment, to achieve the goal of privacy—preserving data sharing, keyword search is a necessary requirement. Fortunately, the KAE provides insights miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNIN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  9. 9. micansinfotech +91 90036 23940 +91 94435 11725 ‘r 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , NS2 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, N Projects 100% WORK| N:CODE + DOCUMENTAT| ON+ EXPLAINATION — LOW PRICE GUARANTEED to the design of a KASE scheme, although our scheme will r * . %'p n on, trapdoor in particular show that the mathematical transformation. To support keyword ciph generation and keyword matching. SECURITY ANALYSIS: To analyze the security of our scheme satisfies the security requ‘ assume that the public cloud is “honest-but-curious”. That is, th rver will only provide legitimate services according to pre—defined c emes, though it may try to recover secret information based on i s . We also assume that the authorized users may try to access data it r out of the scopes of their privileges. Moreover, communicatio c Based on abov terms earching and query privacy. olving the public cloud are assumed to be insecure. nsiderations, we will prove the security of our scheme in mlccnsinfotech, NO: 3 , 100 FEET ROAD, PONDlCHERRY. WWW. MICANSINFOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725
  10. 10. miccansinfotech +91 90036 28940 +91 94435 11725 ' 'l'—I‘-Ii: -I‘ ; t:(-I-4|! -—m-I-—-«Tn I11; 7‘i0II= «lII -I-. w:Il-I, -lun-. m I-i 'lIII'l'-II~‘IIII'~I~‘~= I-tio)-1? lI‘I! II: . ILY‘, III-, All-"lI: I‘I! I:, -. ul-‘. '-'I'I; I;I_Il; Ii‘. ‘ 9:4.-I-u -I-—w-—II-1,-I-metalIr. 'l: . um GL1‘ iT“, 'III'II, " ": I?- i'IMll, -Ll; DI-‘ll Bl-1‘ 'l! ~‘ll . 'LlIIII, |'-'1Ii"I. 1:Ii‘Ii‘IEIl~ 'lIl I: (|lll‘IIi‘| ,' §t'AI§I! !I! l!. ' I(5l; lflIII'I~‘i "lI, l'i:7£It‘Il Tell i'II,1.':7:I: (i= II‘Il’f~‘. WI: I1I; I~"l-‘~i‘I= tIWeI: I:, Il. 'li‘l1' 5Il'lIl‘l,1l ‘ emu '. i,lIIIlI: _IIlIII‘-I-I4-' : k4-'«-IIt= m1»- l'III’, 'iII‘I-" | :h‘I: uII; (f1:l _IllII'lI-I= I~‘ I11; 1* -I. -I, -In-rm-n. .nnnzi-I-In-t-I '1~‘I3.I'. ._1Z3.; I1;. .l'll; I?Z: l.'2IVIIL. I'llf': ..m. .I; ('2:I. l'I. .r': Il! IL, .l'lI;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED Theorem 1. The proposed scheme supports controlled searching. Proof: Theorem 1 requires that any user with the aggregate key can perform a keyword search over documents in the set S, but he cannot do it over the documents outside this set. He also cannot generate other aggregate searchable encryption keys for a new set S0 from the known one. A CONCRETE GROUP DATA SKHARING SYSTEM: When constructing a practical group data sharing system, it is important to reduce the number of keys belonging to a user. In this subsection, we will introduce how to build such a system based on the KASE and KAE schemes with the same public parameters. We consider a group data sharing system without using any private cloud, but instead based on widely available public cloud services. Based on such a consideration, we assume a group manager (e. g., the HR miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNlN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  11. 11. miccansinfotech +91 90036 28940 +91 94435 11725 ' ‘I-—I= nL~ -I‘ ; t:(-t: I|I: anx-I-mi-« I11; "i0II= «lII -‘I-. w:Il-I, -luum I-i 'lIIl'l'-I$. ‘IIII'~I~‘——= I-Ila)-1-‘ lI‘I! II: . IL7‘, II: -, . ‘l| I-"lliléllll, -. m-‘I-‘'I'I; I;I. |l; Ii‘. ‘ 9:4.-I-u -I-—w-—II-1,-I-ImhrI: .'l: . ! l"l GL1‘ iTk‘I, 'III. II, " ": Iv'A i'l7:Il, -Ll; DI-‘ll k‘I~*‘ 'l! ~‘ll . '2.luII, I'-'1Ii'I. 1:In‘li‘I; I:~ Ml Z: (IWIIi‘I, | ; Ii'I| ,=I,1,Il, |l.1! : (0I; laIII'I~‘r i'il,1’I:7:Ii‘| t ‘LII I'II,1.': r:I: (:-h‘II'f: . IIIIIII: H,**‘-<l‘| =|IIIl'I: I:. -1.-mI; I' IIl'lII‘I,1r ‘ emu '. i,lIIIlI: _IIlIII‘-IOU-' : ?,4-'«-Ilhamc I'III', 'iI‘I: ‘ | :h‘| :uII; (f1:l _IllIl'IItI= I~‘ I11; 1* -I. -I. -III-r-. m-n. pit-Il= i-I-In-t-I ’I~‘I5.IL. ,l Z3.; I1.‘a. l'll; IiZ‘-‘I. '2IVIlL. l'll?7:. .l'l. .l; ('2:L. l'I. .?': |I! IL. .l'lI;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED director of an organization) with an authorized account to act in the role of “manager” who will be responsible for management-of the system including maintaining the public system parameters stored in the cloud. Data sharing : To share a group of documents with a target member, the owner runs KAE. Extract to generate the aggregate keys, and distributes them to this member, then inserts/ updates a record. Keyword Search: To retrieve the documents containing an expectedkeyword, a member runs KASE. Trapdoor to generate the keyword trapdoor for documents shared by each owner, then submits each trapdoor and the related owner’s identity Owner ID to the cloud. After receiving the request, for each trap—door, the cloud will run KASE. Adjust the trapdoor for each document in the doc ID Set and run KASE. Test to perform keyword search. Then, the cloud will return the encrypted documents which contains the expected keyword to the member. Data retrieving. After receiving miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WlNIN. M|CAN S| NFOTECH. COM ; M| CANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  12. 12. miccansinfotech +91 90036 28940 +91 94435 11725 ‘ 'l'—I‘-Ii: -I‘ ; t:(-I-. I|I-—m-I-.41-T I11; "i0II= «lII -I-. w-4!-I, -inn-. m I-I 'IIII'l'-II~"IIII= «I~‘——= I-Ilo)-1? lI‘I! II: . IE1‘, III-, All-"lI: I‘I! I:, -. |nl-‘J-'1VI'I; I;I_Il; II‘. 9:4.-I-u -I-—w-—II-1,-I-metalrA'l: um GL1‘ iT“, 'III'II, " ": I’- I'I’. “'IIi‘, :‘ DI-‘ll k‘I~*‘ VI! -‘ll . 5!IIII, |'-'1Ii'I. 1:Il‘Ii‘IEIl~ 'lIl I: (|lll‘IIi‘| ,' §t'II§I,1!I! l!. ' I($l; l&lII'I~‘i i"II, l'i: I£It‘Il Tell i'II,1.':7:I: (:= II‘Il’f~‘. 'i'II: I1I; I~"l-‘~i‘I= tIWeI: I:, Il. 'li‘l= t' 8Il'lIl‘l,1l Wm Tfllllll: _-mil-1-M: 1H-'~-III-Iuttr I'III’, '5II‘I-" | :h‘I5I| I1fZ: l _IllII'lIII= I~‘ | ;I? I,=1'v -I. -I, -III-i». m-I-. .nu-Itzi-I-In-I-I '1~‘I3.I; .,1Z; ..; I13.l'lI; I?Z: l.'2IVIIL. I'll": ,.m. .l; t'2:L. l'I. .r': Il| IL, .l'lI;1:. IEEE Projects 100% WORKING CODE + DOCUMENTAT| ON+ EXPLAINATION — BEST PRICE LOW PRICE GUARANTEED the encrypted document, the member will run KAE. Decrypt to decrypt the document using the aggregate key distributed by the document’s owner. EVALUATION OF THE GROUP DATA SHARING SYSTEM: The system’s performances most critically depend on the KASE algorithms, we consider employing caching techniques in the group data sharing system to further improve the efficiency of the keyword search procedure. After receiving an aggregate trapdoor, the cloud server will run KASE. Adjust and KASE. Test to finish the keyword search. The execution time of KASE. Test is linear in the number of keyword cipher texts. To improve the efficiency, some parallel computing and distributed computing techniques maybe applied, such as multi- thread, hadoop, etc. The multi-thread technique is adopted in our experiment. miccmsinfotech, NO: 3 . 100 FEET ROAD. PONDlCHERRY. WWW. M|CAN S| NFOTECH. COM ; MICANSINFOTECH@GMAIL. COM +91 90036 28940; +91 94435 11725
  13. 13. micclnsinfotech +91 90036 23940 +91 94435 11725 ‘r 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , N52 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, IEEE Projects 100% wonxme CODE + DOCUMENTATlON+ EXPLAINATION — EE§T‘FRrcE LOW PRICE GUARANTEED SYSTEM REQUIREMENTS: H/ W System Configuration: - - Processor - Pentium — - Speed - 1.1 . RAM _ ) - Hard Disk - Floppy Drive 4 MB - Key Board - Standard Windows Keyboard - Mouse - Two or Three Button Mouse - Monitor - SVGA mlcunsinfotech, N0: 3 , 100 FEET ROAD, PONDlCHERRY. WWW. MICANS| N FOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725
  14. 14. miccmsinfotech ‘r +91 90036 28940 +91 94435 11725 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , N52 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, Projects 100% wonxme CODE + DOCUMENTATlON+ EXPLAINATION — EE§T‘FRrcE LOW PRICE GUARANTEED SOFTWARE REQUIREMENTS : 0 Operating System : Window 9 / XP 0 Application Server T X 0 Front End Java, Jsp 0 Scripts cript. 0 Server side Scri ava Server Pages. 0 Database Mysql o Databas ity JDBC. mlcunsinfotech, N0: 3 , 100 FEET ROAD, PONDlCHERRY. WWW. MICANS| N FOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725
  15. 15. micansinfotech +91 90036 23940 +91 94435 11725 ‘r 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , N52 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, IEEE Projects 100% wonxmezcobe + DOCUMENTATlON+ EXPLAINATION — EE§T‘FRrcE LOW PRICE GUARANTEED REFERENCE: 1. L. B. Oliveira, D. F. Aranha, E. the tate pairing in resource-co ' , . “Tinytate: Com-puting d sensor nodes”, IEEE Sixth Network Computing and 2. M. Li, W. Lou, K. area networks”, W 3. R. A. Popa Cryptology ecurity and privacy in wireless body unications, IEEE, 17(1): 51-58, 2010. 1ch. “Mu1ti-key searchable encryption”. ive, Report 2013/508, 2013. u mlcunsinfotech, NO: 3 , 100 FEET ROAD, PONDlCHERRY. WWW. MICANS| NFOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725
  16. 16. micclnsinfotech +91 90036 23940 +91 94435 11725 ‘r 7 Years of Excellence in IEEE Project development for universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN. Expert developers in JAVA , DOT NET , ANDROID , PHP, MATLAB , N52 , N53 , VLSI , CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS , MECHANICAL , MECHATRONICS , WIRELESS NETWORS, OPNET , OMNET Over 11000+ projects , 425 clients - MICANS IFNFOTECH provides IEEE & application proiects for CSE, lT, ECE. EEE, MECH, ClVlL, MCA, M.TECH, M.PHILL, MBA, IséEp}51.a. 100% wonxme CODE + DOCUMENTATlON+ EXPLAINATION — aEsT PRICE LOW PRICE GUARANTEED lI1kClI$InfOteCI‘I, NO: 8 , 100 FEET ROAD, PONDlCHERRY. WWW. MICANS| N FOTECH. COM ; MICANSINFOTECHQGMAILCOM +91 90036 28940; +91 94435 11725

×