Extended Visual Cryptography Using Watermarking

EXTENDED VISUAL CRYPTOGRAPHY USING WATERMARKING

TECHNIQUE

Enrollment No. - 9911103553

Name of Student - Shivam Singh

Name of Supervisor - Mr. Raju Pal

June -2015

Submitted in partial fulfillment of the Degree of

Bachelor of Technology

In

Computer Science Engineering

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING &

INFORMATION TECHNOLOGY

JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY, NOIDA

TABLE OF CONTENTS

Chapter No. Topics

Page No.

Acknowledgement I

Summary II

List of Tables

List of Figures Iv

List of Symbols and Acronyms V

Chapter-1 Introduction

1.1 General Introduction 1

1.2 Problem Statement 1

1.3 Empirical Study 2

1.4 Approach to problem in terms of technology 2

Chapter-2 Literature Survey

2.1 Summary of papers studied

2.2 Integrated Summary

2.3 Integrated Summary of the literature studied

2.4 Empirical Study

3-6

7

5

6-9

Chapter-3 Analysis, Design and Modeling

3.1 Overall Description Of the Project 8

3.2 Functional Requirements 8

3.3 Non Functional requirements

dependency details

9

3.4 Design Diagrams 9

Chapter-4 Implementation details and issues

4.1.1 Implementation issues

10

4.1.2 Algorithms 11

4.2 Risk Analysis Mitigation 13-15

Chapter-5 Testing

5.1 Testing Plan 16

5.2 Component Decomposition and type of Testing

Required

18

5.3 List all test cases 18

5.4 Limitations of the solution 18

Chapter-6 Findings & Conclusion

6.1 Findings 19

6.2 Conclusion

19

6.3 Future Work 19

Appendix A. Gantt Chart

B. References

C. Snapshots

D. CV

20

20

21-24

25-26

(II)

DECLARATION

I hereby declare that this submission is my own work and that, to the best of my knowledge and belief, it

contains no material previously published or written by another person nor material which has been

accepted for the award of any other degree or diploma of the university or other institute of higher

learning, except where due acknowledgment has been made in the text.

Place: Noida Signature :

Date: 4/06/2015 Name : Shivam Singh

Enrollment No. : 9911103553

(III)

CERTIFICATE

This is to certify that the work titled “EXTENDED VISUAL CRYPTOGRAPHY USING

WATERMARKING” submitted by “Shivam Singh” in partial fulfillment for the award of degree of

B. Tech. of Jaypee Institute of Information Technology, Noida has been carried out under my

supervision. This work has not been submitted partially or wholly to any other University or Institute

for the award of this or any other degree or diploma.

Signature of Supervisor:

Name of Supervisor : Mr. Raju Pal

Designation : Assistant Professor

Date : 4-06-2013

(IV)

ACKNOWLEDGEMENT

The completion of any project work depends upon the cooperation, coordination and combined

effects of several resources of knowledge, energy and time. Therefore we approach this important

matter of acknowledgement through these lines trying our best to give full credits where it

deserves.

I am extremely grateful to my supervisor Mr. Raju Pal for his expert guidance, constant

encouragement, valuable suggestions, constructive criticism and sustained interest in the project that

tremendously enhanced our perseverance towards our major project work.

Name of Student : Shivam Singh

Enrollment Number : 9911103553

Date : 3 May 2015

(V)

SUMMARY

Digital watermarking is a technique that provides a solution to the longstanding problems faced with

copyrighting digital data. Often attackers are only interested in a small subsection of the image. A

watermark at the edge of an image can often easily be cropped out of the picture without any

significant loss. The only defense against this attack is to tile a very small watermark all over the

image, and allow retrieval of the watermark from any of the small subsections of the fragmented image.

Further with a robust encryption and decryption technique we can have a proper security altogether.

Signature of Student: Signature of Supervisor:

Name : Name

Date : Date

(VI)

LIST OF TABLES

Table No. Description Page Number

Table 1 Integrated Summary 7

Table 2 Risk Analysis 14

Table 3 Impact 14

Table 4 Mitigation Plan 15

Table 5 Test Plan 17

Table 6 Test Schedule 17

Table 7 Testing Components 18

Table 8 Test cases 18

(VII)

List of Figures

Figure No. Description Page no.

Fig1 Sequence Diagram 9

Fig2 Embedding Algorithm 11

Fig3 Extracting Algorithm 12

(VIII)

List of Symbols and Acronyms

Acronym Meaning

HTML Hyper Text Markup Language

EVCS Extended Visual Cryptography Scheme

LSB Least Significant Bit

AES Advance Encryption Standard

Chapter 1: Introduction

1.1 General Introduction-

First and foremost, Naor and Shamir suggested an encryption scheme that was able to encrypt an

images they call it Visual Cryptography scheme. VCS is a type of cryptography in which images can be

encrypted in a secure way by dividing them in a distorted image called transparent shares and

transmitted physically by printing these shares on transparency sheets to the intended user. The

essential intention behind this plan was to encode a mystery picture and send over uncertain medium to

the objective client to share it. The magnificence of this plan is that the offer produced by this plan does

not uncover any data about the first picture and the quantity of shares created in this plan guarantees the

security of the substance held in the offer. This makes VCS plan a totally secure plan. VCS is a vital

plan and it is material in a wide mixture of uses where it can be utilized. Case in point it can be utilized

by any individual who has no data about cryptography can utilize it effortlessly. Many types of visual

cryptography are used nowadays, the very first type of traditional visual cryptography right up to the

latest developments. Traditional VC specifically deals with sharing a single binary secret between a

numbers of participants. Extended VC attempts to take this a step further by introducing shares that

have significant visual meaning. This detracts from the suspicious looking encrypted shares that are

generated using traditional methods. Dynamic, colour, progressive and image hatching VC schemes are

also taken into consideration for latest developments in this field.

1.2 Problem Statement-

Due to rapid growth in computer technology and multimedia network techniques the digital media is

now prone to attacks in one way or another. However, there are some areas where the data can be

exploited in a negative way, which create a pressing need for copyright enforcement methods that can

protect copyright ownership. VCS cheating prevention is one of such methods that have been

developed to protect intellectual property of image in digital form. It is realized by embedding the

copyright information, also known as "the watermark pattern", into the original image. The watermark

pattern in the cover image can be either visible or invisible. But even after providing a secure medium

the watermarking is not exclusively used for sharing important information which is the problem

statement for the course of this project.

1.3 Empirical Study-

Digital watermarking is a method that provides a better solution to the problems faced with digital data

copyrighting. Often hackers are only interested in a small portion of the image. A watermark at the

corners of an image can often easily be exploited by polluting or cropping out the picture without any

significant loss. The mosaic attack is a perfect example of this method. In a mosaic attack, the attacker

exploits the entire watermarked image by breaking it into many small parts. The only defense against

this attack is to place over a very small watermark all over the image, and allow them to get the

watermark from any of the small subsections of the fragmented image. With a robust encryption and

decryption technique we can have a proper security altogether. Further this will provide a much more

secure way to share information through watermarking.

1.4 Approach to problem in terms of technology

The different approach of watermarking, encryption and decryption are solved using java. Different

modules of the requirements were made using java applet and were depicted in a combined form.

Further as the key entered at the time of encryption needs a check at the time of decryption so it is

managed my MySQL database server using SQLyog. Further for the project to be secure there is a

login created in starting. Finally we easily save the decrypted file for our use.

Chapter 2: Literature Survey

2.1 Summary of papers studied

2.1.1 Visual Cryptography-(Base paper)

Authors-Moni Naor and Adi Shamir

Publishing details -Lecture Notes in Computer Science Volume 950, pp. 1-12.

Year-1995

Summary-

The paper gives insight on the problem of encrypting written material in a perfectly secure way

which can be decoded directly by the human visual system. The basic model consists of two parts

namely a printed page of ciphertext (information that is shared) and a printed transparency (secret

key). The original cleartext is obtained by placing the transparency by placing the key over the page

having ciphertext; moreover each one of them is indistinguishable from random noise. Due to its

simplicity, the system can be used by anyone without any knowledge of cryptography and without

performing any cryptographic computations.

Given a written message, it was required to generate n transparencies so that if any k (or more) of

them are stacked together then the original message is visible, but becomes totally invisible if less

than k transparencies are stacked together. The original encryption problem can be considered as a

2 out of 2 secret sharing problem. The main results of this paper include practical implementations

of a k out of n visual secret sharing scheme for small values of k and n, as well as efficient

constructions which can be proven optimal within certain classes of schemes.

Weblink-

https://scholar.google.co.in/scholar?q=Visual+Cryptography&hl=en&as_sdt=0&as_vis=1&oi=scho

lart&sa=X&ei=JmYnVfvGJIKZuQS934GAAQ&ved=0CBoQgQMwA

2.1.2 A Visual Cryptography Based Digital Image Copyright Protection

Authors- Adel Hammad Abusitta

Publishing details - Journal of Information Security, 2013, 3, 96-104

Year- 2013

Summary-

The proposed method works on the selecting random pixels from the original digital image instead

of specific selection of pixels. The method proposes that the embedding of watermark pattern to the

original image is not an urgent requirement for security. Instead of that, the verification information

is obtained which will be used to verify the authentication of the image from the owner. This results

that the marked image is equal to the original image. This technique is based on the relationship

between 8-neighbors‟ pixels and the randomly selected pixels. This relationship helped the marked

image to withstand against the various attacks; even the most significant bit of randomly selected

pixels have been as mentioned in this paper. Verification information is generated which will be

used to verify the ownership of the image. This leaves the marked image equal to the original

image. The proposed method is tested and shows that a watermark pattern can be retrieved easily

from marked image even the image is attacked by major changes in pixels bits.

Weblink-http://www.scirp.org/journal/PaperInformation.aspx?PaperID=18788#.VSdn5PmUe-0

2.1.3 An Extended Visual Cryptography Scheme without pixel expansion for halftone images

Authors-N. Askari, H.M. Heys, and C.R. Moloney

Publishing Details- IEEE Canadian Conference on Electrical and Computer Engineering

(CCECE), Montreal, pp. 1-4, 2014.

Year - 2014

. Summary-

In this paper, a technique is proposed for processing halftone images that enhances the quality of

the share images and the secret image which is recovered in an extended visual cryptography

scheme for which the size of the recovered image and share images is same as the original halftone

secret image. This method gives a result which helps in maintaining the security of the extended

visual cryptography in a robust way. The drawback in such an approach is a decline in image

quality. The application of the preprocessing schemes is to construct extended visual cryptography

scheme without image size expansion. For its implementation three halftone images were selected

to act as input. The first two images contain some relevant cover images and the third image is the

secret image. The block replacement algorithms convert the three input images into some processed

images. A processed image contains two blocks namely white and black which can be used as an

input secret image in any encoding process of visual cryptography. After producing the three

processed images by the valid method, the two shares are generated according to the encoding

process of EVC. The secret image is obtained by placing the two shares in a stack together. In order

to check the validity of the proposed scheme a visual experiment was also conducted. Further it was

shown that using an intelligent pre-processing of halftone images based on the characteristics of the

original secret image it was able to produce good quality images in the shares and the recovered

image.

Weblink-

https://scholar.google.co.in/scholar?q=An+Extended+Visual+Cryptography+Scheme+without+pixe

l+expansion+for+halftone+images&hl=en&as_sdt=0&as_vis=1&oi=scholart&sa=X&ei=F2knVbD

BKIq9uAT-2YGYBg&ved=0CBsQgQMwAA

2.1.4 Multiuser Watermarking using Visual Cryptography

Authors- Komal Toshniwal M.E.Student, D.Y.Patil, Pimpri, Pune

Publishing Details- International Journal of Innovations in Engineering and Technology

(IJIET), Vol. 2 Issue 1 February 2013

Year- 2013

Summary-

In this paper a Visual Cryptography based watermarking scheme is proposed which is more secure

and robust than the schemes mentioned in the above research papers. Furthermore, the proposed

scheme can deal with multiple owners as well as multiple cover images. A qualitative comparison

on effectiveness between the proposed scheme and some known VC based watermarking schemes

were done and analyzed. The comparisons show a result that the proposed scheme has many special

properties. In this scheme, there is a use of the VCS with underlying operation XOR, because an

XOR-based VCS usually has better performance in terms of the visual quality of the recovered

secret image and the pixel expansion. For some attacks, the error pixels may be aggregated, for

example, the cropping attack. The torus automorphism can scatter the error pixels to the entire

image uniformly. Further with a robust embedding and extracting methods it leads to highly secure

way to watermark using visual cryptography. Lastly it was also mentioned that the proposed

scheme is carried forward to develop it for number of images of all the extensions.

Weblink-

https://scholar.google.co.in/scholar?q=Multiuser+Watermarking+using+Visual+Cryptography&hl=

en&as_sdt=0&as_vis=1&oi=scholart&sa=X&ei=oGknVc32E463uATknYKICQ&ved=0CB0QgQ

MwAA

2.2 Integrated summary:

1. The problem of encrypting written material in a perfectly secure way which can be

decoded directly by the human eyes was solved by visual cryptography.

2. Extended visual cryptography came into existence which further helped in much

secure encryption technique

3. Selection of random pixels from the original digital image instead of specific selection

of pixels keeps the marked image coherent against diverse attacks even if the most

significant bits of randomly selected pixels have been changed by attacker.

4. Pre-processing of halftone images based on the characteristics of the original secret

image it was able to produce good quality images in the shares and the recovered

image

5. VC-based watermarking scheme is used which has strong robustness, perfect

imperceptibility, and satisfies the blindness and security properties

Table 1: Integrated Summary

Chapter 3: Analysis, Design and Modeling

3.1 Overall description of the project-

Basically we are making an effort to understand and implement the Watermarking as a technique to

protect the copyright of digital media such as image, text, music and movie. As proposed in the

research paper (2.1.4) we are trying to implement it with further advancements.

The model of this scheme includes three kinds of participants –

1) the owners of the cover images who want to protect their copyright of the cover images

2) the attackers who want to illegally use the cover images

3) A TA (Trusted Authority) who will arbitrate the ownership of the cover images when a dispute

occurs.

The proposed watermarking scheme contains two algorithms

1) The embedding algorithm

2) The extracting algorithm.

Basically we are using tiny algorithm for encryption and decryption and watermarking is itself used as

the secret data to be shared.

3.2 Functional requirements

Purpose: The purpose of the project is to watermark an important image to secure it and identify

authorize user in a dispute. The proposed approach uses AES algorithm, Error correcting technique

along with Visual cryptography to give robustness to the watermarked image

Input: The original image, watermarked image and the secret key are the input of the proposed

approach

Output: Several parameters are used to qualify the proposed technique, examining tests on the resulted

watermarked image.

3.3 Non Functional requirements

All the forms and modules should allow maximum readability to the user.

Support reliability and maintainability

It can be extendible and more features can be added

It can be extended to process requests for web pages and distributed systems.

3.4 Design Diagrams

Data Flow Diagram-

Figure1: Data flow Diagram

Chapter 4: Implementation details and issues

4.1 Implementation details and issues-

4.1.1 Implementation Issues-

Using Watermarking is itself a big process to handle and along with cryptography a lot of modules are

handled in a single interface. With the use of watermarking itself to share a required data through an

attack prone area is hard to achieve. Further with the use of java applet to depict the actual

implementation it requires a lot of time to build the whole model including every module to run

properly. Moreover some of the images after decryption showed some erroneous results which were a

cause of worry.

Alignment Problems-

Pixel development is an imperative parameter for Visual Cryptography Schemes (VCS). In any case,

most research in writing is devoted to decrease pixel extension to lessen number of subpixels that speak

to a pixel in unique mystery picture. It is truly insufficient since final size of the transparencies of the

VCS is influenced by number of the subpixels, as well as by size of the subpixels in the transparencies.

Then again, diminishing the span of the subpixels in transparencies is because of difficulties of the

transparencies arranged.

VCS Cheating Prevention-

The cheating problem in VCS is quite interesting. The possibility of cheating activity in VCS has been

studied. For cheating, the cheaters present some fake shares so that the stacking of fake and genuine

shares together reveals a fake image, and the victims who cannot detect the cheating activities will be

fooled to believe that the recovered fake image is the genuine secret image. This is terrible because the

secret image is usually important to the victims.

Flipping Issues in VCS-

Many schemes within visual cryptography suffer from alignment issues and are dependent on how the

shares are stacked together. Loosening or removing this restriction would be a very desirable advance,

as it enables an end user to recover the secret without having to work out how he must stack the shares.

Distortion Problems-

For visual cryptography plan (VCS), ordinarily, the extent of the recuperated mystery picture will be

extended by m (≥1) times of the first mystery picture. Much of the time m is not a square number;

henceforth the recuperated mystery picture will be bended. Infrequently, m is too vast that will convey

much impairment to the members to convey the offer picture

4.1.2 Algorithms-

Figure2 Embedding Algorithm (2.1.4)

Figure3 Extracting Algorithm (2.1.4)

Firstly the image is processed by watermarking and this watermarking depends on the domain in which

the watermarking is done – the frequency and spatial domain. Watermarking in the latter involves

selecting the pixels to be changed based on their location within the image and is prone to the mosaic

attack and cropping attack.

The LSB technique is the simplest watermark technique to perform insertion. Assuming that 3 bytes of

size is allocated for each pixel. Then, each of the colors contains 8 bits of information, in which the

intensity of that colour can be measured on a scale of 0 to 255.

So taking an example

X0 = (R=255, G=0, B=255)

Now with a slight change in pixel:

X1 = (R=255, G=0, B=254)

We have only changed value of B here. For the human eye, detecting a difference of 1 on a color scale

of 0- 256 is not possible in a practical way.

Now as each color is stored in a different byte, the very last bit in each byte stores this difference of

one. So the difference between values 255 and 254, or 127 and 126 is stored in the last bit, called the

Least Significant Bit (LSB).

Since this difference don‟t hamper much, so when we replace the color intensity information in the

LSB with watermarking information, the image will still look almost same to the naked eye.

Thus to depict the algorithm for this technique:

Let W be watermarking information

For every pixel in the image, Xi

Do Loop:

Store the next bit from W in the LSB position of Xi [red] byte

Store the next bit from W in the LSB position of Xi [green] byte

Store the next bit from W in the LSB position of Xi [blue] byte

End Loop

To extract watermark data all the data in the LSBs of the color bytes is taken and combined.

.

4.2 Risk Analysis and Mitigation

Risk

id

Classification Description of risk Risk area Probability

(P)

Impact(I) Re(P*I)

1 Hardware Incapability of hardware

like RAM, Processor,

Memory etc

Performance,

hardware,

Time

High high 8.1

2 Multi-tenancy

(Shared

access)

All the users are using

the same physical

architecture

Security Low low 0.1

3 Security Critical Data at risk Security High Medium 8.1

4 Security Authentication,

authorization, and access

control

User, Project

Scope, Time

High High 8.1

5 Hardware Processor can direct boot

from pen drive

Performance,

Time

Low High 0.9

6 Ownership User the owner of data Security High Low 0.9

7 Environment Windows and Netbeans

is necessary for

simulation

Performance,

Time

High Medium 8.1

8 Personnel

Related

Incompetent Skills Time High High 8.1

9 Personnel

Related

Irregularity Time Medium High 2.7

Table2: Risk Analysis

Table3: Impact

Risk Mitigation Plan

Hardware Hardware related issues can be resolved by

using powerful processors support, Faster

RAMs and Bigger Storage device.

Security Secure connection must be established while

encryption and decryption

Personnel Related Placements Activities are unavoidable.

Projects related skills need time because no one

hasn‟t explored it yet completely. We will try

to avoid irregularity.

Environments Netbeans must be installed on windows

Table4: Mitigation Plan

RATING IMPACT PROBABILITY

HIGH 9 0.9

MEDIUM 3 0.3

LOW 1 0.1

Chapter-5: Testing

5.1 Testing Plan-

Type of Test Will Test

be

Performed

Comments/Explanation Component

Requirement Yes Requirements specification must contain

all the requirements that are to be solved

by our system.

Hardware and

working

Unit Yes Sets of one or more computer program

modules together with associated control

data, usage procedures, and operating

procedures are tested to determine if they

are fit for use.

Units of source

code, operating

procedures

Integration Yes takes as its input modules that have

been unit tested, groups them in larger

aggregates, applies tests defined in an

integration test plan to those aggregates,

and delivers as its output the integrated

system

individual

software modules

Performance Yes Redundancy and fail-over options should

be considered.

NA

Stress Yes Simulating beyond normal

Operational capacity.

Heavy data files.

Compliance Yes It determines, whether we are

implementing and meeting the defined

standards.

Need in testing

the performance

metric

Table 5: Test Plan

All possible test cases were prepared based on the system requirements and documentation. We sought

the help of some other persons who were involved in developing similar networking projects for their

final year projects.

5.1.1:-Test Schedule:

Sl. No Test Strategy Start Date End Date

1 Requirement 5th

March 2015 2nd

April 2015

2 Unit 20th

March 2015 2nd

May 2015

3 Integration 4th

April 2015 14th

April 2015

4 Performance 5th

May 2015 17th

May 2015

5 Stress 17th

May 2015 19th

May 2015

6 Compliance 19th

May 2015 24th

May 2015

Table 6: Test Schedule

5.2 Component decomposition and type of testing required-

S.No. Various components

that require testing

Type of testing

required

Technique for

writing Test cases

1 Algorithms

Implemented

Unit, Performance,

Volume, Security

White box

2 Performance Metric

and results

Unit, Performance,

Stress

Black box

3 cryptographic tools

and results

Unit, Performance,

Integration

White box

Table 7: Testing Components

5.3 List all test cases

S.No. Input Output Status

1 Activate the Netbeans IDE

and execute the code for

watermarking

code executes

without error

Pass

2 Execute Encryption

algorithm

Desired outputs

accordingly

Pass

3 Execute Decryption

algorithm

Desired Outputs

accordingly

Pass

Table 8: Test Cases

5.4 Limitations of the solution

The proposed solution for the problem statement is limited to some extent. Firstly for the proposed

solution to give best results we took .jpg format images and we experienced some visual errors on some

images at the time of decryption. Further for watermarking we assumed some image dimension (300

x400) due to which images are resized before watermarking so reducing their original properties.

Chapter-6: Findings & Conclusion

6.1 Findings

After successful execution of project we found out that this technique can be used on several of

occasions where a user needs to secure his/her files from attack. Further if a user wants to send

particular information in form of codes this information can be watermarked and further be extracted

by the user who wants the information.

6.2 Conclusion

Cryptography is a vast topic which still needs a lot of development. Watermarking is an effective tool

to make a digital copyright of our own content from attack of outsiders but the watermark can itself be

used to send secret information across the channel. So firstly the watermarked image contains a coded

message itself which is encrypted with a key and now with this key the information can be received by

the user who needs it.

6.3 Future Work

Basically it is hard to maintain the originality of the input image totally which leads to distortion

problems. So a robust watermarking along with cryptography can be developed which can prevent the

image from being hacked as well as distorted. Mostly the file type presently being worked upon i.e.

.jpg format should be increased to a lot more (.gif, png). And last but not the least the encryption –

decryption techniques should be changed as per emergence of new technologies.

APPENDIX

A. Project plan as Gantt chart:

TASK 10-02-

2015

24-03-

2015

25-03-

2015

27-03-

2015

07-04-

2015

10-04-

2015 26-04-2015 3-06-2015

Topic

Discussion

with mentor -

Topic

Finalization

and

requirement

discussion

Initial proposal

collection of

Data-Set

Progress

reported to

mentor of till

date work

Mid Term

Evaluation

Work on

management

and final

implementation

Final

Evaluation

B. References

[1] N.Nikolaidis and LPitas “Copyright protection of images using robust digital signatures” proc.

Of ICASSP-96, Atlanta, USA, May 1996 (accepted).

[2] H. Koga, “A general formula of the (t,n)-threshold visual secret sharing scheme,” in Advances

in Cryptology, Asia crypt, pp. 328-345, 2002.

[3] Adhikari and S. Sikdar, “A new (2, n)-visual threshold scheme for color images,” in Proc.

INDOCRYPT 2003, Berlin, pp. 148-161, 2003

[4] Wang, F.H., Yen, K.K., Jain, L.C., Pan, J.S.: „Multiuser-based shadow watermark extraction

system‟, Inf. Sci., 2007, 177, pp. 2522–2532

[5] Lou, D.C., Tso, H.K., Liu, J.L.: „A copyright protection scheme for digital images using visual

cryptography technique‟, omput.Stand.Interfaces, 2007

[6] Wang, M.S., Chen, W.C.: „Digital image copyright protection scheme based onvisual

cryptography and singular value decomposition‟, Opt.Eng. 2007

C. Snapshots

D. CURRICULUM VITAE

SHIVAM SINGH P-18, NEW MEDICAL ENCLAVE, B.H.U

VARANASI, UTTAR PRADESH

E-mail: [email protected] Phone: 9811054360

Academic profile

Standard Board/School Marks Year

Std X CBSE , Sunbeam English School , Bhagwanpur, Varanasi,U.P. 87.8% 2008

Std XII CBSE , Sunbeam English School , Bhagwanpur, Varanasi,U.P. 75% 2010

Currently pursuing

Bachelor of Technology in Computer Science and Engineering from Jaypee Institute Of Information

Technology (JIIT), Noida. Current CGPA after completion of 7th Semester: 5.1 out of 10.

Technical skills

Programming languages: C/C++,PHP,HTML

Database languages: SQL

Basic knowledge of Java programming

Friendly with Hybrid mobile application development.

Platforms: Windows and Linux

FIELD OF INTEREST

Mobile Application Development, Web Technology, Big Data Technology

SUMMER TRAINING Project based summer training at CETPA INFOTECH. Project: A JSP based web application on “Online Recruitment “.

PROJECTS

Build an home automation system to conserve electricity with help of 8051 in MPC (Microprocessor and Controller) 4

th Semester.

Made a website that provides new way of college management system for minor project during 5th

Semester.

Made a website named “Feed Wave” for getting live search as well as display of latest news for minor project during 6

th Semester.

Made a hybrid mobile application “Awsumz” for fetching news from different news websites using RSS feeds as part of major project during 7

th semester.

EXTRA-CURRICULAR

Participated in web designing workshop(I-vision studio)

Participated in ethical hacking workshop(I3indya technologies)

Voluntary participation in Jaypee youth marathon

Actively participated in online coding competition

Vivid badminton, table tennis, cricket player at school level

.