International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 6 457 461

_______________________________________________________________________________________________

Attribute Based Encryption with Verifiable Time Stamped Decryption

Miss. Madhavi Phalak Mr. Rahul Gaikwad

M.E student, Computer department Assistant Professor, Computer department
GFs Godavari college of Engineering, Jalgaon GFs Godavari college of Engineering, Jalgaon
Jalgaon, Maharahshtra, India Jalgaon, Maharahshtra, India
madhaviphalak@gmail.com gaikwad005@gmail.com

Abstract: Numerous applications require expanded insurance of private information including access control strategies that are
cryptographically authorized. A promising utilization of ABE is adaptable get to control of scrambled information put away in the cloud,
utilizing access polices and credited traits related with private keys and ciphertexts. Productivity disadvantages of the current ABE plans is that
unscrambling includes costly matching operations and the quantity of such operations develops with the intricacy of the get to approach. The
public key generation relying upon the properties of the predetermined content to be encrypted, that will create numerous keys to be utilized to
scramble or unscramble the information. Extra private key to be included is the server time stamping with the encryption key to guarantee that
the data should not be recovered after particular timeframe. The accompanying paper is depicting a strategies showing how to apply those
technique safely and effectively to manage secret data circulated over capacity organize. Security and execution examination demonstrates the
proposed plans are provably secure and exceptionally effective.
Index Terms cryptographic protocols, ABE, Time Stamping

__________________________________________________*****_________________________________________________

I. INTRODUCTION related with both a limit parameter k and another

Traditionally, we've got viewed encryption as a technique
for one user to cipher knowledge to a different specific
targeted party, such solely the target recipient will rewrite
and browse the message. However, in several applications a
user would possibly typically want to encrypt data
consistent with some policy as opposition given set of users.
attempting to appreciate such applications on prime of a
conventional public key mechanism poses variety of
difficulties. for example, a user encrypting knowledge can
ought to have a mechanism that permits him to appear up all
parties that have access credentials or attributes that match
his policy. These difficulties square measure combined if a
partys credentials themselves can be sensitive (e.g., the set
of users with a prime SECRET clearance) or if a celebration
gains credentials well when knowledge is encrypted and
keep.
Sahai and Waters [4] presented quality based
encryption (ABE) as another methods for encryption get to
control. In a quality based encryption framework cipher
texts are not really encoded to one specific client as in
conventional open key cryptography. Rather both clients'
private keys and ciphertexts will be related with an
arrangement of traits or an approach over characteristics. A
client can unscramble a ciphertext if there is a "coordinate"
between his private key and the ciphertext. In their unique
framework Sahai and Waters introduced a Threshold ABE
framework in which ciphertexts were marked with an
arrangement of qualities S and a client's private key was
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
arrangement of characteristics S. All together for a client to
unscramble a ciphertext at any rate k traits must cover
between the ciphertext and his private keys. One of the
essential unique inspirations for this was to plan a blunder
tolerant (or Fuzzy) personality based encryption [9-11] plan
that could utilize biometric characters.
One of the fundamental productivity downsides of
the most existing ABE plans is that decoding is costly for
asset restricted gadgets because of blending operations, and
the quantity of matching operations required to unscramble
a ciphertext develops with the unpredictability of the get to
strategy. At the cost of security, just demonstrated in a
feeble model (i.e., specific security), there exist a few
expressive ABE plans [6], [7] where the unscrambling
calculation just requires a consistent number of matching
calculations. As of late, Green et al. [8] proposed a solution
for this issue by presenting the idea of ABE with outsourced
decoding, which generally takes out the unscrambling
overhead for clients. In view of the current ABE plans,
Green et al. [8] likewise gave concrete ABE plans
outsourced decoding. In these plans (allude to Fig. 1
underneath), a client gives an untrusted server, say an
intermediary worked by a cloud specialist co-op, with a
change key TK that enables the last to interpret any ABE
ciphertext CT fulfilled by that client's characteristics or get
to arrangement into a basic ciphertext CT', and it just brings
about a little overhead for the client to recuperate the
plaintext from the changed ciphertext CT'. The security
457
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 5 Issue: 6
_______________________________________________________________________________________________
property of the ABE plot with outsourced unscrambling
ensures that an enemy (counting the malignant cloud server)
be not ready to pick up anything about the scrambled
message; be that as it may, the plan gives no certification on
the accuracy of the change done by the cloud server. In the
distributed computing setting, cloud specialist organizations
may have solid money related motivations to return off base
answers, if such answers require less work and are probably
not going to be distinguished by clients.
Sahai et al. [4], [5]'s work on Attribute Based
Encryption (ABE) makes it lament to continue amass
correspondence without a gathering key. In ABE, qualities
portray certain properties, e.g., shading, size, occupation and
time and so forth.. A sender encodes a message with a get to
control approach tree which is made out of traits; a recipient
can unscramble the message the length of his/her private
key, which is issued by Key Master and contains an
arrangement of properties, fulfills the access tree.
For quick evolving group, ABE indicates
preferable flexibility over gathering key technique. Clients
who share any set of attributes (nonempty set) form a group
; the individuals who don't have a particular characteristic
are consequently barred from gatherings which are
characterized on that property. Along these lines, ABE
spares the inconvenience to issue a gathering key ahead of
time for gathering correspondence. Nonetheless, ABE
requires clients to keep their private keys (properties) up-to-
date . attribute describes properties; clients ought to refresh
their private keys at whatever point their properties change.
Say, if areas are attributes, when one moves from Westwood
Blvd. to Pico Blvd., he/she ought to refresh his/her private
key by supplanting the old trait which remains for
Westwood Blvd. with another characteristic which remains
for Pico Blvd.. By the by, refreshing private
keys/characteristics is not basic for the reason that even
there is just a single ascribe should have been refreshed, the
entire private key, which contains every one of the
attributes, must be refreshed.
Fig. 1 Private key associated with attribute key
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
457 461
On the off chance that that a client's private key has
many characteristics, refreshing causes a considerable
measure of overhead. Permitting single trait refresh, which
implies transforming one property in the private key does
not influence different qualities, may bring a few
advantages: Key Master produces less properties by dodging
recovery; less updates likewise mean less data transfer
capacity taken a toll and shorter contact time.
Fig. 1 gives a case of CPABE. The approach tree is
made out of three distinct traits while every private key has
three characteristics in it. In this illustration, Sarah can
decode the message encoded with this arrangement tree
while Kevin can't
II. RELATED WORK
There are some different methods accessible for the
characteristic based encryption portrayal innovation. It
incorporates Concrete Attribute - Based Encryption Scheme
with Verifiable Outsourced Decryption in which the
attention is on the diminishing the overheads of decoding
procedure show inside the conventional approach. Another
approach portrayed in paper titled Lock-In to the Meta
Cloud with Attribute Based Encryption With Outsourced
Decryption is it does by far most of the work to encode a
message or make a mystery key before it knows the message
or the trait list/get to control strategy that will be utilized (or
even the measure of the rundown or policy). A moment
stage can then quickly assembles an ABE figure or key
when the species end up plainly known. This idea is once in
a while called as online encryption when just the message is
obscure amid the planning stage; we take note of that the
expansion of obscure property records and get to approaches
makes ABE altogether additionally difficult.
There are several researchers operating towards the safety of
the information hold on within the clouds. more analysis
goes on so as to create the knowledge hold on in encrypted
form. several researchers introduces the technique to encrypt
data and acquire is decrypted as and once it's to be accessed
by a number of the users thought-about as valid users to
access the encrypted information. Albeit the data is get
accessed by some unauthenticated user it becomes tough to
decrypt it and acquire correct information. During this
regard I even have well-versed a number of white papers
describing the knowledge as per demand within the space of
security of knowledge hold on within the cloud.
Amit Sahai and Water[1]s at university of
American state loss Angeles expressed within the paper
Entitled Fuzzy Identity primarily
basedEncryptionconcerningthe fuzz Identity primarily based
cryptography containing a non-public key as Associate in
Nursing identity and a cipher text to be accustomed decode
beside fuzzy identity key price. This system provides US
458
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 5 Issue: 6
_______________________________________________________________________________________________
plan concerning implementing the attribute base data
system.
Katsuyuki Takashima[2] at Mitsubishi electrical in his paper
concerning absolutely Secure useful encryption with
General Relations from the Decisional Linear Assumption
specifies the theme concerning the useful cryptography giant
category of relations supported non monotonous relations
present within the product info. Study of this paper provided
US the concept concerning the precise attribute related to
data|the knowledge|the data} and its relation with the
particular information. The planned scheme consists of
enormous contribution concerning this paper.
Minu Saint George and C. Suresh Gnanadhas[3]
writes within the Journal of Engineering and knowledge
domain Research: 2014 concerning the Cipher Text Policy
Attribute primarily basedcryptography with Heuristics on
Cloud Server concerning the general public key for data
cryptographyand decryption of using the attribute based info
and cloud encryption and decryption. This paper
additionally describes the importance of access policies and
attributes association. The importance of use of attribute
primarily based public key for securing information hold on
in cloud will be highlighted with this report revealed in
international journal.
III. PROPOSED WORK
ABE comes in two flavors called key-arrangement
ABE (KP-ABE) and ciphertextpolicy ABE (CP-ABE). In
KP-ABE, the encryptor just gets the opportunity to name a
ciphertext with an attribute set . The key specialist picks an
approach for every client that figures out which ciphertexts
he can decode and issues the way to every client by inserting
the arrangement into the client's critical. Nonetheless, the
parts of the ciphertexts and keys are turned around in CP-
ABE. In CP-ABE, the ciphertext is scrambled with a get to
arrangement picked by an encryptor, yet a key is basically
made regarding a traits set. CP-ABE is more fitting to DTNs
than KP-ABE in light of the fact that it empowers
encryptors, for example, an administrator to pick a get to
approach on ascribes and to scramble secret information
under the get to structure by means of encoding with the
relating open keys or characteristics. Blending Delegation:
Pairing designation [12], [13] empowers a customer to
outsource the calculation of parings to another substance. In
any case, the plans proposed in [12], [13] still require the
customer to figure various exponentiations in the objective
gathering for each blending it outsources. Above all, when
utilizing paring appointment in the decoding of ABE
ciphertexts, the measure of calculation of the customer is as
yet corresponding to the extent of the get to strategy. Tsang
et al. [14] consider clump matching assignment. In any case,
the plan proposed in [14] can just deal with cluster
designation for pairings in which one of the focuses is a
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
457 461
consistent despite everything it requires the customer to
figure a blending.
Proxy Reencryption: In ABE with outsourced decryption, a
user provides the cloud with a change key that enables the
cloud to translate an ABE ciphertext on message into a
straightforward ciphertext on an equivalent M , while not
learning something regarding M . this can be paying homage
to the construct of proxy reencryption [15], [16]. Proxy
reencryption permits a proxy, employing a reencryption key,
to rework an encryption of M under Alices public key into
an encryption of an equivalent M below Bobs public key
while not the proxy learning something regarding the
encrypted message . we tend to emphasize that within the
model of proxy reencryption, verifiability of the proxys
transformation can not be achieved. this will be in brief
explained as follows. A proxy may replace the secret writing
of M below Alices public key with the encryption of
another message M below Alices public key then use its
reencryption key to transform the latter into an encryption of
M under Bobs public key. Obviously, while not interaction
with Alice, Bob cannot observe this malicious behavior of
the proxy.
We have executed the ABE strategy utilizing CP-
ABE encryption procedure. Executed strategy comprise of
four major calculations: Setup, Encrypt, KeyGen, and
Decrypt. Moreover, they take into consideration the choice
for time stamping.
1) Setup: The setup algorithm takes no input other than the
implicit security parameter. It outputs the public parameters
PK and a master key MK.
2) Encrypt(PK,M,A): The encryption algorithm takes as
input the public parameters PK, a message M, and an access
structure A over the universe ofattributes. The algorithm
will encrypt M and produce a ciphertext CT such that only a
user that possesses a set of attributes that satisfies the access
structure will be able to decrypt the message. They assumed
that the ciphertext implicitly contains A.
3) Key Generation(MK, S): The key generation algorithm
takes as input the master key MK and a set of attributes S
that describe the key. It outputs a private key SK.
4) Decrypt(PK,CT, SK): The decryption algorithm takes as
input the public parameters PK, a ciphertext CT, which
contains an access policy A, and a private key SK, which is
a private key for a set S of attributes. If the set S of attributes
satisfies the access structure A then the algorithm will
decrypt the ciphertext and return a message
M.
Here setup section outputs PK, M. Using PK, M, s
(s is that the attribute value) , keygenration algorithmic rule
can generate SK for user. And so using Secrete key the text
are encrypted referred to as CT. For correctness, we tend to
need thefollowing to hold:
459
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 457 461
_______________________________________________________________________________________________
1) If the s set of attributes satisfies the access Step 2: Extract SK (secrete key) and Generate the SK.
structure, then M are retrieved by decrypted. If found matching then use this key to decrypt the
2) Otherwise, decrypt algorithmic rule outputs the information
error. Step 3: Extract time zone value for the information
decrypted
Point by point execution Method : Step 4: If found within the time limit then extract the
The whole Attribute based Encryption decoding calculation information
should be isolated into to four stages for the usage reason. Step 5: Decrypt the information.
Taking after is the depiction of each stage.
Stage 1: Setup Phase is capable to confirm the client getting Here, in this implemented work we have tried to
to the best possible accreditation and might open key to be improve the security over cloud data storage. Though user
utilized for the encryption reason. have provided encryption strategy over the data files stored
Step 1: m chooses a group G of prime order p and a over cloud network, hacker have many tricky idea to hack
generator g. the file, and it will be the easier task if he hack the
Step 2: choose for every attribute ai where 1 i n, the encryption key of the user for that file. Hence, we have
authority generates random value {ai, t * Z p } 1 t implemented this work with the help of time stamping for
ni and computes {T i, t = i t a g , } 1 t ni decryption. As the file time period over network gets
Step 3: Compute Y = e (g,g) where elapsed the file will never be downloaded and decrypted by
Step 4: The public key PK consists of [Y,p,G,G1 ,e that key. So it will restrict the files living period on cloud
,{{T i,t } 1 t ni }1 i n] server.
Step 5: Get the local time zone value and use it as
another private key IV. RESULT AND DISCUSSION
Stage 2: Is responsible for generation of key to be used for To understand the Implemented System, We have
the encryption purpose using the master key generated in the provided following some screen shot of implemented
earlier phase. system. Here as shown in fig.2 we have taken some of the
Step 1: Read the Master Key (PK) inputs from user as his attribute values. By using these
Step 2: Prepare the attribute list from the information to Attribute values we generate the secrete key for user. Using
be encrypted / decrypted. this key the file will be encrypted. Then as shown in fig.3
Step 3: Select the random value from trusted authority we have asked to user for the time period in days which
and compute D0 become the living period of that file.
Step 4: Now for I = 1 to N compute D1 D2 D3 Dn
Stage 3: Actually encrypts the information using the
generated keys based on the attribute.
Step 1: Read Original Message
Step 2: Read cipher text
Step 3: Select s * Z p and compute C0=g s and C~ =
M. Ys = M.e (g, g)s
Step 4: Set the root node of W to be s, mark all child
nodes as un-assigned, and mark the root node assigned.
Step 5: Execute step no 6, 7, and 8
Step 6: If the symbol is /\ and its child nodes are
unassigned, we assign a random value si , 1 si p-1
and to the last child node assign the value
Fig. 2 Attributes input from user
Step 7: If the symbol is \/, set the values of each node to
be s. Mark this node assigned.
As user has given 8 days as its time stamp, that
Step 8: Each leaf attribute ai can take any possible multi
file will not be decrypted after u8 days. That secrete key will
values; the value of the share si is distributed to those
be expired for that file. This scenario is explained over the
values and compute
chart by comparing existing system without timestamp and
Stage 4: This is the part of the proposed scheme where you
our implemented work with timestamp. File cannot be
can get back the information encrypted using attribute based
decrypted after 8 days.
encryption algorithm. This phase is responsible to extract
the original information.
Step 1: Get the encrypted text from authenticated user.
460
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 5 Issue: 6
_______________________________________________________________________________________________
Fig. 3 User will be asked for Time stamping file
With the Help of above example we have analyze
the existing system without time stamp and our proposed
system with time stamp at the time of encryption. The
following chart shows the comparison. We cant decrypt
that file after given time elapsed.
Fig.4 Comparison for Existing system without timestamp
and proposed System with timestamp
V. CONCLUSION
In this plan I have considered another necessity of
characteristic based encryption that is time stamping. We
altered the first model of ABE with unquestionable
outsourced decoding to incorporate time stamping idea for
better security. The proposed strategy is by all accounts
more secure than whatever other technique utilized for
encrypted data. This should be the new data security bolt
exhibited for the cloud administrations. we have executed
this work with the assistance of time stamping for decoding.
As the document day and age over system gets passed the
record will never be downloaded and decoded by that key.
So it will limit the documents living period on cloud server.
Consequently, Fast encryption and in addition unscrambling
should be conceivable with this strategy. This paper presents
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
457 461
you the well ordered approach towards the characteristic
based encryption with time stamping.
REFERENCES
[1] Amit Sahai and Brent Waters: Fuzzy Identity based encryption
published in Advances in Cryptology EUROCRYPT 2005
Lecture Notes in Computer Science Volume 3494, 2005, pp
457-473
[2] Katsuyuki Takashima at Mitsubishi Electric : Fully Secure
Functional Encryption with General Relations from the
Decisional Linear Assumption published in 30th annual
conference on Advances in cryptology Pages 191-208.
[3] Minu George and C. Suresh Gnanadhas writes in the Journal of
Engineering and Interdisciplinary Research: 2014 about the
Cipher Text Policy Attribute Based Encryption with Heuristics
on Cloud Server about the public key for data encryption and
decryption of using the attribute based information and cloud
encryption and decryption
[4] A. Sahai and B. Waters. Fuzzy Identity Based Encryption. In
Advances in Cryptology C Eurocrypt, volume 3494 of LNCS,
pages 457C473, Springer, 2005.
[5] V. Goyal, O. Pandey, A. Sahai, and B. Waters. Attribute Based
Encryption for Fine-Grained Access Conrol of Encrypted Data.
In ACM conference on Computer and Communications
Security (ACM CCS), 2006.
[6] N. Attrapadung, J. Herranz, F. Laguillaumie, B. Libert, E. de
Panafieu, and C. Rfols, Attribute-based encryption schemes
with constant-size ciphertexts, Theor. Comput. Sci., vol. 422,
pp. 1538, 2012.
[7] S. Hohenberger and B. Waters, Attribute-based encryption
with fast decryption, in Proc. Public Key Cryptography, 2013,
pp. 162179.
[8] M. Green, S. Hohenberger, and B.Waters, Outsourcing the
decryption of ABE ciphertexts, in Proc. USENIX Security
Symp., San Francisco, CA, USA, 2011.
[9] J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy
attribute based encryption. In proceedings of the 28th IEEE
Symposium on Security and Privacy, Oakland, 2007.
[10] A. Shamir. How to share a secret. Commun. ACM,
22(11):612C613, 1979.
[11] A. Shamir. Identity Based Cryptosystems and Signature
Schemes. In Advances in Cryptology CCRYPTO, volume 196
of LNCS, pages 37C53. Springer, 1984.
[12] B. Chevallier-Mames, J.-S. Coron, N. McCullagh, D.
Naccache, and M. Scott, Secure delegation of elliptic-curve
pairing, in Proc. CARDIS, 2010, pp. 2435.
[13] B. G. Kang, M. S. Lee, and J. H. Park, Efficient delegation of
pairing computation, IACR Cryptology ePrint Archive, vol.
2005, p. 259, 2005.
[14] P. P. Tsang, S. S. M. Chow, and S. W. Smith, Batch pairing
delegation, in Proc. IWSEC, 2007, pp. 7490.
[15] G. Ateniese, K. Fu, M. Green, and S. Hohenberger, Improved
proxy re-encryption schemes with applications to secure
distributed storage, in Proc. NDSS, San Diego, CA, USA,
2005.
[16] A. Beimel, Secure Schemes for Secret Sharing and Key
Distribution, Ph.D. dissertation, Israel Inst. of Technology,
Technion City, Haifa, Israel, 1996.
461