Big Data

(Data security and integrity)

Author name (1) – Author name (2) –
Atherv Saxena Aniket Singh
Student of National PG College,
Student of National PG College,
Lucknow , India.
Lucknow , India.
email- athervsaxena99@gmail.com

Abstract – Now-a-days data is most important thing for

any company or organization for its survival in the
world. Anything ranging from person name and their
market or this changing world. A new problem is created
contact information, to products sold, to profits made, to
by continuous growth in the importance and volume of
employees hired, etc. has become essential in day-to-day
data: it cannot be handled by traditional analysis
continuity. To fulfill all the above needs DATA and its
techniques. Therefore, this problem was solved through
storage has to be their. The building block upon which
the creation of a new paradigm: Big Data. Big Data
any organization thrives is data. Now a days,
originated new issues related not only to the volume or
organizations completely rely on the data for all their
the variety of the data, but also to data security and
improvements in every field.
privacy. To obtain a full perspective of the present day
scenario, we decided to carry out an investigation with
the objective of highlighting the main issues regarding
BIG DATA, is a term used to describe a massive amount
Big Data security and integrity. We explained the process
of data and its storage in the highest efficient form. In
of systematically arranging of data and measures to
simple words, big organizations have their data spread in
secure data and how to maintain its integrity. It is almost
a massive amount and they deal with their storage in an
impossible to carry out detailed research into the entire
efficient manner which gives the ease to work on that
topic of security because there are numerous ways to
data. All of that falls under big data. Efficiency of big
attack data and in present day no organization is able to
data includes the security and integrity of big data. The
secure its data cent percent efficiently, there is always a
large the amount of data, the bigger the threat of losing it
loop hole and variety of organizations and its massive
or being stolen. In this time we have uncountable ways to
data types.
protect our data and maintain its integrity but very few
Keywords – Big Data, security, integrity, fourier are most efficient ones. Organizations are continuously
transform, Hadoop working on this aspect of big data and day to day
advancements are coming in the vision. Traditional
Introduction –We can’t imagine a world without data database systems are not able to capture, store and
storage no matter big small. If we do so then this world analyze large amount of data. Amount of big data
would be a place where every detail about a person or continue to grow by the increasing rate of internet. New
organization or company, every transaction no matter ways for businesses and government to analyze
small or big performed, or every information which can unstructured data are provided by big data analytics.
be documented for future use is lost directly after use.
That would make organizations lose the ability to extract Big data is a term that describes any large volume amount
valuable information and perform analyses, which leads of structured, semi-structured and unstructured data that
them to become a failure in this fast moving has the potential to be mined for information. The
thereVs that define Big Data are Variety, Velocity and
Volume.

Volume: Not just in the form of text data, but also in the
form of videos, music and large image files. Data is
stored in terms of Terabytes and even Petabytes in following parameters, or a combination of them, or even
different companies. We need to re-evaluate the all of them together.
architecture and applications built to handle the data
Big Data originated new issues related not only to the
provided by big data analytics.
volume or the variety of the data, but also to data security
and privacy. It is recorded that of all the data in recorded
human history, 90 percent has been created in the last few
Velocity: Data is streaming in at unimaginable speed and
years. In 2003, 5 exabytes of data were created by
must be dealt with in a timely manner. RFID tags, sensors
humans, and this amount of information is, at present,
and smart metering are driving the need to deal with tons
created within two days. We are living in the era of Big
of data in near-real time. Reacting fastly enough to deal
Data, Big Data not only increases the scale of the
with data velocity is a challenge for most organizations.
challenges related to privacy and security as they are
addressed in traditional security management, but also
create new ones that need to be approached in a new way
Variety: It refers to the ever increasing different forms of no stats of increasing data is going down. Furthermore,
data that can come in the form of texts, images, voices this data is mostly unstructured, signifying that traditional
and geospatial data, computer generated simulations. The systems are not capable of analyzing it. The division of
variety of data can be characterized along several Big Data security into four principal topics has been used
dimensions. Some of these are: by the International Organization for Standardization in
order to create a security standard for security in Big
Data.
 Structural variety: It refers to the difference in
the representation of the data. Satellite images of
wildfires from NASA are very different from
tweets sent out by people seeing the spread of
fire.
 Media Variety: Media variety refers to the
medium in which the data gets delivered. For
example: The audio of a speech and the
transcript of a speech represent the same
information in various media.
 Semantic variety: It comes from different
assumptions of conditions on the data. Like
conducting 2 income surveys on two different
groups of people and not being able to compare
or combine them without knowing more about
the populations themselves.

Objectives for data security-

There are two other advantages of defining Big Data:
Variability: In addition to the increasing speed and
varieties of data, data flows can be highly inconsistent
with periodic peaks. To manage daily, seasonal and
event-triggered peak data loads can be challenging. Even
more so with unstructured data involved.
Complexity: Today's data comes from multiple sources.
And it is still an undertaking to link, match and transform
data across systems. However, it is necessary to correlate
relationships, hierarchies and multiple data linkages or
your data can quickly spiral out of control. A data
environment fall along the extremes on any one of the
Although there are attempts at coming up with a security
solution/definition that can address many different
scenarios, we believe that there is no one size fit all
solution for data security. Instead, multiple dimensions
need to be tailored for different application aspects to
achieve practical solutions. We need to understand the
right definitions of security risk, for example, in data
sharing scenarios, probability of re-identification given
certain background knowledge could be the considered
right measure of security risk. Given these 3Ds, one can
imagine a multi-objective framework where different
dimensions could be emphasized:
 Maximize utility, given risk and costs constraints: This
would be suited for scenarios where limiting certain
security risks are paramount.
 Minimize security risks, given the utility and cost done on how to efficiently enforce such policies in
constraints: In some fields, (e.g., medical care), recently developed big data stores.
significant degradation of the utility may not be allowed.
Automatically designing, evolving, and managing access
In this setting, the parameter values of the protocol are
control policies. Dealing with dynamic environments
chosen in such way that we try to do our best in terms of
where sources, users, and applications as well as the data
given our utility constraints. Please note that in some
usage are continuously changing, the ability to
cases, there may not have any parameter settings that can
automatically design and evolve policies is critical we
satisfy all the constraints.
make sure that data is readily available for use while at
 Cost minimization, given the utility and risk the same time assuring data confidentiality. Atmosphere
constraints: In some cases, (e.g., cryptographic and tools for managing policies are also crucial.
protocols), you may want to find the protocol parameter
Integrity preserving techniques- A major issue
settings that may allow for the lowest expensive protocol
arising from big data is that correlating many (big) data
that can satisfy all the utility and cost constraints.
sets one can extract any information whether relevant to
Data Integrity- Several data confidentiality techniques him or not. Relevant issues and research directions that
and mechanisms exist – the most notable being access need to be investigated include:
control systems and encryptions. We need approaches for
Techniques to control what is extracted and to check that
access control systems for big data:
what is extracted can be used and/or shared.
Merging large numbers of access control policies. In
Defining personal as well as population boundaries. It is
many cases, big data entertains integrating data
important to understand what is extracted from the data
originating from multiple sources; these data may be
as this may lead to discrimination and affect other’s
associated with their own access control policies (referred
privacy. Also when dealing with security with privacy, it
to as “sticky policies”) and these policies enforced even
is important to understand the privacy policies and
when the data is integrated with other data. Therefore
copyrights defined by one in his/her particular schemes.
they need to be integrated and conflicts solved.
Privacy enhancement techniques. Several such techniques
Administering authorizations for big data and in
including oblivious RAM, security multiparty
particular for granting permissions. If fine access control
computation, multi input encryption and various other
is required, manual administration on large data sets is
types of encryption. However they are not yet practically
not feasible. We need technologies by which
applicable to large data sets. We need to engineer these
authorization can be automatically granted, possibly
techniques, using for example parallelization, to fine tune
based on the user digital identity, profile, and context,
their implementation and perhaps combine them with
and on the data contents and metadata.
other techniques, such as differential privacy. A approach
Enforcing access control policies on heterogeneous multi- which can be used is that, first use the clean or sanitized
media data. Access control is an important type of access data (which means a data which comes under a particular
control by which authorizations are granted or denied field) then the non-sanitized data.
based on the content of data. Access control is critical
Defining data privacy policies. Policies must be designed
when dealing for video surveillance applications which
in such a way which is easily understandable by users.
are important for security. For privacy such videos have
We need to understand user expectations in terms of
to be protected. Supporting access control requires
privacy and not to make it too hard to obey.
understanding the contents of protected and this is very
challenging when dealing with multimedia large data Data services and mentioning them. Data is sold with
sources. their privacy preserving terms and policies. Data services
must be listed on purchase. No hidden terms and
Enforcing access control policies in big data stores. Some
condition should be there such that user can’t follow
of the big data systems allow its user’s to submit arbitrary
them.
jobs using programming languages such as Java. For
example, in Hadoop, users can submit arbitrary Data publication. Perhaps we should abandon the idea of
MapReduce jobs written in Java. This gives rise to publishing data, given the privacy implications, and
significant challenges to enforce fine grained access rather require the data user to use a controlled
control efficiently for different users. Although there is environment (perhaps located in a cloud) for using the
some existing work that tries to inject access control data. In this way, it would be much easier to control the
policies into submitted jobs, more research needs to be proper use of data.
Privacy implication on data quality. Recent studies have
shown that people lie especially in social networks
because they are not sure that their privacy is preserved.
This result in a decrease in data quality that then affects
decisions and strategies based on these data.
Data Management- Data management focuses o
n what to do once the data is contained in the Big Data
environment. It not only shows how to secure the data
that is stored in the Big Data system, but also how to
share that data.
Security at Collection or Storage
Big Data usually implies a huge amount of data. It is,
therefore, important not only to find a means to protect
data when it is stored in a Big Data environment, but also
to know how to initially collect that data. In order to
solve these problems, a mechanism with which to protect
data owners’ privacy by creating a parameter to measure
the acceptable level of privacy should be used. Another
approach found in, suggests that security storage can be
protected by dividing the data stored in the Big Data
system into sequenced parts and storing them in different
cloud storage service providers.
Policies, Laws, or Government
Every disruptive technology brings new problems with it,
and Big Data is no exception. The problems related to
Big Data are mostly related to the increase in the use of
this technique to obtain value from a large amount of data
by using its powerful analysis characteristics. This would
imply a risk on people’s privacy. In order to reduce that
risk, many authors propose the creation of new legislation
and laws that will allow these new problems to be
confronted in an effective manner. Some frameworks or
initiatives that attempt to establish a robust government
of the security of the data in a Big Data system.
Sharing Algorithms
In order to obtain the maximum possible information
from data, it is necessary to share that data among the
cluster in which Big Data is running or to share those
results for collaboration. However, again, we have the
problem of how to guarantee security and privacy when
that sharing process is taking place. This problem is
solved by increasing the surveillance of the user taking
part in data sharing, while others propose securing the
transmission itself by creating a new technique based on
nested sparse sampling and coprime sampling.
Techniques used to secure Big Data-
Data Provenance-
This is a whole other category of data that needs
significant protection. The CSA recommends first
developing an infrastructure authentication protocol that
controls access, while setting up periodic status updates
and continually verifying data integrity by using
mechanisms such as checksums.
Maintaining Transactions Logs-
Storage management is a key part of the Big Data
security equation. Using signed message o digests to
provide a digital identifier for each digital file or
document, and to use a technique called secure untrusted
data repository (SUNDR) to detect unauthorized file
modifications by malicious server agents.
The handbook lists a number of other techniques as well,
including lazy revocation and key rotation, broadcast and
policy-based encryption schemes, and digital rights
management (DRM). However, there's no substitute for
simply building your own secure cloud storage on top of
existing infrastructure.
Distributed Programming Frameworks must be
safe- Distributed programming frameworks such as
Hadoop make up a huge part of modern Big Data
distributions, but they come with serious risk of data
leakage. They also come with what's called "untrusted
mappers" or data from multiple sources that may produce
error-ridden aggregated results.
The distributed modules of data must be safe with distinct
encryption techniques and maintain integrity by defining
access levels and authorization. This way may lead
complications but at the security’s point of view this
method provide a better security than all others.
Security of Non-Relational Data-
Non-relational databases such as NoSQL are common but
they're vulnerable to attacks such as NoSQL injection.
Beyond those core measures, plus layers such as data
tagging and object-level security, you can also secure
non-relational data by using what's called pluggable
authentication modules (PAM); this is a flexible method
for authenticating users while making sure to log
transactions by using a tool such as NIST log. Finally,
there's what's called fuzzing methods, which expose
cross-site scripting and injecting vulnerabilities between
NoSQL and the HTTP protocol by using automated data
input at the protocol, data node, and application levels of
the distribution.
Filtering at Endpoint and Validation -
Endpoint security is paramount and your organization can
start by using trusted certificates, doing resource testing,
and connecting only trusted devices to your network by
using a mobile device management (MDM) solution (on
top of antivirus and malware protection software). From
there, you can use statistical similarity detection
techniques and outlier detection techniques to filter
malicious inputs, while guarding against cyber attacks.
Real-Time Complaint Service and Security
Monitoring
Although, complaints are the headaches for the
organizations but considering them as a feedback some
problems or discrepancies can be solved in real time. It's
best to tackle it head-on with real-time analytics and
security at every level of the stack rather than after whole
stack. We can mine logging events, deploy front-end
security systems such as routers and application-level
firewalls, and begin implementing security controls
throughout the stack at the cloud, cluster, and application
levels. Data positioning attacks can be reduced by this
technique.
Encryption of data or Cryptography of data -
Mathematical cryptography hasn't gone out of style; in
fact, it's gotten far more advanced. By constructing a
system to search and filter encrypted data, such as the
searchable symmetric encryption (SSE) protocol,
enterprises can actually run Boolean queries on encrypted
data. Relational encryption allows you to compare
encrypted data without sharing encryption keys by
matching identifiers and attribute values. Identity-based
encryption (IBE) makes key management easier in public
key systems by allowing plaintext to be encrypted for a
given identity. Attribute-based encryption (ABE) can
integrate access controls into an encryption scheme.
Finally, there's converged encryption, which uses
encryption keys to help cloud providers identify duplicate
data.
Access control at each level-
Access control is about two core things: restricting user
access and granting user access. For setting up granular
access controls, we can consider some points-
Normalize mutable elements and de-normalize
immutable elements.
Track secrecy requirements and ensure proper
implementation.
Maintain access labels.
Track admin data.
Use single sign-on (SSO).
Use a labeling scheme to maintain proper data federation.
Continuous Error checking or Auditing of
Data-
Auditing at each access level is a must in Big Data
security, particularly after an attack on your system.
Organizations should create a cohesive audit view
following any attack, and be sure to provide a full audit
trail while ensuring there's easy access to that data in
order to cut down incident response time.
Audit information integrity and confidentiality are also
essential. Audit information should be stored separately
and protected with lower user access controls and regular
monitoring. Make sure to keep your Big Data and audit
data separate, and enable all required logging when
you're setting up auditing (in order to collect and process
the most detailed information possible). An open-source
audit layer or query orchestrator tool such as Elastic
Search can make of all this easier to do.
Fourier masking encryption algorithm-
There are several encryption algorithms that are the
outcome of extensive research in the recent years. Some
of them indeed provide good security but some others are
vulnerable to either brute-force or cryptanalytic attack.
Some of them are easy to implement in hardware with
high processing power and storage capacity and some
others are good for limited devices like mobile phones,
PDAs etc. Most of the available cryptographic algorithms
are based upon number theory which use finitefield such
as GF(p) or GF(2n ). Most of these number theoretic
algorithms are more secure when they use large prime
numbers or large binary words [1, 2]. But when the
precision and bit-width increases, the hardware in which
the algorithm is to be implemented must be sophisticated
in processing power and storage capacity and hence it
tends to high cost. We have developed such an
encryption/decryption algorithm which exploits the
versatility of Fourier series [3, 4].
Fourier Series (FS): A series proposed by the French
mathematician Fourier about the year 1807. The series
involves the sines and cosines of whole multiples of a
varying angle and is usually written in the form:
y = H0 + A1sin x + A2sin 2x + A3sin 3x + … B1cos x +
B2cos 2x + B3cos 3x + …. (1)
By taking a sufficient number of terms the series may be
made to represent any periodic function of x [4]. The
original definition of FS restricts the angles to be
harmonically related. But we extend the original
definition of FS according to our need for the
compatibility with our proposed algorithm. The form of
the FS that we developed is presented in the next section.
There are several encryption algorithms for symmetric
key encryption. There are also block cipher algorithms
that operates on a single block at a time. But block
ciphers can also be implemented for stream encryption in
several modes. For example, DES (Data Encryption
Standard) is a block cipher technique but can be used for
stream encryption in ECB (Electronic Code-Book), CFB
(Cipher Feed Back), Counter modes. Other encryption
algorithms are AES (Advanced Encryption Standard),
BlowFish, RC4 etc. All these algorithms are based upon
number theory (finite-field is used) and use some
additional storage like S-box (Substitution Box),
Permutation Table, Initial Value etc. These algorithms
are also complex in nature, as the encryption process is
very much complex. But when complexity is increased,
the difficulties of hardware and software implementation
are also raised. Computational complexity does not
matter if the algorithm can provide with a strong defense
against fraud. But if we consider developing any
encryption algorithm for limited devices like mobile
phones, PDAs, BlueTooth hardware etc, storage capacity
and processing power of that device is also a matter of
concern. In that case, we must explore for an algorithm
which is simpler in hardware implementation but holds a
very strong position against intruders.
Proposed Algorithm- We have developed a function
which is
like Fourier series [3, 4] or trigonometric polynomial that
is used to generate unpredictable key sequence. The
function takes a password of any length chosen by the
encryption party and results in key sequence. We found
that by evaluating Fourier series, a good randomness can
be achieved. The sequence is then XORed with the
plaintext to get the cipher text. The function is the heart
of this algorithm and named as ‘Masking Function’.
Fourier_Masking_Encryption _Algorithm (FMEA)
Part – 1 (Construction of Masking Function)
 Choose any password in the form of ASCII text.
 Convert the values of the characters in the
chosen password to their equivalent extended
ASCII values and put the values in the vector P =
{P1, P2, P3 … PM}. [Here M = number of
characters in the password].
 If M is odd then pad a one ‘1’ at the end of the
vector P. [So that after this padding operation
PM becomes equal to ‘1’ and the value of M is
increased by one].
 Using the definition of the (2) construct the
masking function. As the masking function is
ready, encryption/decryption procedure is
followed.
Part – 2 (Encryption/Decryption)
{Encryption}
 Take the plain text sequence in the form of
ASCII text. II.
 Convert the characters in the plain text to their
equivalent extended ASCII values and put the
values in the vector X = {X1, X2, X3 … XN}.
[Here N = number of characters in the plain
text].
 Generate the cipher text sequence Y = {Y1, Y2,
Y3 … YN} by Yi = Xi ⊕ f(i, Xi-1) where X0 =
P1.
{Decryption}
 Take the cipher text sequence in the form of
ASCII text.
 Convert the characters in the cipher text to their
equivalent extended ASCII values and put the
values in the vector Y = {Y1, Y2, Y3 … YN}.
[Here N = number of characters in the cipher
text].
 Retrieve the plain text sequence X = {X1, X2,
X3 … XN} by Xi = Yi ⊕ f(i, Xi-1) where X0 =
P1.
Cryptography terms
Encryption:
It is the method of locking encryption using
cryptography.
Decryption:
Process of unlockimg encrypted data using cryptographic
technique.
Key:
A secret password used to encrypt and decrypt
information and data.
Symmetrical Encryption
This is the simplest kind of encryption that involves only
one secret key to cipher and decipher information. The
most commonly used symmetrical encryption technique
are AES-192,RC4,DES,AES-256.
3. Client receives this data and decrypts it.
It uses the fact that it is difficult to factorize a large
number.
Example:
Select two prime numbers p = 27 and q = 36 now public
key n = p*q = 972
We need an exponent e, such as e is-
 An integer
 Not a factor of n
 1<e<$(n) let e = 4
 Public key is made of n and e
 We calculate $(n) = (p-1)(q-1) = 910
 Now calculate private key d, d = (k*$(n) + 1)/e
for some integer k = 2, value of d = 455

Convert DE into numbers 45

Encrypted data c = 454mod972 thus our encrypted data

becomes 729 .

Decrypted data = 729455mod972 thus our decrypted data

is 45 which is equivalent to DE.
Asymmetrical Encryption // C program for RSA asymmetric cryptographic
// algorithm. For demonstration values are
It is relatively new method. It consist 2 keys one is public // relatively small compared to practical
key that is made available freely to anyone who wants to // application
send a message to you. The second is private key and is #include<stdio.h>
secret that only you can know. It is better in ensuring #include<math.h>
security of information transmitted during
communication. Common used algorithms are // Returns gcd of a and b
int gcd(int a, int h)
RSA,DSA,PKCS.
{
int temp;
while (1)
{
temp = a%h;
if (temp == 0)
return h;
a = h;
h = temp;
}
}

// Code to demonstrate RSA algorithm

int main()
{
// Two random prime numbers
RSA Algorithm double p = 3;
double q = 7;
RSA is an algorithm used by modern computers
to encrypt and decrypt messages. It is an asymmetric // First part of public key:
cryptographic algorithm. double n = p*q;
Process involves : // Finding other part of public key.
// e stands for encrypt
1. A client (for example browser) sends its public key double e = 2;
to the server and requests for some data. double phi = (p-1)*(q-1);
2. The server encrypts the data using client’s public while (e < phi)
key and sends the encrypted data.
 { DIGIT MULTIPLIER OPERATION
// e must be co-prime to phi and USED
// smaller than phi. 0 1 s-p
if (gcd(e, phi)==1) 80 s-80p
1
break;
2 60 s-60p
else
e++; 3 40 s-40p
} 4 20 s-20p
5 00 s
// Private key (d stands for decrypt) 6 20 s+20p
// choosing d such that it satisfies 7 40 s+40p
// d*e = 1 + k * totient 8 60 s+60p
int k = 2; // A constant value 9 80 s+80p
double d = (1 + (k*phi))/e;

// Message to be encrypted After performing these operations on encrypted data s we

double msg = 20; would get a number say r

printf("Message data = %lf", msg);
// Encryption c = (msg ^ e) % n
double c = pow(msg, e);
c = fmod(c, n);
printf("\nEncrypted data = %lf", c);
// Decryption m = (c ^ d) % n
double m = pow(c, d);
m = fmod(m, n);
printf("\nOriginal Message Sent = %lf", m);
return 0;
}
OUR NEW ENCRYPTION TECHNIQUE
Following encryption technique is arithmetic formula
based technique which will be useful in encrypting large
digit passwords effectively and characters too. This could
be understood by taking a simple example let us take for
ease that we want to encrypt a number say 91
Step 1: for encryption we would consider unit digit
which is 1 here now the unit digit be q and the rest digit
be p here q = 1 and p = 9.
Step 2: now we will make q a two digit number by
adding 0 to the tenth’s place so q = 01
Step 3: now we will use the given formula p2 + p
Here data will be 81 + 9 = 90
Step 4: now we will square q and add it to the unit’s and
tenth’s place then our encrypted data will become 9001.
Let encrypted data be s so s = 9001. This will be our
encrypted data note that if q2 is itself a two digit integer
then we will suppose we take q = 04 then q2 = 16 not 016
we will only consider one’s and tenth’s place
Step 5: to decrypt the data we would first compare the
unit’s digit to the integers from 0-9 and will perform the
operation as stated in following table
Step 6: to get decrypted data we would find square root
of r and we would get decrypt data.
Say in the given case since unit digit is 1 we would
subtract 80p = 720 from s as r = 9001 - 720 = 8281
So r = 8281 whose square root will give 91.
Advantages
Since p will be indistinguishable by looking at encrypted
number so it will be safe for encrypting valuable
information.
Any information which have more and more digits would
be more secure for instance the aadhar card has 12 digits
so the square of this 12 digit number would be more.
Also a particular number other than unit’s place number
could be used as public key.
It could be combined with RSA to make it more tough to
decrypt the term k used there we could first encrypt the
data according to this formula and then can use in the
formula for encrypted data then after decrypting and
finding c it would be further simplified accordingly.
It could be used in multi encryption technique having
independent key.
REFERENCES
1. Security Issues associated with big data in cloud
computing by Venkata Narasimha Inukollu, Sailaja Arsi
and Srinivasa Rao Ravuri.
2. Information Security in Big Data by Lei XU ,
Chunxiao Jiang , Jian Wang Jian Yuan and Yong Ren
3 .Use of Digital Signature with Diffie Hellman Key
Exchange and AES Encryption Algorithm to Enhance
Data in Cloud Computing by Prashant Rewagad and
Yogita Pawar
4.The rise of Big Data on cloud computing by Ibrahim
Abaker Targio Hashem, Ibrar Yaqoob Sameer Ullah
Khan ,Abdullah Gani.
Date: Monday, October 08, 2018
Statistics: 1082 words Plagiarized / 3886 Total
words
Remarks: Medium Plagiarism Detected - Your
Document needs Selective Improvement.
--------------------------------------------------
-----------------------------------------

Plagiarism Checker X
Originality Report
Similarity Found: 08%