Distributed Secret Sharing Approach with Cheater Prevention based on QR Code

Abstract
QR barcodes are used extensively due to their beneficial properties,
including small tag, large data capacity, reliability, and high-speed scanning.
However, the private data of the QR barcode lacks adequate security protection.
In this article, we design a secret QR sharing approach to protect the private QR
data with a secure and reliable distributed system. The proposed approach
differs from related QR code schemes in that it uses the QR characteristics to
achieve secret sharing and can resist the print-and-scan operation. The secret
can be split and conveyed with QR tags in the distribution application, and the
system can retrieve the lossless secret when authorized participants cooperate.
General browsers can read the original data from the marked QR tag via a
barcode reader, and this helps reduce the security risk of the secret. Based on
our experiments, the new approach is feasible and provides content readability,
cheater detectability, and an adjustable secret payload of the QR barcode.

EXISTING SYSTEM
TV based regularizations
It is used for deconvolution and denoising of QRCODE. Specically, it
perform the following four steps:
(i)

denoising the signal via a weighted TV ow;

(ii)

estimating the point spread function by a higher-order smooth

regularization method based upon

comparison of the known nder pattern in the upper left corner with
the denoised signal from step (i) in the same corner;
(iii)

applying appropriately regularized deconvolution with the PSF of

step (ii);

(iv)

thresholding the output of step (iii).

It also compare the full method with the following subsets/modications of

the four steps: steps (i) and (iv) alone; and the replacement of step (ii)
with a simpler estimation based upon a uniform PSF ansatz. Preliminary
experiments showed that if we perform denoising and kernel estimation at
the same time, the results are much worse than when we dedicate

separate steps to each procedure. Hence, we rst denoise the image using
the weighted TV ow.
TV flow
The ow (3) is closely related to the standard total variation ow and can
be obtained as a limiting case of hierarchical (BV a , L 2 ) decomposition
of f . Here, the BV a semi-norm of u is dened as |u| BV a := _ a|u|. In the
hierarchical (BV a , L 2 ) decomposition of f , ner scale components are
removed from f successively. The weight function a reduces the diffusion
at prominent edges of the given QR image, i.e. at points x where the
gradient

is

high.

The

Gaussian

smoothing

avoids

false

characterization of noise as edges, and the value of is chosen so that

a(x) is small at relevant edges in the image. The function (t ) in (3) is the
monotonically increasing speed function. It can be shown (cf. [45]) that
the speed of the ow is directly dependent on (t ); more precisely _ u t
= (t ), where __ a * denotes the dual of the weighted BV semi-norm, with
respect to the L 2 a inner product.

Whenever a user types in her password in a banks signin box, the

keylogger intercepts the password. The threat of such keyloggers is
pervasive and can be present both in personal computers and public
kiosks; there are always cases where it is necessary to perform financial
transactions using a public computer although the biggest concern is that
a users password is likely to be stolen in these computers. Even worse,
keyloggers, often rootkitted, are hard to detect since they will not show up
in the task manager process list.

Disadvantage
Algorithm is complex

Time consuming
Not reliable for large data.

PROPOSED SYSTEM:

Proposed System and its Advantages

Ridgelet Image Denoising
The ridgelet denoising is used to recover the original signal from the
noisy one by removing the noise.
In contrast with denoising methods that simply smooth the signal by
preserving the low frequency content and removing the high
frequency

components,

the

frequency

contents

and

characteristics of the signal would be preserved during ridgelet

denoising.
It maps the line singularities into point singularities by employing
the embedded transform.
Therefore, the wavelet transform can efficiently be applied to discover
the point singularities in this new domain.
Having the ability to approximate singularities along a line, several terms
with common ridge lines can effectively be superposed by the ridgelet
transform.
Algorithm Example:
To explain the ridgelet denoising procedure, assume I[i,j] to be the
original M by M image, where i and j = 1, 2,, M, and S[i,j] = I[i,j] + n[i,j]

is the image corrupted by additive noise n[i,j] which is identically

distributed and independent of I[i,j].
1. In the first step of ridgelet denoising, the observed image S is
transformed into the ridgelet domain.
2. Then the ridgelet coefficients are thresholded and finally the
denoised coefficients are transformed back to reconstruct the
image.
3. Let RD and RR be the forward ridgelet decomposition and inverse
ridgelet reconstruction transforms. Assume T and to be the
thresholding operator and threshold respectively. Threshold value
will be defined using point spread function.
Cross-validation methods
Cross-validation methods attempt to directly estimate the extra-sample
prediction error in a nonparametric, data-driven way.
Cross-validatory techniques for model selection are very general, in the
sense that they can be used with any loss function L or nonlinear
model generator, unlike other approaches to model selection whose
applicability is typically restricted to quadratic loss and linear model
settings.
Therefore cross-validation is particularly appropriate for scale selection in
our context of denoising by nonlinear diffusion under arbitrary loss
function.
Note, however, that for cross validation techniques to work well in our
problem, it is important that the noise elements Ni at different pixels are
uncorrelated. For example, if noise at neighboring pixels is positively
(negative) correlated, then models selected by unadapted cross-validation
tend to overfit (resp. underfit) the data.

Key Distribution Scheme (KDS)

The deblurring and denoising of QRCODE is useful only in data
transmission. So in order to implement this technique we have taken a
message sharing application in which a user may need to communicate
with other users securely. In this application, when a user send a message
to another user, it will be sent in an encrypted format using QRCODE. This
qrcode will be sent to both sender and receiver by the server. So
whenever a user need to communicate with other user, he need to use
this QRCODE. If its right, the data will be decrypted and the message will
be displayed.

Advantage:
No frequency elimination. So all types of frequency will be used
More efficient for large size data
Accuracy will be more

Input design

The input design is the link between the information system and the user. It
comprises the developing specification and procedures for data preparation and
those steps are necessary to put transaction data in to a usable form for
processing can be achieved by inspecting the computer to read data from a
written or printed document or it can occur by having people keying the data
directly into the system. The design of input focuses on controlling the amount
of input required, controlling the errors, avoiding delay, avoiding extra steps and
keeping the process simple. This project will have a users registration details as
an input attribute for generation of QRCODE. It will also have message from a
user forum as input. Both message in an encrypted format using DES algorithm
and QR Code will be sent as a mail to the receiver.
Output design

The ouput design is used to select methods for presenting information. It is used
to create document, report, or other formats that contain information produced
by the system. It decides the output form of an information system should
accomplish one or more of the following objectives. Convey information about
past activities, current status or projections of the Future. Signal important
events, Opportunities, problems, or warnings, trigger an action and to confirm an
action.
In this project we will have the output as the decrypted message that can
be readable by the receiver. The QRCODE will be sent by the sender to receivers
mail id which should be given in the receiver side. The right QRCODE will
generate the exact message that is sent by the server.

Architecture Diagram

QR code
generat
or

Retrieve
message
r

Messagi
ng
Techniqu
e

QR code
Deblurin
g

Encryption
of message
with QR
code

Denoisin
g QR
CODE

Domain Details
Network Security
Network security consists of the policies and practices adopted to prevent
and monitor unauthorized access, misuse, modification, or denial of a computer
network and network-accessible resources. Network security involves the
authorization of access to data in a network, which is controlled by the network
administrator. Users choose or are assigned an ID and password or other
authenticating information that allows them access to information and programs
within their authority. Network security covers a variety of computer networks,
both public and private, that are used in everyday jobs; conducting transactions
and communications among businesses, government agencies and individuals.
Networks can be private, such as within a company, and others which might be
open to public access. Network security is involved in organizations, enterprises,
and other types of institutions. It does as its title explains: It secures the network,
as well as protecting and overseeing operations being done. The most common
and simple way of protecting a network resource is by assigning it a unique
name and a corresponding password.
Image processing
Image processing is processing of images using mathematical operations by using any
form of signal processing for which the input is an image, a series of images, or a video, such as
a photograph or video frame; the output of image processing may be either an image or a set of
characteristics or parameters related to the image. Most image-processing techniques involve

treating the image as a two-dimensional signal and applying standard signal-processing

techniques to it. Images are also processed as three-dimensional signals where the thirddimension being time or the z-axis.
Image processing usually refers to digital image processing, but optical and analog image
processing also are possible. The acquisition of images (producing the input image in the first
place) is referred to as imaging.
Closely related to image processing are computer graphics and computer vision. In computer
graphics, images are manually made from physical models of objects, environments, and
lighting, instead of being acquired (via imaging devices such as cameras) from natural scenes,
as in most animated movies. Computer vision, on the other hand, is often considered highlevel image processing out of which a machine/computer/software intends to decipher the
physical contents of an image or a sequence of images (e.g., videos or 3D full-body magnetic
resonance scans).
In modern sciences and technologies, images also gain much broader scopes due to the ever
growing importance of scientific visualization (of often large-scale complex scientific/experimental
data). Examples include microarray data in genetic research, or real-time multi-asset portfolio
trading in finance.