DOCSLIB.ORG

Implementation of Visual and Quantum Cryptography Techniques for Secure Information Flow in Content Delivery Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Implementation of Visual and Quantum Cryptography Techniques for Secure Information Flow in Content Delivery Networks Implementation of Visual and Quantum Cryptography techniques for Secure Information Flow in Content Delivery Networks P. JAGADEESWARA RAO1, P. SUNITHA2, CH. RUPA3, V. SANDHYA4 1 2Assistant Professor, Department of computer science & engineering, 2 Scholars, JNTUK 2 3 4 Dhanekula Institute of Engineering & Technology, Vijayawada. 3Professor, VR Siddhartha Engineering College, Vijayawada. Abstract— Steganography, a science of visual 1. INTRODUCTION cryptography, was historically originated to write Steganography is the field of research that utilizes a secret message and it was impossible to be the insensitivity of the human sense organs revealed, Though Steganography is an old (sensory redundancy) and multimedia signal concept it is a powerful one and can be practiced inherent redundancy (data redundancy) to hide where long classical secret keys need to be the secret message in a carrier signal. avoided and sense of simplicity while strong Steganography hides the fact of communicating cryptography is vital. One of the biggest and therefore it is a good choice of secure challenges of Steganography and other Visual communication. Steganography message can be Cryptography techniques is that an attacker in the retrieved by reverse Steganography middle can hijack the image and forward a fake image. This again means that we need large However one problem of Steganography and classical keys or so to secure the channel. other visual cryptography techniques [3] is that However large keys are no longer going to be there can be an eavesdropper Eve between two suitable for future next generation networks as users, Alice and Bob, and Eve can hijack the they require light weight key distribution systems image taken from Alice and forward a fake image which are also free from eavesdropping. Besides, to Bob. Again it means we need a key to secure in recent studies it is suggested that in near future the channel. However if we think of symmetric quantum computers would be able to break keys, large keys are no longer going to be suitable classical cryptographic techniques such as RSA. for future next generation networks as it With quantum computers, quantum cryptography essentially requires light weight key distribution also came into light and now seems to be systems and it also has to be free from promising based on its unique features that make eavesdropping. Besides, some recent studies such it free from eavesdropping or any other third as Shor’s algorithm also suggest that in near party intrusion in the key distribution system. Our future quantum computers can break the paper proposes a technique where we show how factorization problems in classical cryptographic an old technique such as Steganography can be techniques such as RSA [2]. promising when we combine it with the unique Following that Quantum Cryptography came key distribution mechanism of Quantum in town and now based on its unique features such Cryptography with some other additional security as non-clone ability or non-copying properties, it features. promises establishing a channel free from Keywords—Steganography, Visual Cryptography, eavesdropping as discussed later or any other Quantum Cryptography, Image hijacking intrusion in its key distribution mechanism [1][5]. Thus such unique properties of Quantum As can been seen from the above figure not all Cryptography make it a potential key distribution 8-bit value’s last bit needed to be changed as technique for the future generation networks as some were the same with the original bit value. well. As can be seen only the maroon bits (with 1) and Therefore, our paper focuses on proposing yellow bits (with 0) had to be changed. Therefore mechanism which combines an old technique if we consider in the worst case all 32 bits needed such as Steganography with the unique key to be inserted one after another as the last bits for distribution mechanism of Quantum each pixel’s bytes which would make about 32 of Cryptography. Besides, some additional features those 8*3*11 =264 (about 12%). are also proposed to make a strong information However in this case we needed to flow channel between two next generation change only 15 of 264 bits (less than 6%) [8], the networks primarily with a focus on fast and unaltered and altered image is shown in Fig. 2. efficient QoS providing networks such as Content Now when we consider a fairly small image of Delivery Networks. 240*160 pixels with each pixel having 24 bits composed of RGB, we get 240*160*24 = 921600 II. RELATED WORKS bits the hidden message becomes even a smaller A. Steganography in Practice portion and hard to identify at all. Steganography strips less important information from digital content and inserts hidden data in its place. This is done over the spectrum of the entire image. One of the ways it is practiced is described as follows. As shown in Fig. 1, a small message called “Aha!” is hidden in a dark green background composed of dark green pixels. A dark green pixel can be Fig. 2. Hidden image before and after altering with represented by three 8-bit values for the three Steganography. colours, Red, Green and Blue (RGB). In this case, the last bit of each 8-bit value is replaced by the B. Key Distribution with Quantum Cryptography consecutive bit value of the message “Aha!” The In physics, a photon is considered as the following Fig. 1 shows how it is done in practice. smallest particle of light which is usually unpolarized. It can be polarized by 2 kinds of filters to make it spin steady which are namely the cross and diagonal filter. The cross filter filters out photons with (|) and (--) polarization. The diagonal filter filters out photons with (/) and ( ) polarization. (|), (--), (/) and () can be assigned logic bits 0 and 1 in agreement. In this case the logic bits 1 and 0 are rather replaced with photons polarization and can be considered as qubits (quantum bits) [2][5]. There are three unique features of qubits as follows: 1) If a qubits is filtered with the wrong filter type Fig. 1. Steganography Mechanism. or copied, the photon’s polarization is destroyed. 2) Qubits can be in two opposite states at the forward it to the other party. On the other hand same time. the eavesdropper doesn’t now the filter basis to 3) To read information of qubits we need to be used to measure the photons. In that case only measure it and results of measurement are 50% time the eavesdropper will get the right always probabilistic. result and can only forward the result of the photons to the other party which will again have another 50% possibility to get right result. When some test bits are matched with the shared filter basis very few results will match due to the eavesdropping in the middle. This part is discussed in the analysis section of our paper. III. PROPOSED MECHANISM Our proposed mechanism focuses on combining the old image concepts of Steganography with the new concepts of Quantum Cryptography in terms of establishing a secure channel free from eavesdropping. The idea lies in first establishing a Service Level Agreement (SLA) between the two active Fig. 3. Photos polarization and translation into keys Content Delivery Networks, say for example [2]. between CDN1 and CDN2. The Service Level In quantum cryptography the secret key bits Agreements includes the image type, for example are sent as qubits (which is basically the spin of a meaningful image of a ship or so, and the angle the photon). So for example, four logical of the image in which the image is encrypted and impressions can be derived from the four possible needs to be decrypted on the other side. Next the qubits states as shown in Fig. 4 [2]. two CDNs authenticate each other by exchanging the quantum generated photon based key which the other CDN acknowledges. When CDN1 wants to send the image it sends the meaningful image in accordance to the SLA with the secret quantum key randomly distributed into the image which was previously exchanged and agreed upon. Then CDN2 can acknowledge and verify the image based on the image type, angle and secret quantum key embedded in the image. In the case where CDN1 sends an image and an attacker captures the image in the middle and forwards a fake image to CDN2, CDN2 may receive some message but the quantum secret key will ensure that the image is not the real image sent from CDN1. The above procedure is demonstrated as Fig. 4. Qubits states and logical impressions. follows in Fig. 5. As described in the first feature, an eavesdropper cannot just copy a photon and generated in a completely secure quantum mode free from eavesdropping or any other intrusion in the middle. IV. ANALYSIS AND SIMULATION In general, in case of a quantum key distribution CDN2 has to measure the qubits with a random filter which can be either cross or diagonal. And there will be about 50% possibility that CDN2 will guess the right filter as the qubits can be either cross or diagonal both with equal probabilities. To check whether CDN2 has got the right qubits, 25% of those 50% matched filter’s qubits will be shared between the two CDNs as test bits. Out of this 25% if less than a certain threshold, say for example 30% bits don’t match, then eavesdropping can be assumed to have happened. This is because an eavesdropper Fig. 5. Proposed mechanism of information flow cannot just forward the qubits due to the non- between two CDNs. clone ability property of qubits. Therefore the Therefore, as explained in the above eavesdropper can only forward the measurement diagram, CDN2 first need to check with the of the qubits which will also be about 50% previously agreed SLA terms and information correct.
Load more

Recommended publications
  • Attestation Using Visual Cryptography (3,3) Scheme International Journal
    ISSN 2347 - 3983 Volume 8. No. 3, March 2020 Dodda Pratap Roy et al., International Journal of Emerging Trends in Engineering Research, 8(3), March 2020, 645- 651 International Journal of Emerging Trends in Engineering Research Available Online at http://www.warse.org/IJETER/static/pdf/file/ijeter06832020.pdf https://doi.org/10.30534/ijeter/2020/06832020 Attestation Using Visual Cryptography (3,3) Scheme Dodda Pratap Roy1, Dr. M Jaya Bhaskar2 1 M. Tech Student, Department of CSE (Cyber Security and digital Forensics), KLEF, Vaddeswaram, A.P, India, [email protected] 2 Professor, Department of CSE, KLEF, Vaddeswaram, A.P, India, [email protected] ABSTRACT Visual Cryptography is a technique in cryptography which is In Symmetric Key cryptography both the sender and receiver used to encrypt the images and all other visual information. use same key and it is a single key to do both encrypt and And this cryptography is different from all other decrypt operation on the message which was shared between cryptographic techniques, because of its decryption process them and in asymmetric key cryptography both the sender and it is done mechanically. In general, visual cryptography and receiver uses different keys. image is encryption is limited up to two shares only. In this paper we propose a complete new and different way of In those two keys one key is used to perform encryption and authentication(attestation) which helps to provide more another key is used to perform decryption operation on the security than other authentication systems by using the secret data. And in hash functions, instead of keys hash value Visual Cryptography (3,3) Scheme.
    [Show full text]
  • Visual Cryptography Based Secret Sharing System
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 02 | Feb 2019 www.irjet.net p-ISSN: 2395-0072 Visual Cryptography based Secret Sharing System Nidhi Chauhan 1, Rajat Singhal2, Shweta Maurya3, Himanshu Pandey4, Prof. G.V. Bhole5 1,2,3,4Student, Dept. of Information Technology, Bharati Vidyapeeth College of Engineering, Maharashtra, India 5Professor, Dept. of Information Technology, Bharati Vidyapeeth College of Engineering, Maharashtra, India ----------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - Visual Cryptography is an efficient encryption Visual cryptography is a prominent solution for image method to conceal information in images so that it very well encryption by isolating the original image into may be decrypted by the human visual framework. The benefit transparencies. Visual cryptography was proposed in 1994 of the visual secret sharing can be achieved by utilizing its by Naor and Shamir who presented a basic however secure decryption procedure where with no complex cryptographic way that permits secret sharing with no cryptographic calculation encoded secret information is decoded by Human calculation, which they named as Visual Cryptography Visual System (HVS). Be that as it may, the encryption strategy Scheme (VCS) [1]. Utilizing secret sharing ideas, the needs cryptographic calculation to partition the image into encryption system encrypt a secret image into the various parts for sharing (let n). k-n secret sharing plan is an shares(printed on transparencies) which are commotion like exceptional sort of Visual Cryptographic procedure where secure images which can be transmitted or dispersed over gathering of k shares is required out of n shares to uncover the an unbound correspondence channel.
    [Show full text]
  • Secure Data Sharing Using Visual Cryptography
    International Journal of Computational and Applied Mathematics. ISSN 1819-4966 Volume 12, Number 1 (2017) © Research India Publications http://www.ripublication.com SECURE DATA SHARING USING VISUAL CRYPTOGRAPHY V.Vaishnavi1, B.Shanthi2 and S. Sophia Rani3 1,2 Dept of Computer Science, Jayaraj Annapackiam College for Women (autonomous), Periyakulam, Theni (Dt) 3Assistant Professor, Dept. of Computer Science Jayaraj Annapackiam College for Women(Autonomous), Periyakulam, Theni(Dt) ABSTRACT The Secure Data Sharing Using Visual Cryptography Scheme is a kind of secret sharing scheme that fixates on sharing secret data. The fundamental conception of the visual cryptography scheme is to split a secret data into number of desultory shares which discretely reveals no information about the secret data other than the size of the secret data. The AES algorithm used for secret key .The secret data can be reconstructed by stacking the portions. In the multimedia steganocryptic system, the message will first be encrypted utilizing public key encryption algorithm, and then this encrypted data will be obnubilated into an image file thus accomplishing both data encoding and obnubilating. The multimedia data will be acclimated to provide the cover for the information. Visual steganography is one of the most secure forms of steganography available today. It is most commonly implemented in image files. In this application concept of visual cryptography is the legal distribution of multimedia contents with copyright protection whilst preserving the privacy of user, whose identities are only revealed in case of illegal re-distribution. This application to apply sharing of single secrete data and multiple secrete data on ebony and white as well as on colour images but withal a comparative analysis on visual cryptography schemes is with all performed.
    [Show full text]
  • Threshold Quantum Cryptography
    Threshold Quantum Cryptography Subhash Kak Abstract: Most current research on quantum cryptography requires transmission and reception of single photons that creates severe implementation challenges and limits range. This paper argues for the development of threshold quantum cryptography protocols in which the system is secure so long as the number of photons being exchanged between Alice and Bob is below a specified threshold. We speak of a (p-k-n) threshold system where if the number of photons exchanged is less than p, the system is completely secure, when it is between p and k, the system is partially secure, and when it exceeds k, the system is insecure. The BB84 protocol is (1-1-1) whereas the three-stage protocol appears to be (p-4p-n), where p is the least number of photons necessary to determine the polarization state of identically prepared photons. New quantum cryptography systems should be sought that provide greater flexibility in the choice of p and k. INTODUCTION The BB84 protocol of quantum cryptography is based on transmission of single photons carrying one-bit of information defined with respect to two sets of orthogonal bases [1]. This creates many engineering challenges and limits the applicability of quantum cryptography. Due to the Heisenberg Uncertainty Relations, the energy of photons, or equivalently their number, and the times at which they are emitted cannot be simultaneously fixed. To produce photons that appear singly in the specified time window with high probability requires the use of extremely low power lasers which, in turn, brings down the effective clock rate to just a few thousand bits per second making BB84 useless as a method of quantum communication (for which the modem bit rates can be hundreds of millions of bits per second).
    [Show full text]
  • Cryptographic Hash Functions for Image Processing
    CRYPTOGRAPHIC HASH FUNCTIONS FOR IMAGE PROCESSING by Shafaq Iftikhar B.S(ENG)., COMSATS Institute of IT, Pakistan, 2007 A project presented to Ryerson University in partial fulfillment of the requirements for the degree of Master of Engineering in the Program of Electrical and Computer Engineering Toronto, Ontario, Canada, June 2015 ©Shafaq Iftikhar 2015 AUTHOR'S DECLARATION I hereby declare that I am the sole author of this MEng Project. This is a true copy of the MEng Project, including any required final revisions, as accepted by my examiners. I authorize Ryerson University to lend this MEng Project to other institutions or individuals for the purpose of scholarly research. I further authorize Ryerson University to reproduce this MEng Project by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. I understand that MEng Project may be made electronically available to the public. ii Cryptographic Hash Functions for Image Processing, M.Eng. 2015, Shafaq Iftikhar, Program of Electrical and Computer Engineering, Ryerson Universty ABSTRACT In this paper, a novel algorithm based on hash function for image cryptography is proposed. In this algorithm, the key idea is to encrypt half of the image using data from the second half of the image and then apply it to each other. This scheme can achieve high sensitivity, high complexity, and high security. The sole purpose is to improve the image entropy. iii ACKNOWLEDGEMENTS I am using this opportunity to express my gratitude to everyone who supported me throughout the course of this M.Eng project.
    [Show full text]
  • A Visual Cryptographic Encryption Technique for Securing Medical
    International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 6, June (2013) A Visual Cryptographic Encryption Technique for Securing Medical Images Quist-Aphetsi Kester, MIEEE Faculty of Informatics, Ghana Technology University College, PMB 100 Accra-Norths, Tesano, Accra, Ghana Abstract— The increased growth in the use of transmission They demonstrated a visual secret sharing scheme, of multimedia medical contents over unsecured and open where an image was broken up into n shares so that only networks provides insecurity for confidential patient someone with all n shares could decrypt the image, while information over these networks. Digital encryption of any n − 1 shares revealed no information about the original medical images before transmission and storage is proposed image. Each share was printed on a separate transparency, as a way to effectively provide protection of patient information. Encryption before watermarking of these images and decryption was performed by overlaying the shares. is necessary in order to ensure inaccessibility of information to When all n shares were overlaid, the original image would unauthorized personnel with patient. appear [5]. This paper presented a visual cryptographic technique for Visual cryptography encodes a secret binary image into encrypting of medical images before transmission or storage n shares of random binary patterns. The secret image can of them. This will make such images inaccessible by be visually decoded by superimposing a qualified subset of unauthorized personnel and also ensures confidentiality. The transparencies, but no secret information can be obtained process made use of an encryption technique that is based on from the superposition of a forbidden subset [6].
    [Show full text]
  • Securing Technique Using Pattern-Based LSB Audio Steganography and Intensity-Based Visual Cryptography
    Computers, Materials & Continua Tech Science Press DOI:10.32604/cmc.2021.014293 Article Securing Technique Using Pattern-Based LSB Audio Steganography and Intensity-Based Visual Cryptography Pranati Rakshit1, Sreeparna Ganguly1, Souvik Pal2, Ayman A. Aly3 and Dac-Nhuong Le4,5,* 1JIS College of Engineering, Kalyani, West Bengal, 741235, India 2Global Institute of Management and Technology, Nadia, West Bengal, 741102, India 3Department of Mechanical Engineering, College of Engineering, Taif University, Taif, 21944, Saudi Arabia 4Institute of Research and Development, Duy Tan University, Danang, 550000, Vietnam 5Faculty of Information Technology, Duy Tan University, Danang, 550000, Vietnam *Corresponding Author: Dac-Nhuong Le. Email: [email protected] Received: 11 September 2020; Accepted: 10 November 2020 Abstract: With the increasing need of sensitive or secret data transmission through public network, security demands using cryptography and steganog- raphy are becoming a thirsty research area of last few years. These two techniques can be merged and provide better security which is nowadays extremely required. The proposed system provides a novel method of infor- mation security using the techniques of audio steganography combined with visual cryptography. In this system, we take a secret image and divide it into several subparts to make more than one incomprehensible sub-images using the method of visual cryptography. Each of the sub-images is then hidden within individual cover audio filessing u audio steganographic techniques. The cover audios are then sent to the required destinations where reverse steganography schemes are applied to them to get the incomprehensible com- ponent images back. At last, all the sub-images are superimposed to get the actual secret image.
    [Show full text]
  • Secure Visual Cryptography Scheme with Meaningful
    e-ISSN : 0976-5166 p-ISSN : 2231-3850 Jinu Mohan et al. / Indian Journal of Computer Science and Engineering (IJCSE) SECURE VISUAL CRYPTOGRAPHY SCHEME WITH MEANINGFUL SHARES Jinu Mohan Research Scholar, Bharathiar University, India [email protected] Rajesh R Associate Professor, CHRIST (Deemed to be University), India [email protected] Abstract - Visual cryptography is an outstanding design, which is also known as visual secret sharing. It used to encode a secret portrait into various pointless share images. Normally, item bossed on transparencies and decrypts as loading one or two or the entire share images by means of the human visual system. Suppose, if we encompass great sets of secret shares then the pointless shares are complicated to handle. In this paper, a meaningful secret sharing algorithm and a modified Signcryption algorithm is used to enhance the security of the Visual Cryptography encryption schemes. The foremost intend of the anticipated format is to extend consequential shares and similarly make sure the isolation on conveying the secret data. The anticipated process is executed in the functioning platform of MATLAB and the presentation results are investigated. Keywords: Visual Cryptography, Elliptic Curve Cryptography (ECC), Signcryption algorithm, Password based Authentication. 1. Introduction Nowadays, the multimedia information is quickly and simply conveyed by internet in the quick expansion of network technology. Even the private information like military maps are also conveyed by the networks. Cryptography is the analysis of constructing symbols to protect the privacy and data reliability [1]. Visual cryptography is a cryptographic procedure which is used to permit visual information (pictures, text, etc) as encrypted and that the decryption is carried out by means of the human visual system, devoid of the computer support.
    [Show full text]
  • A Comprehensive Study of Visual Cryptography
    A Comprehensive Study of Visual Cryptography Jonathan Weir and WeiQi Yan Queen’s University Belfast, Belfast, BT7 1NN, UK Abstract. Visual cryptography (VC) is a powerful technique that com- bines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. VC takes a binary image (the secret) and divides it into two or more pieces known as shares. When the shares are printed on transparencies and then superimposed, the secret can be recovered. No computer participation is required, thus demonstrat- ing one of the distinguishing features of VC. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the human visual system (HVS). In this survey, we will summarize the latest developments of visual cryptography since its inception in 1994, introduce the main research topics in this area and outline the current problems and possible solutions. Directions and trends for future VC work shall also be examined along with possible VC applications. 1 Introduction Visual cryptography is a powerful technique which combines the notions of per- fect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares which can be stacked together to approx- imately recover the original image. A secret sharing scheme enables distribution of a secret amongst n parties, such that only predefined authorized sets will be able to reconstruct the secret. The secret, in terms of visual cryptography can be reconstructed visually by superimposing shares. Visual cryptography allows the transmission of visual information and many aspects of this area are covered, including its inception to the current techniques being employed and actively researched today.
    [Show full text]
  • Example of Pixel-Based Visual Cryptography in Detail
    Example of Pixel-based Visual Cryptography in Detail All that is not perfect down to the smallest detail is doomed to perish. Gustav Mahler 266 Example of Pixel-based Visual Cryptography Figure 1: Example: Pixel-based Visual Cryptography, Original Picture S. Pape, Authentication in Insecure Environments, DOI 10.1007/978-3-658-07116-5, © Springer Fachmedien Wiesbaden 2014 Example of Pixel-based Visual Cryptography 267 Figure 2: Example: Pixel-based Visual Cryptography, Transparency 1 268 Example of Pixel-based Visual Cryptography Figure 3: Example: Pixel-based Visual Cryptography, Transparency 2 Example of Pixel-based Visual Cryptography 269 Figure 4: Example: Pixel-based Visual Cryptography, Overlay Auxiliary Tables and Proofs Consistency is found in that work whose whole and detail are suitable to the occasion. It arises from circumstance, custom, and nature. Marcus Vitruvius Pollio 272 Auxiliary Tables and Proofs Lemmas ( )= − 2 n Lemma 11.1. The derivative of f n 1 n+1 is positive for all n>1. v v Proof. By applying the chain rule for df f(n)=du du + du dv dn du dn dv dn v v with u = 1 − 2 , v = n, du = vuv−1, and du = log(u)uv it follows: n+1 du dv − df 2 n 1 df 2 f(n)=n 1 − 1 − dn n + 1 dn n + 1 2 n 2 df + 1 − log 1 − (n) n + 1 n + 1 dn − 2 n 1 2 2 2 = 1 − n + 1 − log 1 − n + 1 (n + 1)2 n + 1 n + 1 2 n 2n n − 1 = 1 − + log n + 1 n2 − 1 n + 1 n Since for all n>1it holds that 1 − 2 >0it remains to show that T(n)= n+1 2n + n−1 >0 n = 2 T(2)= n2−1 log n+1 .
    [Show full text]
  • A Novel Key Distribution Scheme for a Visual Crypto System Kalyan Das1, Aromita Sen2 1Department of Information Technology, St
    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 A Novel Key Distribution Scheme for a Visual Crypto System Kalyan Das1, Aromita Sen2 1Department of Information Technology, St. Thomas College of Engineering and Technology, Kolkata.India 2Department of Computer Science and Engineering, St. Thomas College of Engineering and Technology Kolkata ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - With the high speed advancement of Computer shares such that it reveals the secret image when they are network and internet, has hiked the chance of data snooped overlaid. during the time of transmission. In this issue, Cryptography • (n, n) Threshold VCS scheme- In this scheme the secret plays a vital role, which hides the actual information using message is encrypted into n shares, such that when all of the some secret key and thereby converts it into an alternative n shares are combined, it will reveal the secret message. equivalent multimedia file like image, video or audio in such a way that only the intended recipient can retrieve back the • (k, n) Threshold VCS scheme- This scheme encrypts the original data. Here in this paper, a novel secret sharing secret image into n shares such that when any group of at technique has been suggested, which comprises of two main least k shares are overlaid the secret image will be revealed. parts. The first part for establishing shared secret key (one The question on key exchange was one of the first problems time key), using asymmetric key cryptography and then addressed by a cryptographic protocol that was prior to the transmit the confidential data using that shared secret key, invention of Public Key Cryptography.
    [Show full text]
  • Enhanced Online Payment Security Using Steganography, Quantum and Visual Cryptography
    International Journal of Computer Sciences and Engineering Open Access Research paper Volume-5, Issue-7 E-ISSN: 2347-2693 Enhanced Online Payment Security using Steganography, Quantum and Visual Cryptography Anshu Arele1, Vikas Sejwar2 1*Dept. of CSE and IT, Madhav Institute of Technology and Science, Gwalior, India 2 Dept. of CSE and IT, Madhav Institute of Technology and Science, Gwalior, India *Corresponding Author: [email protected], Tel.: +00-12345-54321 Available online at: www.ijcseonline.org Received: 26/May/2017, Revised: 12/Jun/2017, Accepted: 17/Jul/2017, Published: 30/Jul/2017 Abstract— Visual Cryptography is Secret Sharing Scheme where it is an encryption methodology to hide the data under image in a fashion that it can only be decrypted by the combination of two shares. Quantum mechanics is the bsis of Quantum Cryptography Techniques. Use of Quantum key is the basis as Quantum mechanics concept has been utilized to have encrypted key in place between users and not used for data transmission. Steganography involves techniques of hiding information under other information so that extraction of data become difficult .In the existing work, it used these three techniques to improve the transaction security. But this is not enough to secure so to overcome this problem we apply image sequence and send OTP in the email id which makes them more secure to achieve more security. Keyword- Payment System, Buisness, Internet, Keys, Visual Cryptography, Quantum Cryptography, Stagenography I. INTRODUCTION contains random or noisy pixels and the other image contains the secret data. Image containing information will be hidden Electronic payment systems are becoming an essential part of under the other image containing meaningless or random electronic commerce and electronic business.
    [Show full text]