UGC APPROVED ISSN 2278-1412

Archive

  Volume 13 | Issue 11

  Volume 13 | Issue 10

  Volume 13 | Issue 9

  Volume 13 | Issue 8

  Volume 13 | Issue 7

  Volume 13 | Issue 6

  Volume 13 | Issue 5

  Volume 13 | Issue 3

  Volume 13 | Issue 1

  Volume 12 | Issue 12

  Volume 12 | Issue 11

  Volume 12 | Issue 10

  Volume 12 | Issue 9

  Volume 12 | Issue 8

  Volume 12 | Issue 7

  Volume 12 | Issue 6

  Volume 12 | Issue 5

  Volume 12 | Issue 4

  Volume 12 | Issue 3

  Volume 12 | Issue 2

  Volume 12 | Issue 1

  Volume 11 | Issue 12

  Volume 11 | Issue 11

  Volume 11 | Issue 10

  Volume 11 | Issue 8

  Volume 11 | Issue 7

  Volume 11 | Issue 6

  Volume 11 | Issue 3

  Volume 11 | Issue 1

  Volume 10 | Issue 12

  Volume 10 | Issue 8

  Volume 10 | Issue 6

  Volume 10 | Issue 3

  Volume 10 | Issue 2

  Volume 10 | Issue 1

  Volume 9 | Issue 10

  Volume 8 | Issue 11

  Volume 8 | Issue 7

  Volume 7 | Issue 8

  Volume 7 | Issue 7

  Volume 7 | Issue 6

  Volume 7 | Issue 5

  Volume 7 | Issue 4

  Volume 7 | Issue 3

  Volume 7 | Issue 2

  Volume 7 | Issue 1

  Volume 6 | Issue 12

  Volume 6 | Issue 10

  Volume 6 | Issue 9

  Volume 6 | Issue 8

  Volume 6 | Issue 7

  Volume 6 | Issue 6

  Volume 6 | Issue 5

  Volume 6 | Issue 4

  Volume 6 | Issue 3

  Volume 6 | Issue 2

  Volume 6 | Issue 1

  Volume 5 | Issue 12

  Volume 5 | Issue 11

  Volume 5 | Issue 10

  Volume 5 | Issue 9

  Volume 5 | Issue 8

  Volume 5 | Issue 7

  Volume 5 | Issue 6

  Volume 5 | Issue 5

  Volume 5 | Issue 4

  Volume 5 | Issue 3

  Volume 5 | Issue 2

  Volume 5 | Issue 1

  Volume 4 | Issue 12

  Volume 4 | Issue 10

  Volume 4 | Issue 8

  Volume 4 | Issue 7

  Volume 4 | Issue 6

  Volume 4 | Issue 5

  Volume 4 | Issue 4

  Volume 4 | Issue 2

  Volume 4 | Issue 1

  Volume 3 | Issue 10

  Volume 3 | Issue 8

  Volume 3 | Issue 6

  Volume 3 | Issue 5

  Volume 3 | Issue 4

  Volume 3 | Issue 3

  Volume 3 | Issue 2

  Volume 3 | Issue 1

  Volume 2 | Issue 12

  Volume 2 | Issue 11

  Volume 2 | Issue 10

  Volume 2 | Issue 9

  Volume 2 | Issue 8

  Volume 2 | Issue 7

  Volume 2 | Issue 2

  Volume 1 | Issue 9

  Volume 1 | Issue 8

  Volume 1 | Issue 7

  Volume 1 | Issue 6

  Volume 1 | Issue 4

  Volume 1 | Issue 3

  Volume 1 | Issue 2

  Volume 1 | Issue 1

Current Volume 13 | Issue 12

Survey Efficient Multi-User Searchable Encryption Scheme without Query Transformation over Outsourced Encrypted Data


Volume:  10 - Issue: 03 - Date: 01-03-2021
Approved ISSN:  2278-1412
Published Id:  IJAECESTU269 |  Page No.: 107-110
Author: Neha Mishra
Co- Author: Rakesh Kumar Lodhi
Abstract:-Cloud computing could be a revolutionary mechanism that ever-changing way to enterprise hardware and softwaresystem style and procurements. Key encryption is initial topology to classify multiple user and provide security. SearchableEncryption (SE) schemes provide security and privacy to the cloud data. The existing SE approaches enable multiple users toperform search operation Cloud information's are keeping and accessed during a remote server with the help of services providedby cloud service suppliers. Providing security could be a major concern because the information is transmitted to the remoteserver over a channel (internet). Before implementing Cloud computing in a company, security challenges has to be addressedinitial. This study identifies the problems associated with the cloud information storage.
Key Words:-Content based image retrieval, Joint equal contribution, low level features, High level features, Colorhistogram
Area:-Engineering
Download Paper: 
Preview This Article

Unable to display PDF file. Download instead.


Download Paper

Downlaod Paper

No. of Download

000198

Impact Factor

7.4


ijaece

Upcoming Events


Special Issue For Paper


Upcoming Conference


Call For Paper