Plagiarism Scan Report

Summary
Report Genrated Date 24 Oct, 2017
Plagiarism Status 87% Unique
Total Words 792
Total Characters 4980
Any Ignore Url Used

m
Content Checked For Plagiarism:

co
Hitesh Patel et al. [] stated that users have multiple accounts or di ferent web-
sites. In this case, users has to know that user-names and password or all those
accounts. But it can cause challenges or the user to remember . In order to solve

s.
this problem, OpenID is one the emerging and popular way to address this issue and
can be practically deployed.
OpenID mechanism is a decentralized authentication scheme or the SSO (Single

l
Sign On) mechanism. OpenID users can choose a trustworthy OpenID server to reg-
oo
ister their identity. In OpenID mechanism, users only need to have a pair o identity
and password. The User then submits his credentials OpenID Identity provider which
are used by service provider.
T

Seung-Hun Jin et al. [] has discussed how OpenID uses a symmetric cryptogra-
phy. It’s simple to use than the asymmetric one but more vulnerable than asymmetric
eo

encryption. And also, even more e forts to improving security on the process, are not
enough to improve security with only using HTTPS. And it might need a better ap-
proach to solve this.
lS

In this paper, author analyzed the Single Sign-On in OpenID and showed an
experiment describing vulnerability o OpenID. There ore it is too dangerous. I an
attacker obtains the URL when an IdP redirect an user to a SP with authentication
al

assertion which does not include a signed element, the attacker can access the SP as
the user too easily.
m

Gerald Weber et al. [] stated that enterprises need a way to deliver their services
reliably to as many users as possible. He also suggested that this needs to be done
more securely without sharing any condential in ormation with unauthorized users.
S

Additionally, enterprises need to be able to receive certain guarantees that their users
are conrmed by a trusted party. I enterprises allow their employees to use OpenID
as an identity provider, this issue o security and identity can be reduced on much
greater level.
Harish Bansal et al. [] proposed that biometric identi ication using ingerprints
matching have been used or some years and is most widely used orm o biometric
identi ication. Even a ter the widespread use o ingerprints, there has been very little
statistical work done on the uniqueness o ingerprint minutiae. The ingerprint o an
every individual is unique and it is ormed rom impression o the pattern o ridges
on inger. Fingerprint recognition is the process o comparing a ingerprint against
an another ingerprint to determine i the impressions are o the same inger. This
paper ocuses on ingerprint matching using two types o minutia called termination
and bi urcation. In this paper the utilization o minutiae based technique is discussed
in details to develop a dependable recognition system.
Sally .H. Ismail et al. [] in this paper discussed the utilization o minutiae based
technique in details to develop a dependable recognition system. Minutiae can be
divided into two types which are; Termination points (the points at the termination
o the ridge) and Bi urcations (the points at which a ridge divides into two ridges).
They introduced a comparison o results on standard benchmarks datasets o in-
gerprints such as FVC2002 or assessing the system per ormance based on the False
Acceptance Rate (FAR) and False Rejection Rate (FRR) and accuracy per ormance
metrics.
Abinandhan Chandrasekaran et al. [] proposed an algorithm in this paper which
involves two phases in order to produce a matching score or ingerprint. In the irst
phase, the methodology is used to obtain the common minutiae point set is explained.
In next phase, the technique to per orm actual matching based on the common minu-

m
tiae point set is detailed. The proposed algorithm can generate a matching score
when it obtains a certain number o common minutiae points between the base and

co
the input image i.e. minimum o (N/2) +1 ,where N is the maximum o Number o
detected minutiae points in either the base or the input image.
This algorithm does not require explicit alignment o the two ingerprints im-

s.
ages which are to-be compared and also tolerates distortions caused by alse minutiae
points. This algorithm is also capable o comparing and producing matching scores
between two images obtained rom two di ferent kinds o sensors. There ore it can also
be called as sensor inter-operable.
l
oo
Oluwole Charles et al. [] In this paper, experiments were conducted using FVC2002
ingerprint database.Database comprising our datasets o images o di ferent sources
and qualities.To determine the pattern matching score or ingerprint image, minu-
T

tiae algorithm uses the distance between minutiae and core points. Pattern matching
score o ingerprint relies on distance between minutiae and core points.Relative dis-
eo

tance between core point and minutiae point does not change. The database contains
benchmark ingerprints jointly produced by the biometric systems laboratory,pattern
recognition and image processing laboratory.
lS

Report generated by smallseotools.com

al
m
S