Secure Data Self-Destructing with Time Constraint in Clouds

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056
Volume: 04 Issue: 03 | Mar -2017 www.irjet.net p-ISSN: 2395-0072
© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 298
Secure Data Self-Destructing with Time Constraint in Clouds
Asst. Prof. Yogita D. Sinkar1, Dr. C. Rajabhushanam2
1Assistant Professor, Dept. of Computer Engineering, SVPM’s COE Malegaon (Bk.), Maharashtra, India
2 Professor, Dept. of Computer Science & Engineering, Bharath Institute of Higher Education & Research, Chennai,
India
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract - A with the fast development of versatile cloud
services, it becomes more and more prone to use cloud
services to share knowledge in an exceedingly friend circle
within the cloud computing atmosphere. Since it's not
possible to implement full lifecycle privacy security, access
management becomes a difficult task, particularly after we
share sensitive knowledge on cloud servers. So as to tackle
this drawback, we have a tendency to propose a key-policy
attribute-based encoding with time-specified attributes (KP-
TSABE), a completely unique secure knowledge self-
destructing theme in cloud computing. Within the KP-
TSABE theme, every cipher text is tagged with a quantity
whereas personal secret is related to a time instant. The
cipher text will only be decrypted if each the time instant is
within the allowed quantity and also the attributes related
to the cipher text satisfy the key’s access structure. The KP-
TSABE is in a position to resolve some vital security issues by
supporting user defined authorization amount and by
providing fine-grained access management throughout the
amount. The sensitive knowledge are securely self-
destructed once a user-specified expiration time. The KP-
TSABE theme is well-tried to be secure below the decision l-
bilinear Diffie-Hellman inversion (l-Expanded BDHI)
assumption. Comprehensive comparisons of the safety
properties indicate that the KP-TSABE theme planned by
U.S.A. satisfies the safety necessities and is superior to other
existing schemes. Therefore, a new concept called data
auditing is introduced which check the integrity of data
with the help of an entity called Third Party Auditor (TPA).
The purpose of this work is to develop an auditing scheme
which is secure, efficient to use and possess the capabilities
such as privacy preserving, public auditing, maintaining the
data integrity along with confidentiality. Thus the new
auditing scheme has been developed by considering all these
requirements. It consist of three entities: data owner, TPA
and cloud server.
Key Words: Sensitive data, secure self-destructing, fine
grained access control, privacy-preserving, cloud
computing
1. INTRODUCTION
With the speedy development of versatile cloud offerings,
it becomes associate degree increasing vary of in danger of
use cloud services to proportion facts in associate degree
passing pal circle among the cloud computing
surroundings. As a results of its not viable to put operative
complete life-cycle privacy security, get admission to
manage becomes a tricky endeavour, in particular when
we tend to share sensitive information on cloud servers.
The shared data in cloud servers, however, generally
contains user’s sensitive information and needs to be
protected. As a result of the possession of the knowledge is
separated from the administration of them, the cloud
servers may migrate user’s data to completely different
cloud servers in outsourcing or share them in cloud
wanting. Therefore, it becomes an enormous challenge to
protect the privacy of those shared data in cloud,
significantly in cross cloud and big data setting. Thus on
fulfil this challenge, it's a necessity to vogue a
comprehensive answer to support user-defined
authorization quantity and to produce fine grained access
management throughout this era. The shared data need to
be self-destroyed once the user made public expiration
time.
2. LITERATURE SURVEY
A. Attribute-based Encryption
Attribute-based encoding is one among the very important
applications of fuzzy identification-primarily primarily
based encoding [7]. ABE comes in favours known as KP-
ABE [8][11] and cipher text policy ABE (CP-ABE) [12][13].
In CP-ABE, the cipher text is related to the get entry to
structure whereas the private key carries a group of
attributes. Be then court docket et al. projected the first
CPABE theme [12], the disadvantage in their theme is that
safety proof became handiest designed below the well-
known establishment version. To traumatize this liability,
Cheung et al. equipped the other construction to a lower
place a stylish model [13]. Waters used a linear secret
sharing theme (LSSS) matrix as a most well-liked set of get
entry to structures over the attributes and projected an
efficient and incontrovertibly comfy CP-ABE theme to a
lower place the standard version [14]. In KP-ABE, the idea
is reversed: the cipher matter content consists of a group
of attributes and therefore the personal secret is said to
the get entry to structure. The first production of KP-ABE
theme was projected in [8]. Their theme, once a user
created a secret request, the trusted authority determined
that combination of attributes have to be compelled to
appear among the cipher matter content for the user to
decode. instead of the utilization of the Shamir mystery

key technique [15] within the private key, this theme used
a further generalized form of secret sharing to place into
result a monotonic get right of entry to tree. Ostrovsky et
al. equipped the first KP-ABE machine that supports the no
monotone formulas in key rules [15]. Yu et al. used a
combining technique of KP-ABE, proxy encoding, and lazy
re-encryption which allows the records owner to delegate
most of the computation obligations involved in fine-
grained info access management to untrusted cloud
servers while not revealing the underlying facts contents
[15]. Tysowski et al. modified the ABE and leveraged re-
encryption formula to endorse a completely unique theme
to protect mobile user’s facts in cloud computing
atmosphere [15]. Thanks to the shortage of your time
user-defined authorization length and comfortable self-
destruction when expiration for privacy-maintaining of
the records lifecycle in cloud computing.
B. Secure self-destruction scheme
A celebrated methodology for addressing this drawback is
relaxed deletion of touchy statistics once expiration
whereas the facts became used [12]. Currently, Cachin et
al. employed a coverage graph to elucidate the connection
among attributes and therefore the protection class and
projected a coverage-based secure statistics deletion
theme [14]. Reardon et al. leveraged the graph idea, Btree
form and key wrapping and projected a novel approach to
the planning and analysis of comfy deletion for persistent
storage devices [15]. Thanks to the homes of bodily garage
media, the above-cited strategies are not applicable for the
cloud computing setting because the deleted statistics is
also recovered merely among the cloud servers [14]. A
records self-destructing theme, first projected by
approach of Geambasuetal, Is a promising methodology
that styles a Vanish device allows customers to regulate
over the lifecycle of the touchy facts. Wang et al. improved
the Vanish device and projected a relaxed self-destructing
theme for digital facts (SSDD). Within the SSDD theme, a
knowledge is encrypted right into a cipher text, that's then
associated and extracted to create it incomplete to face up
to towards the normal science and therefore the brute-
pressure attack. Then, each the secret writing key and
therefore the extracted cipher text area unit assigned into
a distributed hash table (DHT) network to place into result
self-destruction once the update length of the DHT
network. However, Wolchok et al. created variety of
experiments and confirmed that the Vanish machine is
liable to Sybil attacks by the utilization of the Vuze DHT
community. That the security of the SSDD theme is
likewise questionable.
C. Time Specific Encryption
A noted methodology for addressing this downside is
relaxed deletion of touchy statistics when expiration
whereas the facts became used [14]. Currently, Cachin et
al. employed a coverage graph to elucidate the connection
among attributes and also the protection class and
projected a coverage-based secure statistics deletion
theme [15]. Reardon et al. leveraged the graph idea, Btree
form and key wrapping and projected a novel approach to
the look and analysis of comfy deletion for persistent
storage devices [15]. Thanks to the homes of bodily garage
media, the above-cited ways are not applicable for the
cloud computing atmosphere because the deleted
statistics could also be recovered only at intervals the
cloud servers [12]. A records self-destructing theme, first
projected by method of Geambasuetal. [15], is a promising
methodology that styles a Vanish device permits
customers to regulate over the lifecycle of the touchy facts.
Wang et al. improved the Vanish device and projected a
relaxed self-destructing theme for digital facts (SSDD).
Within the SSDD theme, a knowledge is encrypted right
into a cipher text, that's then associated and extracted to
create it incomplete to face up to towards the normal
cryptanalytic and also the brute-pressure attack. Then,
each the cryptography key and also the extracted cipher
text are assigned into a distributed hash table (DHT)
network to place into result self-destruction when the
update length of the DHT network. However, Wolchok et
al. created variety of experiments and confirmed that the
Vanish machine is vulnerable to Sybil attacks by the
employment of the Vuze DHT community. Therefore the
security of the SSDD theme is likewise questionable. To
address this trouble, Zeng et al. projected a SeDas
convenience that could be a singular integration of
cryptologic techniques with active storage techniques.
Xiong et al. leveraged the DHT network and identity-based
all coding (IBE) and projected an IBE-based comfy self-
destruction (ISS) theme [14]. To be ready to guard the
confidentiality and privacy protection of the composite
files within the complete lifecycle in cloud computing,
Xiong et al. applied the ABE formula to suggest a comfy
self-destruction theme for composite documents
(SelfDoc). these days, Xiong et al. used identification-based
all timed-launch coding (identification-TRE) formula [9]
and also the DHT network and projected a full lifecycle
privacy protection theme for sensitive facts (FullPP), that
is capable of supply full lifecycle privateness safety for
customers’ touchy records with the help of creating it
undecipherable prior a predefined time and robotically
destructed when expiration [3]. the principle plan of the
above-noted schemes is that they severally integrate
specific cryptologic techniques with the DHT network to
supply finegrained info get admission to regulate
throughout the lifecycle of the enclosed records and to
place into result records self-destruction when expiration.
However, the usage of the DHT network can end in the
very fact that the lifecycle.

3. CONTRIBUTION
In this paper, we have a tendency to advise a KP-TSABE
theme, that's a completely unique self-destructing theme
for records sharing in cloud computing. We have a
tendency to first introduce the perception of KP-TSABE,
formalize the model of KP-TSABE and provides the safety
version of it. Then, we have a tendency to provide a
specific creation technique concerning the theme.
Eventually, we have a tendency to prove that the KP-
TSABE theme is secure. Specially, KP-TSABE has the
subsequent benefits with relation to protection and fine-
grained get admission to manage as compared to
alternative comfy self-destructing schemes.
1) KP-TSABE supports the characteristic of user
defined authorization length and ensures that
the touchy data can't be scan every sooner
than its most well-liked unleash time and
when its expiration.
2) KP-TSABE will not need the correct
assumption of “No attacks on VDO sooner
than it expires”.
3) KP-TSABE is capable of place into impact fine-
grained get admission to regulate throughout
the authorization period and to form the
touchy data self-destruction when expiration
with none human intervention.
KP-TSABE is valid to be secure below the standard version
by method of the usage of the l-bilinear DiffieHellman
inversion assumption.
4. SYSTEM MODEL
• Data Owner: Data owner can provide data or files
that contain some sensitive information, which
are used for sharing with his/her friends (data
users). All these shared data are outsourced to the
cloud servers to store.
• Authority: It is an indispensable entity which is
responsible for generating, distributing and
managing all the private keys, and is trusted by all
the other entities involved in the system.
 Time Server: It is a time reference server without any
interaction with other entities involved in the system.
It is responsible for a precise release time specification.
 Data Users: Data users are some peoples who passed
the identity authentication and access to the data
outsourced by the data owner. Notice that, the shared
data can only be accessed by the authorized users
during its authorization period.
 Cloud Servers: It contains almost unlimited storage
space which is able to store and manage all the data or
files in the system. Other entities with limited storage
space can store their data to the cloud servers.
 Potential Adversary: It is a polynomial time adversary
which has all access to Cloud Server.
5. CONCLUSIONS
With the fast development of versatile cloud services,
A lot of recent challenges have emerged. One of the
foremost necessary issues is the way to firmly delete the
outsourced knowledge keep within the cloud severs.
In this paper, we have a tendency to projected a unique
KP-TSABE scheme that is in a position to attain the time-
specified cipher text so as to resolve these issues by
implementing flexible fine-grained access management
throughout the authorization amount and time-
controllable self-destruction when expiration to the
shared and outsourced knowledge in cloud computing. We
have a tendency to conjointly give a system model and a
security model for the KP-TSABE scheme. Moreover, we
have a tendency to test that KP-TSABE is secure beneath
the quality model with the decision l-Expanded BDHI
assumption. The comprehensive analysis indicates that
the projected KP-TSABE theme is superior to alternative
existing schemes.

REFERENCES
[1] B. Wang, B. Li, and H. Li, “Oruta: Privacy-preserving
public auditing for shared data in the cloud,” Cloud
Computing, IEEE Transactions on, vol. 2, no. 1, pp. 43–
56, 2014.
[2] J. Xiong, Z. Yao, J. Ma, X. Liu, Q. Li, and J. Ma, “Priam:
Privacy preserving identity and access management
scheme in cloud,” KSII Transactions on Internet and
Information Systems (TIIS), vol. 8, no. 1, pp. 282–304,
2014.
[3] J. Xiong, F. Li, J. Ma, X. Liu, Z. Yao, and P. S. Chen, “A full
lifecycle privacy protection scheme for sensitive data
in cloud computing,” Peerto-Peer Networking and
Applications. [Online]. Available:
http://dx.doi.org/10.1007/s12083-014-0295-x
[4] P. Jamshidi, A. Ahmad, and C. Pahl, “Cloud migration
research: A systematic review,” Cloud Computing,
IEEE Transactions on, vol. 1, no. 2, pp. 142–157, 2013.
[5] R. Lu, H. Zhu, X. Liu, J. K. Liu, and J. Shao, “Toward
efficient and privacy-preserving computing in big data
era,” Network, IEEE, vol. 28, no. 4, pp. 46–50, 2014.
[6] A. Sahai and B. Waters, “Fuzzy identity-based
encryption,” in Advances in Cryptology–EUROCRYPT
2005, ser. LNCS, vol. 7371. Springer, 2005, pp. 457–
473.
[7] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
“Attribute-based encryption for fine-grained access
control of encrypted data,” in Proceedings of the 13th
ACM conference on Computer and Communications
Security. ACM, 2006, pp. 89–98.
[8] A. F. Chan and I. F. Blake, “Scalable, server-passive,
user anonymous timed release cryptography,” in
Proceedings of the International Conference on
Distributed Computing Systems. IEEE, 2005, pp. 504–
513.
[9] K. G. Paterson and E. A. Quaglia, “Time-specific
encryption,” in Security and Cryptography for
Networks. Springer, 2010, pp. 1–16.
[10] Q. Li, J. Ma, R. Li, J. Xiong, and X. Liu, “Large universe
decentralized key-policy attribute-based encryption,”
Security and Communication Networks, 2014.
[Online]. Available:
http://dx.doi.org/10.1002/sec.997
[11] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-
policy attribute-based encryption,” in Proceedings of
the 28th IEEE Symposium on Security and Privacy.
IEEE, 2007, pp. 321– 334.
[12] L. Cheung and C. C. Newport, “Provably secure cipher
text policy abe,” in Proceedings of the 14th ACM
conference on Computer and communications
security. ACM, 2007, pp. 456– 465.
[13] B. Waters, “Ciphertext-policy attribute-based
encryption: An expressive, efficient, and provably
secure realization,” Public Key Cryptography–PKC
2011, pp. 53–70, 2011.
[14] A. Shamir, “How to share a secret,” Communications of
the ACM, vol. 22, no. 11, pp. 612–613, 1979.
[15] Swapnali More , Sangita Chaudhari “Third Party Public
Auditing scheme for Cloud Storage”

Secure Data Self-Destructing with Time Constraint in Clouds

More Related Content

What's hot (17)

Similar to Secure Data Self-Destructing with Time Constraint in Clouds (20)

More from IRJET Journal (20)

Recently uploaded (20)

Secure Data Self-Destructing with Time Constraint in Clouds