e-ISSN (O): 2348-4470

Scientific Journal of Impact Factor (SJIF): 4.72

p-ISSN (P): 2348-6406

International Journal of Advance Engineering and Research

Development
Volume 4, Issue 2, February -2017

Identity-Based Broadcast Proxy Conditional Re-Encryption

And Its Application To Cloud Email
Mukesh More1, Smita Wangikar2, Rupali Gawande3
1,2,3
Department of Information Technology, Marathwada Mitra Mandals, College of Engineering, Pune.

Abstract This Recently, variety of extended Proxy Re-Encryptions (PRE), e.g. Conditional (CPRE), identity-based
PRE (IPRE) and broadcast PRE (BPRE), are projected for versatile applications. By incorporating CPRE, IPRE and
BPRE, this paper proposes a flexible primitive noted as conditional identity-based broadcast PRE (CIBPRE) and
formalizes its linguistics security. CIBPRE permits a sender to encode a message to multiple receivers by specifying these
receivers identities, and therefore the sender will delegate a re-encryption key to a proxy so he will convert the initial
cipher-text into a replacement one to a replacement set of meant receivers. Moreover, the re-encryption key is related to a
condition such solely the matching cipher-texts is re-encrypted, that permits the first sender to enforce access
management over his remote cipher-texts in a very fine-grained manner. we tend to propose associate economical
CIBPRE theme with obvious security. Within the instantiated theme, the initial cipher-text, the re-encrypted cipher-text
and therefore the re-encryption key area unit dead constant size, and therefore the parameters to come up with a re-
encryption key area unit freelance of the first receivers of any initial cipher-text. Finally, we tend to show associate
application of our CIBPRE to secure cloud email system advantageous over existing secure email systems supported
Pretty sensible Privacy protocol or identity-based coding.

Keywords - Proxy re-encryption, cloud storage, identity-based encryption, broadcast encryption, secure cloud email

I. INTRODUCTION

Proxy re-encryption (PRE) [1] provides a secure and versatile method for a sender to store and share
information. A user may code his file together with his own public key then store the cipher-text in AN honest-but-
curious server. When the receiver is set, the sender will delegate a re-encryption key related to the receiver to the server
as a proxy. Then the proxy re-encrypts the initial cipher-text to the intended receiver.

Finally, the receiver will rewrite the resulting cipher-text together with her personal key. the protection of PRE
typically assures that neither the server/proxy nor non-intended receivers will learn any helpful info about the (re-
)encrypted file, and before receiving the re-encryption key, the proxy cannot re-encrypt the initial cipher-text during a
meaty approach. Efforts are created to equip PRE with versatile capabilities. The early PRE was projected within the
ancient public- key infrastructure setting that incurs difficult certificate management to alleviate from this downside,
several identity-based PRE (IPRE) schemes were projected in order that the receivers recognizable identities will
function public keys. rather than taking and verifying the receivers certificates, the sender and also the proxy just have to
be compelled to recognize the receivers identities, that is additional convenient in follow.

PRE and IPRE permits one receiver. If there square measure a lot of receivers, the system must invoke PRE or IPRE
multiple times. to deal with this issue, the construct of broadcast PRE (BPRE) has been planned [9]. BPRE works during
a similar way as PRE and IPRE however a lot of versatile. In distinction, BPRE allows a sender to get AN initial cipher-
text to a receiver set, rather than one receiver. Further, the sender will delegate a re-encryption key related to another
receiver set so that the proxy will re-encrypt to.

The on top of PRE schemes solely permits the re-encryption procedure is dead in AN all-or-nothing manner. The
proxy will either re-encrypt all the initial cipher-texts or none of them. This coarse-gained management over cipher-texts
to be re-encrypted could limit the appliance of PRE systems. To fill this gap, a refined construct stated as conditional
PRE (CPRE) has been planned. In CPRE schemes a sender will enforce fine-grained re-encryption management over his
initial cipher-texts. The sender achieves this goal by associating a condition with a re-encryption key. solely the cipher-
texts meeting the required condition are often re-encrypted by the proxy holding the corresponding re-encryption key.

II. LITERATURE SURVEY

1] A Type-and-Identity-Based Proxy Re-encryption

In this area, initially specify the notations utilized in this paper, examine some safe primitives utilized in our
secure deduplication. Proxy re-encryption (PRE) could be a cryptanalytic application planned by Blaze, Bleumer, and
Strauss. it's associate secret writing system with a special property in which the semi-honest third party, the proxy, will
re-encrypt cipher-texts for Alice into different cipher-texts for Bob while not victimization Alices secret key. we are able

@IJAERD-2017, All rights Reserved 282

 International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406
to classify PRE into two-way and unifacial schemes. Elias Canetti and Hohenberger formalized. the linguistics security
beneath chosen cipher-text attack for PRE, the PRECCA security. many schemes satisfy the PRE-CCA security as a two-
way or unifacial theme. However, some PRE schemes want a linear map within the standard model, and also the
different PRE schemes square measure PRE-CCA secure within the random oracle model before our work. during this
paper, we have a tendency to construct a two-way PRECCA proxy re-encryption while not linear maps within the normal
model. We study lossy trapdoor functions (LTDFs) supported the decisional Diffie-Hellman (DDH) assumption planned
by Peikert and Waters. we have a tendency to outline a brand new variant of LTDFs, re-applicable LTDFs, that square
measure specialised LTDFs for PRE, and use them for our scheme.

Advantage: It is construct a bidirectional PRECCA proxy re-encryption without bilinear maps in the standard model.

Limitation: This system scheme un enables the delegator to provide different re-encryption capabilities to the proxy
while using the same key pair.

2] A Type-and-Identity-Based Proxy Re-encryption

Recently, variety of extended Proxy Re-Encryptions (PRE), e.g. Conditional (CPRE), identity-based PRE
(IPRE) and broadcast PRE (BPRE), are projected for versatile applications. By incorporating CPRE, IPRE and BPRE,
this paper proposes a versatile primitive said as conditional identity-based broadcast PRE (CIBPRE) and formalizes its
linguistics security. CIBPRE allows a sender to encode a message to multiple receivers by specifying these receivers
identities, and therefore the sender will delegate are-encryption key to a proxy so he will convert the initial cipher-text
into a brand new one to a brand new set of meant receivers. Moreover, the re-encryption key may be related to a
condition specified solely the matching cipher-texts may be re-encrypted, that permits the original sender to enforce
access management over his remote cipher-texts in an exceedingly fine-grained manner. we tend to propose Associate in
Nursing economical CIBPRE scheme with obvious security. within the instantiated theme, the initial cipher-text, the re-
encrypted cipher-text and therefore the re-encryption key are tired constant size, and therefore the parameters to get a re-
encryption key area unit freelance of the initial receivers of any initial cipher-text. Finally, we tend to show Associate in
Nursing application of our CIBPRE to secure cloud email system advantageous over existing secure email systems
supported Pretty sensible Privacy protocol or identity-based coding.

Advantage: Our scheme enables the delegator to provide different re-encryption capabilities to the proxy while using the
same key pair.

Limitation: In this solution Alice only needs one key pair to protect her PHR data.

3] Fuzzy conditional proxy re-encryption

Author has introduced the notion of conditional proxy re-encryption (C-PRE), whereby solely the cipher-text
satisfying one condition set by Alice may be re-encrypted by the proxy. to attain a lot of fine-grained delegation on the
condition set, we tend to introduce a replacement cryptologic primitive known as fuzzy conditional proxy re-encryption
(FC-PRE) within which we tend to read conditions in C-PRE as a collection of descriptive keywords. A FC-PRE scheme
permits for a proxy with the re-encryption key for a conditional keyword set, W, to re-encrypt a cipher-text encrypted
with a conditional keyword set, W, if and providing W and W square measure near one another as measured by the set
overlap distance metric. Therefore, our system permits an exact quantity of error-tolerance within the conditions. we
tend to formalize the FC-PRE security model by incorporating the benefits in previous C-PRE. Finally, we tend to gift
AN economical construction of FC-PRE theme, and prove its CCA-security underneath the well studied decisional linear
Diffie-Hellman (DBDH) assumption within the random oracle model..

Advantages: We formalize the FC-PRE security model by incorporating the advantages in previous C-PRE. Finally, we
present an efficient construction of FC-PRE scheme, and prove its CCA-security under the well studied decisional
bilinear Diffie-Hellman (DBDH) assumption in the random oracle model.,

Limitation: One is how to construct a CCA-secure FC-PRE scheme without random oracles. Another is how to construct
FC-PRE schemes without parings.

4] Unidirectional Chosen-cipher-text Secure Proxy Re-Encryption

This paper presents the rest unidirectional proxy re-encryption schemes with chosen-cipher-text security within
the customary model (i.e. while not the random oracle idealization). The rest system demonstrably unifacial extension of
the Canetti-Hohenberger security model. As a second contribution, the paper considers a more realistic adversarial model
wherever attackers could opt for dishonest users' keys on their own. It is shown a way to modify the rest theme to attain
security within the latter state of affairs. At a moderate ex-pense, the ensuing system provides extra helpful properties
like non-interactive temporary delegations. each constructions are efficient and admit delicate complexness assumptions
in bilinear groups. just like the Canetti-Hohenberger theme, they meet a relaxed avor of chosen-cipher-text security

@IJAERD-2017, All rights Reserved 283

 International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406
introduced by Canetti, Krawczyk and Nielsen.
Advantage: We also are need our security definitions by allowing adversaries to introduce arbitrary delegatees' public
keys in the system. To the best of our knowledge, these are the rest security results in the so-called chosen key model for
the proxy re-encryption primitive.
Limitation: Many open problems still remain. One of them would be to devise secure schemes in a fully adaptive
corruption model

5] Fully-Anonymous Functional Proxy-Re-Encryption

In this paper, we have a tendency to introduce a general notion of purposeful proxy-re-encryption (F-PRE),
where a wide category of purposeful encoding (FE) is combined with proxy-re-encryption (PRE) mechanism. The PRE
encoding system ought to reveal minimal data to a proxy, especially, activity parameters of re-encryption keys and of
original cipher-texts that he manipulate is very fascinating. we have a tendency to 1st formulate such a fully-anonymous
security notion of F-PRE together with usual payload-hiding properties. We then propose the primary fully-anonymous
inner-product PRE (IP-PRE) theme, whose security is evidenced beneath the DLIN assumption and also the existence of
a powerfully unforgeable one-time signature theme within the standard model. Also, we have a tendency to propose the
primary cipher-text-policy F-PRE theme with the access structures of Okamoto-Takashima (CRYPTO 2010), that
additionally has associate namelessness property for re-encryption keys as well as payload-hiding for original and re-
encrypted cipher-texts. the safety is evidenced beneath an equivalent assumptions because the higher than IP-PRE theme
within the customary model. For these results, we have a tendency to develop novel blind delegation and mathematical
space insulation for re-encryption key basis techniques on the twin system encoding (DSE) paradigm and also the twin
pairing vector areas (DPVS) approach. These techniques appear troublesome to be accomplished by a composite-order
additive cluster DSE approach.

Advantages: In this paper first formulate such a fully anonymous security notion of F-PRE including usual payload-
hiding properties..
Limitation: It is not supported Conditional Identity-Based Broadcast Proxy Re-Encryption.

III. PROPOSED APPROACH FRAMEWORK AND DESIGN

Fig.1 Architecture of proposed system

A. Existing System

Proxy Re-Encryption (PRE) provides a secure and versatile technique for a sender to store and share knowledge.
A user might code his file along with his own public key so store the cipher-text in AN honest-but-curious server. once
the receiver is determined, the sender will delegate a re-encryption key related to the receiver to the server as a proxy.
Then the proxy re-encrypts the initial cipher-text to the supposed receiver. Finally, the receiver will decode the ensuing
cipher-text along with her personal key. the protection of PRE sometimes assures that (1) neither the server/proxy nor
non-intended receivers will learn any helpful info regarding the (re-)encrypted file, and (2) before receiving the re-
encryption key, the proxy cannot re-encrypt the initial cipher-text in an exceedingly significant means. Efforts are
created to equip PRE with versatile capabilities. the first PRE was planned within the ancient public- key infrastructure
setting that incurs sophisticated certificate management. to alleviate from this downside, many identity-based PRE
(IPRE) schemes were planned in order that the receivers recognizable identities will function public keys. rather than
taking and collateral the receivers certificates, the sender and also the proxy simply ought to grasp the receivers
identities, that is a lot of convenient in apply.

Disadvantage of Existing System:

The early PRE was proposed in the traditional public- key infrastructure setting which incurs complicated certificate
management.

@IJAERD-2017, All rights Reserved 284

 International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406
B. Proposed Work:
Proposed system tend to refine PRE by incorporating the benefits of IPRE and TPRE system, a sure key
generation center (KGC) initializes the system parameters of IBPRE, that generates non-public keys for users with
identity and TBPRE that generates non-public keys for users with time. To firmly share files to multiple receivers, a
sender will encode the files with the receivers identities and time and file-sharing conditions. If later the sender would
additionally prefer to share some files related to identical condition with alternative receivers, the sender will delegate a
re-encryption key labelled with the condition to the proxy, and therefore the parameters to come up with the re-
encryption secret's freelance of the first receivers of those files. Then the proxy will re-encrypt the initial cipher-texts
matching the condition to the ensuing receiver set.

Advantages of Proposed System:

It allows a user to share their outsourced encrypted data with others in a fine-grained manner. All IBPRE &
TBPRE users take their identities and time as public keys to encrypt data.
It avoids a user to fetch and verify other users certificates before encrypting his data.
Moreover, it allows a user to generate a broadcast cipher-text for multiple receivers and share his outsourced
encrypted data to multiple receivers in a batch manner

C. Mathematical Model:

Let S be the Whole system S= {I, P, O}

I-input
P-procedure
O-output
Input I-
M = {m1, m2 mn}
Where,
m- Files
Procedure (P) = {sendmail , attrigen, keyr, Decryment, reEncryption}
Step1 send mail(sendmail):
In this step first user select send mail on cloud so input to this step is plaintext file is select for send procedure
and converted to encrypted format and upload on cloud.
Step2 Encryption
M=M(encr)->EM
Where,
encr=encryption.
EM=Encrypted File.
EncIBBE(PKIBBE; S;m): Given PKIBBE, a set S of some identities (where jSj _ N) and a plaintext m 2 GT ,
this algorithm randomly picks k 2 Z_p, and outputs an IBBE cipher-text C =( c1; c2; c3), where c1 ( w_k,c2 )
Step 3 Decryption
DecIBBE(PKIBBE; ID;SKID
IBBE; C; S): given PKIBBE, an identity ID and its private key SKID IBBE, an IBBE cipher-text C =( c1,c2;
c3), and a set S of some identities(where jSj _ N)
ReEncPRE(PKPRE; dID-> s; C; S): Given PKPRE, are-encryption key dID!S0 j a, an initial CIBPRE cipher-
text C and a set S of some identities (where jSj _ N),this algorithm outputs a re-encrypted CIBPRE cipher-text~
C.

Step 4: Generate Encrypted index(GenInd):

In this step file keyword are taken from contains of file and this keyword index is store in encrypted format in
cloud.
Where,
GenInd=Ef(Cont)->kw.
Ef(Cont)->kw.->Enc(kw)
GenInd =Ef(Cont)->kw.->Enc(kw)
Kw=Key word of file.
Ef(Cont)=Encrypted files contains.

Step 5: Generate Indentity(indntitygen):

Input to this process is an encrypted msg and procedure to generate dentity for that msg is applied an output of
step is generated indentity of msg which provides access policy.
identitygn=EM-(indentitygen)-> EM(indentitygen)
Where,
EF(identitygen)=Identity generated for file
Output: Output of this process is msg in encrypted format.
@IJAERD-2017, All rights Reserved 285
 International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

IV. PRACTICAL RESULT AND ENVIRONMENT

A. Hardware and Software Configuration:

Hardware Requirements:
Processor - Pentium IV
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
Software Requirements:
Front End : Java
Back End: MYSQL
Tools Used : Eclipse
Operating System : Windows XP/7.
B. Result of Practical Work:
1. Encrypt - Re Encrypt Module
2. Decrypt- Re Decrypt Module.
3. Cloud Mail Module.
4. Send Mail Message Module.
5. Store Mail Message

V. CONCLUSION

In this paper, it tend to refine PRE by incorporating the benefits of IPRE and TPRE system, a sure key generation
center (KGC) initializes the system parameters of IBPRE, that generates non-public keys for users with identity and
TBPRE that generates non-public keys for users with time. To firmly share files to multiple receivers, a sender will
encode the files with the receivers identities and time and file-sharing conditions.

VII. REFERENCES

[1] Peng Xu, Tengfei Jiao, Qianhong Wu, Wei Wang, and Hai Jin, Conditional Identity-Based Broadcast Proxy Re-
Encryption and Its Application to Cloud Email IEEE TRANSACTIONS ON COMPUTERS, VOL. 65, NO. 1,
JANUARY 2016

[2] A. Boldyreva, M. Fischlin, A. Palacio, and B. Warinschi, A closer look at PKI: Security and efficiency, in Proc.
10th Int. Conf. Practice Theory Public-Key Cryptography, 2007, pp. 458475.

[3] M. Green and G. Ateniese, Identity-based proxy re-encryption in Proc. 5th Int. Conf. Appl. Cryptography Netw.
Security, 2007, pp. 288306.

[4] T. Matsuo, Proxy re-encryption systems for identity-based encryption, in Proc. 1st Int. Conf. Pairing-Based
Cryptography, 2007, pp. 247267.

[5] C.-K. Chu and W.-G. Tzeng, Identity-based proxy re-encryption without random oracles in Proc. 10th Int. Conf. Inf.
Security, 2007, pp. 189202.

[6] L. Ibraimi, Q. Tang, P. Hartel, and W. Jonker, A type-and-identity- based proxy re-encryption scheme and its
application in healthcare, in Proc. 5th VLDB Conf. Secure Data Manage., 2008, pp. 185198.

[7] J. Shao, G. Wei, Y. Ling, and M. Xie, Identity-based conditional proxy re-encryption, in Proc. IEEE Int. Conf.
Commun., 2011, pp. 15.

[8] K. Liang, Z. Liu, X. Tan, D. S. Wong, and C. Tang, A CCA-secure identity-based conditional proxy re-encryption
without random oracles, in Proc. 15th Int. Conf. Inf. Security Cryptol., 2012, pp. 231146.

[9] J. Shao and Z. Cao, CCA-secure proxy re-encryption without pairings, in Proc. 12th Int. Conf. Practice Theory
Public Key Cryptography, 2009, pp. 357176.

[10] Q. Tang, Type-based proxy re-encryption and its construction, in Proc. 9th Int. Conf. Cryptol. India: Progress
Cryptol., 2008, pp. 130144.

@IJAERD-2017, All rights Reserved 286

 International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

[11] C.-K. Chu, J. Weng, S. S. M. Chow, J. Zhou, and R. H. Deng, Conditional proxy broadcast re-encryption, in Proc.
14th Australasian Conf. Inf. Security Privacy, 2009, pp. 327342.

12] L. Fang, W. Susilo, and J. Wang, Anonymous conditional proxy re-encryption without random oracle, in Proc. 3rd
Int. Conf. Provable Security, 2009, pp. 4760.

[13]G. Ateniese, K. Fu, M. Green, and S. Hohenberger, Improved proxy re-encryption schemes with applications to
secure distributed storage, ACM Trans. Inf. Syst. Security, vol. 9, pp. 130, 2006

[14] J. Shao, P. Liu, G. Wei, and Y. Ling, Anonymous proxy re-encryption, Security Commun. Netw. vol. 5, no. 5,
2012, pp. 439449

@IJAERD-2017, All rights Reserved 287