Data distribution is not at all easier with the progress of cloud computing, and an exact examination on the shared data offers a collection of profits both to the the public and individuals. Data distribution with a huge number of applicants must get into account numerous issues, counting effectiveness, data integrity and confidentiality of data owner. Ring signature is a capable applicant to build an unsigned and genuine data sharing system. It lets a data owner to secretly authenticate his data which can be set into the cloud for storage or scrutiny purpose. so far the expensive certificate authentication in the conventional public key infrastructure (PKI) surroundings becomes a restricted access for this solution to be scalable. Identity-based (ID-based) ring signature, which eradicates the method of certificate verification, can be utilized instead. In this paper, we additionally improve the safety of ID-based ring signature by giving advance security: If a secret key of any user has been compromise, all earlier produced signatures that contain this user still remains legal. This property is particularly significant to any huge scale data distribution system, since it is unfeasible to request all data owners to re-authenticate their data still if a secret key of one single user has been compromised. We offer an actual and well-organized instantiation of our scheme, demonstrate its safety and supply an accomplishment to illustrate its realism.

C.Praveen Kumar,P Suman Prakash,Dr.S.Prem Kumar."Cost-Effective Authentic and Anonymous Data Sharing with Forward Security". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1126-1131, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1255.pdf,

[1] M. Abe, M. Ohkubo, and K. Suzuki, “1-out-ofn signatures from a variety of keys,” in Proc. 8th Int. Conf. Theory Appl. Cryptol. Inform. Security: Adv. Cryptol., 2002, vol. 2501, pp. 415–432. 
[2] R. Anderson, “Two remarks on public-key cryptology,” Manu-script, Sep. 2000. (Relevant material presented by the author in an invited lecture at the Fourth ACM Conference on Computer and Communications Security, 1997.)
 [3] G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, “A practical and provably secure coalition-resistant group signature scheme,” in Proc. 20th Annu. Int. Cryptol. Conf. Adv. Cryptol., 2000, vol. 1880, pp. 255–270. 
[4] M. H. Au, J. K. Liu, T. H. Yuen, and D. S. Wong, “ID-based ring signature scheme secure in the standard model,” in Proc. 1st Int. Workshop Security Adv. Inform. Comput. Security, 2006, vol. 4266, pp. 1-16
 [5] A. K. Awasthi and S. Lal, “Id-based ring signature and proxy ring signature schemes from bilinear pairings,” CoRR, vol. abs/cs/ 0504097, 2005. 
[6] M. Bellare, D. Micciancio, and B. Warinschi, “Foundations of group signatures: Formal definitions, simplified requirements and a construction based on general assumptions,” in Proc. 22nd Int. Conf. Theory Appl. Cryptographic Techn., 2003, vol. 2656, pp 614– 629
 [7] M. Bellare and S. Miner, “A forward-secure digital signature scheme,” in Proc. 19th Annu. Int. Cryptol. Conf., 1999, vol. 1666, 
[8] J.-M. Bohli, N. Gruschka, M. Jensen, L. L. Iacono, and N. Marnau, “Security and privacy-enhancing multicloud architectures,” IEEE Trans. Dependable Sec. Comput., vol. 10, no. 4, pp. 212–224, Jul. \Aug. 2013. 
[9] A. Boldyreva, “Efficient threshold signature, multisignature and blind signature schemes based on the gap Diffie-Hellman group signature scheme,” in Proc. 6th Int. Workshop Theory Practice PublicKey Cryptography: Public Key Cryptography, 2003, vol. 567, pp. 31–46. 
[10] D. Boneh, X. Boyen, and H. Shacham, “Short group signatures,” in Proc. Annu. Int. Cryptol. Conf. Adv. Cryptol., 2004, vol. 3152, pp. 41–55. 
[11] E. Bresson, J. Stern, and M. Szydlo, “Threshold ring signatures and applications to ad-hoc groups,” in Proc. 22nd Annu. Int. Cryp-tol. Conf. Adv. Cryptol., 2002, vol. 2442, pp. 465–480. [12] J. Camenisch, “Efficient and generalized group signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 1997, vol. 1233, pp. 465–479. 
[13] N. Chandran, J. Groth, and A. Sahai, “Ring signatures of sub-linear size without random oracles,” in Proc. 34th Int. Colloq. Automata, Lang. Programming, 2007, vol. 4596, pp. 423– 434. 
[14] K. Chard, K. Bubendorfer, S. Caton, and O. F. Rana, “Social cloud computing: A vision for socially motivated resource sharing,” IEEE Trans.Serv.Comput.,vol.5,no.4,pp.551– 563,FourthQuarter2012. 
[15] D. Chaum and E. van Heyst, “Group signatures,” in Proc. Work-shop Theory Appl. Cryptographic Techn., 1991, vol. 547, pp. 257– 265. 
[16] L. Chen, C. Kudla, and K. G. Paterson, “Concurrent signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 287–305. 
[17] H.-Y. Chien, “Highly efficient ID-based ring signature from pairings,” in Proc. IEEE AsiaPacific Serv. Comput. Conf., 2008, pp. 829–834. 
[18] S. S. Chow, R. W. Lui, L. C. Hui, and S. Yiu, “Identity based ring signature: Why, how and what next,” in Proc. 2nd Eur. Public Key Infrastructure Workshop, 2005, vol. 3545, pp. 144–161. 
[19] S. S. M. Chow, V.K.-W. Wei, J. K. Liu, and T. H. Yuen, “Ring sig-natures without random oracles,” in Proc. ACM Symp. Inform., Comput., Commun. Security, 2006, pp. 297– 302. 
[20] S. S. M. Chow, S.-M. Yiu, and L. C. K. Hui, “Efficient identity based ring signature,” in Proc. 3rd Int. Conf. Appl. Cryptography Netw. Security, 2005, vol. 3531, pp. 499–512. 
[21] R. Cramer, I. Damgard, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Proc. 14th Annu. Int. Cryptol. Conf. Adv. Cryptol., 1994, vol. 839, pp. 174–187. 
[22] R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” in Proc. ACM Conf. Comput. Commun. Security, 1999, pp. 46–51. 
[23] Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, “Anonymous identification in Ad Hoc groups,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 609–626. 
[24] A. L. Ferrara, M. Green, S. Hohenberger, and M. Ø. Pedersen. (2009). Practical short signature batch verification,” in Proc. Cryptographers’ Track RSA Conf. Topics Cryptol., vol. 5473, pp. 309– 324 [Online]. Available: http://eprint.iacr.org/2008/015 
[25] J. Han, Q. Xu, and G. Chen, “Efficient IDbased threshold ring sig-nature scheme,” in Proc. IEEE/IFIP Int. Conf. Embedded Ubiquitous Comput., 2008, pp. 437–442.