You are on page 1of 17

PRESENTED BY:

RAHUL . R

GUIDED BY:
Ms.T . BAVITHRADEVI

ABSTRACT
For ranked search in encrypted cloud data, order preserving encryption (OPE) is an

efficient tool to encrypt relevance scores of the inverted index. When using deterministic
OPE, the ciphertexts will reveal the distribution of relevance scores.
We proposed a probabilistic OPE, called One-to-Many OPE, for applications of searchable

encryption, which can flatten the distribution of the plaintexts.


we proposed a differential attack on One-to-Many OPE by exploiting the differences of the

ordered ciphertexts.
The experimental results show that the cloud server can get a good estimate of the

distribution of relevance scores by a differential attack. Furthermore, when having some


background information on the outsourced documents, the cloud server can accurately
infer the encrypted keywords by using the estimated distributions.

LITERATURE SURVEY
P. Mell and T. Grance, The NIST definition of cloud computing,
S. Subashini and V. Kavitha, A survey on security issues in service

delivery models of cloud computing,


M. Abdalla, M. Bellare and D. Catalano, Searchable encryption revisited:

Consistency properties, relation to anonymous IBE, and extensions,

EXISTING SYSTEM
Existing and new algorithms for assigning anonymous IDs are examined

with respect to trade-offs between communication and computational


requirements.
Also, suppose that access to the database is strictly controlled, because data

are used for certain experiments that need to be maintained confidential.


Our main algorithm is based on a method for anonymously sharing simple

data and results in methods for efficient sharing of complex data

DISADVANTAGES
The problem of sharing privately held data so that the individuals who are

the subjects of the data cannot be identified has been researched


extensively.
The database with the tuple data does not be maintained confidentially.
The existing systems another person to easily access database.
The algorithms for mental poker are more complex and utilize

cryptographic methods as players must, in general, be able to prove that


they held the winning hand.

PROPOSED SYSTEM
An algorithm for anonymous sharing of private data among parties is

developed. This technique is used iteratively to assign these nodes ID


numbers ranging from 1 to N.
This assignment is anonymous in that the identities received are unknown

to the other members of the group.


Resistance to collusion among other members is verified in an information

theoretic sense when private communication channels are used.

ADVANTAGES
The anonymity of DB is not affected by inserting the records.
We provide security proofs and experimental results for both

protocols.
That task restricts the level to which can be practically raised.
We show in detail how to obtain the average number of

required rounds, and in the Appendix detail a method for


solving the polynomial, which can be distributed among the
participants.

Login

DATA FLOW DIAGRAM

Store

Login

Admin
DB
Add/Delete Product
Change Product
Details

Select Product

Customer

Store Payment
Details

View Products by
Search

Search Products

Security Transcation
Feed back

View

Add To Cart

Payment

View Payments

PROPOSED ALGORITHM
Early we use Textual passwords as a security but these

passwords are vulnerable to the various attacks like Dictionary


attack, Shoulder surfing, eves dropping, etc. Further graphical
passwords are coming to the existence but the graphical
passwords have their own disadvantages like they require more
time to Authenticate and the usability issues.

PROPOSED ALGORITHM
EXPLANATION
Thus we proposed a session password scheme in which the
passwords are used only once for each and when session is
terminated the password is no longer in use. The proposed of
session password scheme uses Text and colors for generating
session password. Two session password schemes are used
Hybrid Textual Authentication Scheme and Pair-based
Authentication scheme.

PROPOSED ALGORITHM
EXPLANATION
Authentication is provided by using two new techniques i.e.
pair based authentication scheme, hybrid textual authentication
scheme.
The user has to select the authentication scheme at a time of

login.
In a pair based scheme Textual passwords are provided and in

Hybrid Textual scheme set of colours is provided.

HARDWARE CONFIGURATION
Processor

Pentium IV

RAM

512MB

Monitor size

17SVGA

Hard Disk

80 GB

Extra Device

CD-ROM 52x

Keyboard

104 standards Keyboard

Mouse

Optical

SOFTWARE CONFIGURATION
Operating System :

Windows XP Professional/7

Environment

Visual Studio .Net 2010

.Net Framework

Version 4.0

Language

C#

Web Technology

Active Server Pages.Net (Asp .Net)

Web Server

Internet information Server 5.0

Back End

SQL Server 2008

MODULES
Online Shopping
Textual Authentication Scheme
Hybrid Textual Authentication

Online Shopping Module


In this module we are developing online shopping web

application where the user will do shopping based on the


products and whatever the products he/she purchase it
will add into the shopping cart. So basically admin will
add all the product details and there price list, view the
user, view the transaction details. In user module, user
has to first create account in that application and based
on his authentication he can view the products and
purchase the products. And the system will automatically
create one cart for the user and whatever the products
he purchased all the product details and price will be
added into the shopping cart.After that the user will be
redirected to the Payment Gateway.

Textual Authentication
Scheme
Module
Within this online shopping application we are

implementing textual authentication scheme


module. Minimum length of the password is 8
and it can be called as secret pass. .The secret
pass should contain even number of
characters. Session passwords are generated
based on this secret pass. During the login
phase, when the user enters the username an
interface consisting of a grid is displayed. The
grid is of size 6 x 6 and it consists of alphabets
and numbers. These are randomly placed on
the grid and the interface changes every time.

Hybrid Textual
Authentication Scheme
Module

In user registration page itself we are implementing


hybrid textual authentication scheme. First the user
should rate colors from 1 to 8. During the login
phase, when the user enters his username an
interface is displayed based on the colors selected
by the user. The login interface consists of grid of
size 88. This grid contains digits 1-8 placed
randomly in grid cells.