Bonfring International Journal of Software Engineering and Soft Computing, Vol. 9, No.
1, March 2019 15
Provisioning of Data Security for File
Transformation on Multi Cloud Storage
M. Nandhini and Dr.S. Madhavi
Abstract--- In file transformation utilizing proxy re-
signatures, once a user in the group is revoked; the data cloud
server is able to re-sign the blocks, which were signed by the
revoked user, with a resigning key. As a result, the
effectiveness of user revocation can be significantly
developed; computation and communication resources of
existing users can be easily saved. Meantime, the data cloud
server, who is not in the same trusted domain with each user,
is only able to convert a signature of the revoked user into an
existing user on the same block, but it cannot sign arbitrary
blocks on side of either the revoked user or an existing user.
Keywords--- Cloud Server, Based Key Generation,
Attribute Revocation.
I. INTRODUCTION AND SCOPE
I N key generation is every user in the group generates user
public and private key. User generates a random number p,
and provides an output of public and private key without any
loss of abstraction. The one who creates the shared data is the
original user and it is assumed as user 1 in this paper. The user
list will be designed by the original user and which holds the
id’s of the entire user in the particular group. The user list is
signed by original user and it tends to be public. The file is
split into two or more blocks and each will be encrypted by
the user using their public key when the user wants to upload a
file. In order to authenticate the user has to create the signature
for each and every block. In each block along with cipher text
the signature, block id, signer id will be uploaded by the user
and these metadata and key details further will get stored by
public verifier for public auditing. By using secret key the file
will be downloaded by user or member of the group and secret
key will be obtained when the user enter their filename. If this
secret key is valid then the user able to decrypt this
downloaded file. Else the user entered wrong secret key then
who is blocked by public verifier.
II. LITERATURE SURVEY
G. Ateniese, R. Burns; describes the Provable Data
Possession (PDP) that allows a client that has stored data at an
untrusted cloud server to verify that the cloud server possesses
the original data without retrieving it. The model generates
probabilistic proofs of possession by sampling random sets of
blocks from the cloud server, which drastically reduces I/O
M. Nandhini, PG Scholar, Department of CSE, K.S.Rangasamy College
of Technology, Tiruchengode. E-mail: nandhini1078@gmail.com
Dr.S. Madhavi, Professor, Department of CSE, K.S.Rangasamy College
of Technology, Tiruchengode.
DOI:10.9756/BIJSESC.9007
ISSN 2277-5099 | © 2019 Bonfring
costs. The client maintains a constant amount of data, which
minimizes network communication. Thus, the PDP model for
remote data checking supports large data sets in widely
distributed storage systems metadata to verify the proof.
B. Wang, L. Baochun, and L. Hui; narrates data services
in the cloud, users can easily modify and share data as a
group. To ensure data integrity can be audit publicly, users
need to compute signatures on all the blocks in shared data.
Different blocks are signed by different users because of data
modifications performed by different users. For security
reasons, once a user is revoke from the group, the blocks are
previously signed by the revoked user, must be re-signed by
an existing user.
S. Benabbas; suggests the problem of computing on large
datasets those are stored on an untrusted server. To follow the
approach of amortized verifiable computation. To present the
first practical verifiable computation scheme for high degree
polynomial functions. Functions that can be used for example,
to make predictions based on polynomials fitted to a large
number of sample points in an experiment.
Dan Boneh, Ben Lynn, and Hovav Shacham; suggests
theshort digital signatures are needed in environments where a
human is asked to manually generate a key in the signature.
For example, product registration systems often ask users to
key in a signature provided on a label. Currently, the two most
frequently used signatures schemes, RSA (Rivest Shamir
Adleman) and DSA (Data Encryption Standard) provide
relatively long signatures compared to the security they
provide.
H. Shacham; describes to present a new type of signature
for a group of persons, called a group signature. Only
members of the group can sign messages. The receiver can
verify that it is a valid group sign, but cannot discover which
grump ember made. The signature can be "opened", so that
the person who signed the message is revealed it; The group
signatures are a "generalization" of the credential/ membership
authentication schemes, in which one person paves that he
belongs to a &n group. To present four schemes that satisfies
the properties above. Not all these schemes arc based on the
same cryptographic assumption. In some of the schemes a
busted cent is only needed during the setup; and in other
schemes, each parson can create the group he belongs to.
III. IMPLEMENTATION
a) Group Member Registration & Login
In order to create an account user has to register by giving
the appropriate details that is needed. Once the registration is
completed they have to use their user name and the password
Bonfring International Journal of Software Engineering and Soft Computing, Vol. 9, No. 1, March 2019
that the user entered in their registration panel in order to
login.
b) Batch Level Sign Based Key Generation
In key generation, every user in the group generates user’s
public and private keys. User generates a random number p,
and provides output public and private keys without loss of
generality. Assume user1(u1) is the original user, who is the
creator of shared data. The original user also creates a User
List (UL), which contains ids of all the users in the group. The
user list is public and the list is signed by the original user.
c) Upload Files to Cloud Server
The user wants to upload a file. So the user split the files
into many blocks. Next the user encrypt each blocks with his
public key. Then the user generate signature of each blocks for
authentication purpose. The user upload each block cipher text
with signature, block id and signer id. The metadata and key
details are stored in public verifier for public auditing.
d) Download File from Cloud Server
In cloud server the next user or group member wants to
download a file. So user gives the filename and gets the secret
key. Then he entered this secret key. If this secret key is valid
then the user able to decrypt this downloaded file. Else user
entered wrong secret key then he blocked by public verifier. If
the secret key is valid then decrypt each block and verify the
signature. If both signatures are matched then combine all
blocks then get the original file.
e) Public Auditing with User Revocation In Public Verifier
In user revocation, the user who entered the wrong secret
key who is blocked by the public verifier. Next the user added
public verifier revoked user list. The user wants to tries to
download any file; the data cloud server replies his blocked
information. Then the user wants to unrevocation, so the
user asks the public verifier. Finally the public verifier
unrevoked this user. Next the user able to download any file
with its corresponding secret key.
f) Attribute Revocation
The idea of proxy re-signatures, once a user in the group
is revoked, the data cloud server is able to re-sign the blocks,
which were signed by the revoked user, with a resigning key.
The efficiency of user revocation can be significantly
improved, computation and communication resources of
existing users can be easily stored. Meanwhile, the data cloud
server, who is not in the same trusted domain with each user,
is only able to convert revoked user into an existing user
signature on the same block, but it cannot sign arbitrary blocks
on behalf of either revoked or an existing user.
IV. RESULT AND DISCUSSION
When the file is transferred between two users and during
the file transformation third party authority is trying to decrypt
the file using false key. Then the public verifier will get know
about the false key entered and they will revoke the user i.e.
the third party user who entered the wrong key. If the file is
said to be in safe mode then the signature of the original and
decrypted file should be matched else the file is in the unsafe
ISSN 2277-5099 | © 2019 Bonfring
16
mode and this process of verification is called Integrity
checking between files.
V. CONCLUSION
The primitive of verifiable database with effective updates
is an important way to solve the problem of verifiable
outsourcing of storage. To propose a scheme to realize
efficient and secure data integrity auditing for share dynamic
data with multi-user modification. The group signatures with
user revocation are affect to achieve the data integrity auditing
of remote data. Beside the public data auditing, the integration
of the three primitive enable our scheme to outsource cipher
text database to remote cloud and support secure group users
revocation to shared dynamic data.
To provide security analysis of our scheme, and it shows
that our scheme provide data confidentiality for group users,
and it is also secure against the collusion attack from the cloud
storage server and revoked group users. In addition, the
performance analysis shows that, compared with its relevant
schemes, our scheme is also efficient in different phases.
ACKNOWLEDGEMENT
We acknowledge DST-File No.368. DST-
FIST(SR/FIST/College-235/2014 dated 21-11-2014) for
financial support and DBT-STAR-College-Scheme ref. no:
BT/HRD/11/09/2018 for providing infrastructure support.
REFERENCES
[1] A. Giuseppe, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson
and D. Song, “Provable data possession at untrusted stores”,
Proceedings of the 14th ACM conference on Computer and
communications security, Pp. 598-609, 2015.
[2] W. Boyang, B. Li and H. Li, “Panda: Public auditing for shared data
with efficient user revocation in the cloud”, IEEE Transactions on
services computing, Vol. 8, No. 1, Pp. 92-106, 2015.
[3] B. Siavosh, R. Gennaro and Y. Vahlis, “Verifiable delegation of
computation over large datasets”, In Annual Cryptology Conference, Pp.
111-131, 2011.
[4] B. Dan, B. Lynn and H. Shacham, “Short signatures from the Weil
pairing”, Journal of cryptology, Vol. 17, No. 4, Pp. 297-319, 2004.
[5] B. Emmanuel and J. Stern, “Efficient revocation in group signatures”,
In International Workshop on Public Key Cryptography, Pp. 190-206,
2001.
[6] D. Chaum and E. Van Heyst, “Group signatures”, In Workshop on the
Theory and Application of of Cryptographic Techniques, Pp. 257-265,
1991.
[7] W. Qianhong, Y. Mu, W. Susilo, B. Qin and J. Domingo-Ferrer,
“Asymmetric group key agreement”, In Annual International
Conference on the Theory and Applications of Cryptographic
Techniques, Pp. 153-170, 2009.
[8] E.C. Chris, A. Küpçü, C. Papamanthou and R. Tamassia, “Dynamic
provable data possession”, ACM Transactions on Information and
System Security (TISSEC), Vol. 17, No. 4, 2015,
[9] G. Rosario, C. Gentry and B. Parno, “Non-interactive verifiable
computing: Outsourcing computation to untrusted workers”, Annual
Cryptology Conference, Pp. 465-482, 2010.
[10] Gentry, C, “Fully homomorphic encryption using ideal lattices”, Stoc,
Vol. 9, No. 2009, Pp. 169-178.
[11] G. Craig and S. Halevi, “Implementing gentry’s fully-homomorphic
encryption scheme”, In Annual international conference on the theory
and applications of cryptographic techniques, Pp. 129-148, 2011.
[12] G. Rosario, C. Gentry and B. Parno, “Non-interactive verifiable
computing: Outsourcing computation to untrusted workers”, In Annual
Cryptology Conference, Pp. 465-482, 2010.