Secret Sharing Based Securing Online Banking Transactions

0*
Professor, Department of Computer Engineering, G. H. Raisoni College of Engineering and Management, Pune, India.
Periodicity:September - November'2016
DOI : https://doi.org/10.26634/jit.5.4.10331

Abstract

Nowadays, file sharing and communication is mostly dependent on internet. The proposed system is an application by which the user performs shopping using a shopping portal and pays the bill to the service provider through a banking server. All this is done using server and virtual nodes. The security is provided to bank information and personal information by active bundles. The identity management receives request from customer and then requests the server to generate the active key. This technique introduces new techniques of messaging, file transfer and exchange of media using secrets that will take the help of internet. By sharing range, the system can easily connect one smart-phone to another for messaging without using data plan that is provided by Internet Service Providers. The Proposed System lets us provide security to the data provided by client to the server application. The major advantage of proposed system is to transfer information with security.

Keywords

Service Provider, Identity Management, Internet Banking, Secret Sharing, Security

How to Cite this Article?

Wagh. K. S (2016), “Secret Sharing Based Securing Online Banking Transactions”. i-manager’s Journal on Information Technology, 5(4), 1-4. https://doi.org/10.26634/jit.5.4.10331

References

[1]. Ruchira Naskar and Indranil Sengupta, (2010). “Secret sharing and Proactive Renewal of Shares in Hierarchical Groups”. International Technology, Vol. 2, No. 3, pp. 160-179.
[2]. Adi Shamir (1979). “How to share a secret?”. Communications of ACM, Vol. 22(11), pp. 612-613.
[3]. Ed Dawson and Diane Donovan, (1994). “The breadth of Shamirs secret sharing scheme”. Computers and Security, Vol. 13, pp. 69-78
[4]. L. Zhou, F.B. Schneider, and R. Van Renesse, (2005). “APSS: Proactive secret sharing in asynchronous systems”. TISSEC, Vol. 8, No. 3, pp. 259-286.
[5]. Ronald L. Rivest, and Yael Tauman, (1978). “Group Signature”. pp. 554-567.
[6]. Massoud Hadian Dehkordi, and Samaneh Mashhadi, (2008). “Variable secret sharing schemes based on non-homogenous linear recursions and elliptic curves”. Computer Communications, Vol. 31, pp. 1777- 1784.
[7]. Y. Zhang and D. Feng, (2008). “An active storage nd system for high performance computing”. In Proc. 22 Int. Conf. Advanced Information Networking and Applications (AINA), pp. 644–651.
[8]. B. Chor, S. Goldwasser, and B. Awerbuch, (1985). “Verifiable secret sharing and achieving simultaneity in th the resence of of faults”, Proceedings of the 25 Annual Symposium on Foundations of Computer Science, pp. 383-395.
[9]. R. Geambasu, T. Kohno, A. Levy, and H.M. Levy, (2009). “Vanish: Increasing data privacy with selfdestructing data”. In Proc. USENIX Security Symp., Montreal, Canada, pp. 299–315.
[10]. A. Beimel, N. Livne, and C. Padro, (2008). “Matroids can be far from ideal secret sharing”. In Proc. of the Fifth Theory of Cryptography Conference TCC 2008, Vol. 4948, pp. 194-212.
[11]. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, (1995). “Proactive Secret Sharing or: How to cope with perpetual leakage”. CRYPTO LNCS 963, Springer-Verlag, pp.339-352.
[12]. T. Tassa, (2011). “Generalized oblivious transfer by secret sharing”. Designs, Codes and Cryptography, Vol. 58.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.