0% found this document useful (0 votes)
63 views

Flexible Wildcard Searchable

This document proposes a new flexible wildcard searchable encryption system that allows users to perform searches on encrypted data stored in the cloud. It improves on previous systems by allowing multiple keywords to be searched with wildcards in any position, supporting simultaneous searches across multiple user's data, and providing flexible authorization. The system is constructed using homomorphic encryption rather than Bloom filters to eliminate false positives, and search results remain private to protect user privacy.

Uploaded by

The Futura Labs
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
63 views

Flexible Wildcard Searchable

This document proposes a new flexible wildcard searchable encryption system that allows users to perform searches on encrypted data stored in the cloud. It improves on previous systems by allowing multiple keywords to be searched with wildcards in any position, supporting simultaneous searches across multiple user's data, and providing flexible authorization. The system is constructed using homomorphic encryption rather than Bloom filters to eliminate false positives, and search results remain private to protect user privacy.

Uploaded by

The Futura Labs
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Flexible Wildcard Searchable Encryption

System
ABSTRACT:

Searchable encryption is an important technique for public cloud storage service to


provide user data confidentialityprotection and at the same time allow users
performing keyword search over their encrypted data. Previous schemes only deal
withexact or fuzzy keyword search to correct some spelling errors. In this paper,
we propose a new wildcard searchable encryption systemto support wildcard
keyword queries which has several highly desirable features. First, our system
allows multiple keywords searchin which any queried keyword may contain zero,
one or two wildcards, and a wildcard may appear in any position of a keyword
andrepresent any number of symbols. Second, it supports simultaneous search on
multiple data owner’s data using only one trapdoor.Third, it provides flexible user
authorization and revocation to effectively manage search and decryption
privileges. Fourth, it isconstructed based on homomorphic encryption rather than
Bloom filter and hence completely eliminates the false probability causedby
Bloom filter. Finally, it achieves a high level of privacy protection since matching
results are unknown to the cloud server in the testphase. The proposed system is
thoroughly analyzed and is proved secure. Extensive experimental results indicate
that our system isefficient compared with other existing wildcard searchable
encryption schemes in the public key setting.

EXISTING SYSTEM:

 Existing wildcard search-able encryption scheme based on Bloom filter, in


which each keyword has its own Bloom filter. The storage overhead grows with
the number of extracted keywords from the document. The disadvantage of the
scheme is that one wildcard can only represent one character.
 For instance, if a user desires to search all keywords that begin with “acid”,
he has to submit the trapdoors for wildcard keywords “acid??”, “acid???” and
“acid?????? ??” respectively so that the keywords “acidic”, “acidity” and
“acidification” can be matched.
 To overcome this problem, Hu et al. introduced an improved scheme such
that one wildcard can represent any number of characters.
 Hu’s scheme is constructed based on Suga’s scheme but utilizes a different
method to insert a keyword into Bloom filter.

DISADVANTAGES OF EXISTING SYSTEM:

 The limitation of fuzzy searchable encryption scheme is that only small edit
distance errors, such as spelling errors, can be corrected. It is almost useless if
the query keyword has a large edit distance from the exact keyword.
 A serious drawback of Bloom filter based searchable encryption schemes is
the inevitability of false probability.

PROPOSED SYSTEM:

 We propose a flexible wildcard searchable encryption scheme supporting


multiple users. It is constructed in public key setting without relying on Bloom
filter, is efficient, and achieves high security level. Additionally, when any
suspicious action is detected, data owners can dynamically update the
verification data stored on the cloud server.
 Our system is the firstwildcard SE which allows a data user to use
onetrapdoor to simultaneously search on multiple dataowner’s files. For
example, a medical doctor canissue one wildcard keyword query to
simultaneouslysearch over multiple patients’ encrypted EHRs.
 Moreover, in the search algorithm, the user canuse multiple keyword to
generate one trapdoor.These query keywords may contain zero, one ortwo
wildcards. The user can issue “AND” or “OR”queries on these keywords and
the top-k documentsthat have the highest relevance scores is returned tothe
user.

ADVANTAGES OF PROPOSED SYSTEM:

 No false probability.
 Flexible user authorization and revocation.
 Flexible search function.
 Flexible wildcard representation.

SYSTEM ARCHITECTURE:
SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

 System : Pentium Dual Core.


 Hard Disk : 120 GB.
 Monitor : 15’’ LED
 Input Devices : Keyboard, Mouse
 Ram : 1 GB

SOFTWARE REQUIREMENTS: 

 Operating system : Windows 7.


 Coding Language : NET,C#.NET
 Tool : Visual Studio 2008
 Database : SQL SERVER 2005

You might also like