0% found this document useful (0 votes)
31 views17 pages

Thesis - Proposal

The document proposes a thesis on reversible secret image sharing based on Shamir's secret sharing scheme with SVD for color images. The objectives are to implement secret image sharing applying SVD for faster generation of secret images and analyze performance against time and error. The methodology will not violate Shamir's secret sharing algorithm and will calculate time and error. Expected outcomes include colored shadow images that perform quicker by operating diagonally and comparing the proposed algorithm to others in terms of time and error.

Uploaded by

Gopal Dahal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
31 views17 pages

Thesis - Proposal

The document proposes a thesis on reversible secret image sharing based on Shamir's secret sharing scheme with SVD for color images. The objectives are to implement secret image sharing applying SVD for faster generation of secret images and analyze performance against time and error. The methodology will not violate Shamir's secret sharing algorithm and will calculate time and error. Expected outcomes include colored shadow images that perform quicker by operating diagonally and comparing the proposed algorithm to others in terms of time and error.

Uploaded by

Gopal Dahal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Thesis Proposal on

Reversible Secret Image


Sharing Based on
Shamir’s Scheme with
SVD for color image

Abhilash Poudel
MECE - 16901
Overview

● Introduction
● Problem Statement
● Objectives
● Significance of Study
● Literature Review
● Methodology
● Expected Outcomes
● Timeline
● References

2
Introduction

● Storing data in cloud makes them easily accessible


● Images are one of the most stored data
● Images are also crucial data
● Storing on a single location is not reliable
● Storing on different locations will provide high availability
● But it still requires high level of security from data breach
● Storing encrypted image shares will solve above problems

3
Problem Statement

● Storing image in cloud is common


● Numerous attacks are present and it isn’t safe
● Cloud is huge and can store unlimited data
● Time is what we need to make data quickly accessible

4
Objectives

● Implementing Secret Image Sharing applying SVD for faster


generation of secret images
● Analyze performance against time and error

5
Significance of Study

● Store image in cloud as shares increasing security


● Applicable to crucial medical and military

6
Literature Review

● Shamir A.[1] proposed a (k, n) threshold based secret sharing for


sharing secret key
● Thien and Lin[2] proposed a secret image sharing technique
based on Shamir's algorithm
● Yang and et al[3] in their paper proposed a reversible secret
sharing using Discrete Haar wavelet transform to reduce the
number of operation
● Sudeep D. Thepade and Rupali S. Patil[4] proposed a novel
approach based on Thien and Lin

7
Literature Review

● Zhili Zhou and et al[5] proposed a Secret Image Sharing based on


Encrypted Pixels
● Priyanka Singh and et al[6] proposed Secret Image Sharing on
cloud using Fractional Fourier Transform

8
Methodology

● Using standard data used by others


● Lena, bus, baboon, airplane, peppers
● Square image will be assumed

9
Methodology(Proposed method)

Shadow Image Generation

10
Methodology(Proposed method)

Original Image Construction

11
Methodology

● No violation on Shamir’s Secret Sharing Algorithm


● Calculate of time and error

12
Methodology(OS/Languages)

● Kubuntu 18.04
● Intel Core i7-4720 @ 2.60GHz x 8 cores
● 16GB RAM
● Python2.7
○ PIL - Image library
○ Numpy - Numerical Operations

13
Expected Outcome

● Colored shadow images


● Expect to perform quicker being operated diagonally only
● Comparison of proposed algorithm with other in terms of time
and error

14
Timeline

April May June July August September

Identifying research

Research Question

Proposal

Implementation

Midterm Defense

Analysis

Final Presentation

Documentation

15
References

1. A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp.612–613, Nov. 1979.
[Online]. Available: http://doi.acm.org/10.1145/359168.359176
2. C.-C. Thien and J.-C. Lin, “Secret image sharing,”Computers &Graphics, vol. 26, no. 5,
pp. 765 – 770, 2002. [Online].
Available:http://www.sciencedirect.com/science/article/pii/S0097849302001310
3. H. S. Chyuan-Huei Thomas Yang, Yuan-Hui Huang, “Reversible secret imagesharing based
on shamir’s scheme with discrete haar wavelet transform,”978-1-4244-8165-1/11/IEEE,
September 2011
4. R. S. P. Sudeep D. Thepade, “Novel reversible image secret sharing based onthien and lin’s
scheme using discrete haar wavelet transform,”978-1-4799-6272-3/15/IEEE, January
2015
5. Z. Zhou, C. Yang, Y. Cao, and X. Sun, “Secret image sharing based on encrypted
pixels,”IEEE Access, vol. 6, pp. 15 021–15 025, 2018
6. P. Singh, B. Raman, and M. Misra, “A secure image sharing scheme based on svd and
fractional fourier transform,”Signal Processing:Image Communication, vol. 57, pp. 46 –
59, 2017.
16
Thank
You

You might also like