A New Lightweight Symmetric Searchable Encryption Scheme for String Identification
Abstract
Searchable Encryption is an emerging cryptographic technique that enables search capabilities over the cloud’s encrypted data. A novel searchable encryption scheme for the architecture of the client-server was presented in this paper. A New Lightweight Symmetric Searchable Encryption Scheme for String Identification The Scheme for String Identification scheme exploits modular inverse properties to generate a probabilistic trapdoor that facilitates searching over the secure inverted index table.
Introduction
A New Lightweight Symmetric Searchable Encryption Scheme for String Identification The cloud is an environment that provides remote on-demand resource sharing and data access to its clients and their devices. Besides the core categories of cloud services, i.e. Database as a Service (DaaS) nowadays allows people to store their files in the cloud. The above concerns are interdependent and should be addressed simultaneously. Encryption is probably the best solution when talking about security that comes to one’s mind.
System Configuration
H/W System Configuration
Speed : 1.1 GHz
RAM : 256 MB(min)
Hard Disk : 20 GB
Floppy Drive : 1.44 MB
Key Board : Standard Windows Keyboard
Mouse : Two or Three Button Mouse
Monitor : SVGA
S/W System Configuration
Platform : cloud computing
Operating system : Windows Xp,7,
Server : WAMP/Apache
Working on : Browser Like Firefox, IE
Conclusion
We have re-addressed the problem of supporting keyword search on encrypted data outsourced to the cloud in this paper. By presenting a novel ranked searchable encryption scheme, we make several contributions to this domain. To generate a probabilistic trapdoor, our construction exploits the properties of modulo prime. The biggest challenge in searchable encryption is to maintain a balance between expressiveness of security, efficiency and query.
