2. ABSTRACT
Propose a toolkit for economical and privacy-preserving outsourced calculation
below multiple encrypted keys, that we tend to talk over with as , a large scale of users will
firmly source their information to a cloud server for storage. Moreover, encrypted information
happiness to multiple users is processed while not compromising on the security of the
individual user’s (original) information and therefore the final computed results. to cut back
the associated key management cost and personal key exposure risk in , we tend to gift a
Distributed Two-Trapdoor Public-Key Cryptosystem , the core scientific discipline primitive.
we tend to conjointly gift the toolkits to ensure that the unremarkably used whole number
operations is securely handled across completely different encrypted domains. We then prove
that the planned achieves the goal of secure whole number process while not leading to
privacy discharge of information to unauthorized parties.
3. EXISTING SYSTEM PROPOSED SYSTEM
EXISTING CONCEPT:-
both single key and multiple keys
fully homomorphic cryptosystem
in the existing scheme are rather
inefficient, in terms of computation
and storage. In the near future, if
an efficient multi-key fully
homomorphic cryptosystem exists,
PROPOSED CONCEPT:-
Our proposed EPOM is designed to
allow different data providers to
outsource their data (e.g. data
belonging to users from different data
providers) to the cloud server for
secure storage and processing
EXISTING TECHNIQUE:-
Blinding
PROPOSED TECHNIQUE:-
Shamir secret sharing
4. TECHNIQUE DEFINITION:-
as the private key is randomly split by
executing algorithm of . Even when A
obtains all plaintext value from the sub-
protocols by compromising , it is still
unable for to obtain useful information
as our protocols use the known
technique of “blinding” the plaintext
given an encryption of a message, we
use the additive homomorphic property
of the cryptosystem to add a random
message to it. Therefore, original
plaintext is “blinded”.
TECHNIQUE DEFINITION:-
The privacy of divided private key is
guaranteed by Shamir secret sharing
scheme which is information-theoretic
secure. The strong private key SK is
randomly split into two shares in a way
that any less than two shares cannot
recover the original SK Shamir secret
sharing technique is used). It further
implies that the adversary cannot cover the
original plaintext with less than two shares
of partial decrypted ciphertexts (as the
adversary can select a share all by himself).
DRAWBACKS:-
Message loss
Hacker able to get the data
ADVANTAGES:-
Hacker can’t get the data
Fast forwarding
5. SOFTWARE REQUIREMENT
Operating system :- Windows 7
Front End :- Microsoft Visual Studio .NET 2013
Coding Language :- C#
Backend :- SQL Server 2012
HARDWARE REQUIREMENT
Processor : Pentium Dual Core 2.00GHZ
Hard disk : 120 GB
Mouse : Logitech.
RAM : 2GB(minimum)
Keyboard : 110 keys enhanced.
6. PROPOSED CONCEPT:-
The privacy of divided private key is
guaranteed by Shamir secret sharing
scheme which is information-theoretic
secure. The strong private key SK is
randomly split into two shares in a way
that any less than two shares cannot
recover the original SK Shamir secret
sharing technique is used). It further
implies that the adversary cannot cover
the original plaintext with less than two
shares of partial decrypted ciphertexts
(as the adversary can select a share all
by himself).
In terms of computation and storage In the
near future, if an efficient multi-key fully
homomorphic cryptosystem exists, we can
remove the CSP from the system which
will also result in a more elegant system
both single key and multiple keys fully
homomorphic cryptosystem in the existing
scheme are rather inefficient,
PROPOSED TECHNIQUE:-
Shamir secret sharing
FUTURE ALGORITHM:-
SKeyS algorithm
7. TECHNIQUE DEFINITION:-
The privacy of divided private key is
guaranteed by Shamir secret sharing
scheme which is information-theoretic
secure. The strong private key SK is
randomly split into two shares in a way
that any less than two shares cannot
recover the original SK Shamir secret
sharing technique is used). It further
implies that the adversary cannot cover
the original plaintext with less than two
shares of partial decrypted ciphertexts
(as the adversary can select a share all
by himself)..
TECHNIQUE DEFINITION:-
as the private key is randomly split by
executing SKeyS algorithm of DTPKC.
Even when obtains all plaintext value from
the sub-protocols by compromising CSP, it
is still unable for to obtain useful
information as our protocols use the known
technique of “blinding” the plaintext given
an encryption of a message, we use the
additive homomorphic property of the DT-
PKC cryptosystem to add a random
message to it.
ENRICHMENT:-
Hacker can’t get the data
Fast forwarding
EXTRAVAGANCE:-
Avoid hacker to get data
Block hacker
