Upload
others
View
20
Download
0
Embed Size (px)
Citation preview
CHAPTER-2
LITERATURE SURVEY
Lee et al (2008) presented a paper that discusses that all the functional and security
related necessities for Radio frequency Identification techniques like system
scalability, inscrutability and anti-cloning are intricate to acquire because of
dominating constraint factors in functional area, memory storage, etc. Because of the
insufficiency of possessions majority of the projected protocols were intended or
proposed by implementing symmetric key in cryptographic algorithm.
Feldhofer and Martin (2008) discussed the motivation intended for incorporate
sturdy cryptographic algorithms inside inactive RFID tag is to prevent counterfeiting
of goods, providing privacy protection, and granting confined entrance to the tag’s
recollection. In contrast to contactless smart cards, passive RFID tags have fierce
restraint regarding authority expenditure as well as chip vicinity due to the increased
operating range and the silicon costs of a passive tag. Authentication allows achieving
the security goals by means of challenge-response protocols. What about the
implementation costs of the cryptographic primitives? An extensive evaluation of
several symmetric-key algorithms and public-key primitives has been done.
Shin et al (2009) presented common authentication protocol that is nice for the
affordable tags supported code and AES. By mistreatment AES, the protocol may
minimize tag resources. After that the shared key could be opened to the globe, the
particular tag IDs encrypted by code square measure secure. The researchers verified
the safety of the protocol mistreatment AVISPA.
Avoine et al (2009) presented a inclusive exploration of privacy-friendly
authentication protocols enthusiastic to RFID. The researchers particularly introduced
assault on CHT, CTI, YA-TRAP*, in addition to as well as the difference of OSK/AO
through common verification. The researchers conjointly rise that several procedure,
similar to O-RAP, O-FRAP along with OSK/BF has not been resistant to
chronological arrange attack. In conclusion, the researchers choose some candidates
that area unit, in line with their criteria, the foremost acceptable ones for sensible
uses.
D'Arco et al (2011) highlighted their concentration on SASI a substitution RFID
authentication protocol, proposed for provided that strong confirmation with
influential reliability. The researchers have been evaluated their economical,
employment the hardware restriction, and may be seen as combined degree example
of the on top of investigation tendency. Though, the preponderance apprehension is
that the genuine protection of those practice, that square measure typically maintained
solely by actually affordable and intuitive arguments. The researchers involvement
offer with this work is to the follow: the researchers begin by performance several
weakness contained by the SASI protocol, and then, the researchers explained though
such weaknesses, through a series of uncomplicated steps, is familiar cause in
Associate in economical approach all undisclosed data used for the authentication
method.
Li et al (2011) stated that RFID (Radio Frequency Identification) technology can
identify an object and get its information conveniently and automatically via radio
waves, but it causes security and privacy problems for its exchange information
without contact and without notifying the tag owner. In response to this situation,
scholars propose many authentication protocols based on cryptographic techniques.
Random numbers play an extremely significant position in individual’s protocols, but
the wrong apply of them leads the protocols vulnerable to attacks. This paper takes
focus on the random numbers in related authentication protocols, then gives some
rules about the using of the random numbers, proposes an analysis method of using
random numbers in RFID schemes to achieving the security and privacy goal and
examples are given at the end.
Lee et al (2011) stated that Radio Frequency Identification (RFID) structure are
steady changing into predominate attributable to their immense applications like
presented chains, inventory, tolling, baggage association, entrance administration etc.
Throughout this paper the researchers recommend many authentication protocols that
area unit all completed from a similar construction blocks. Additional exactly, the
researchers 1st modify the EC (Elliptic Curve) – RAC (Randomized Access Control)
procedure as well as the researchers developed it into several verification procedures.
Lopez et al (2006) presented RFID technology could be a present technology, and
looks destined to become additional an additional present. An earliest cryptanalytic
primitive does not seem to be supported on affordable RFID tags ever since at the
foremost, 4K acquired could also be dedicated to security-related tasks. Furthermore,
not any of the discovered authentication protocols square measure proof against active
attacks. The researchers attempted to concentrate to these 2 problems during this
effort through coming up with a novel verification protocol, secure beside passive as
well as active attacks, affected by Shieh et al. protocol for smart-cards, but modified
to RFID systems.
Chien et al (2007) proposed a replacement fundamental light-weight RFID
verification protocol that gives sturdy verification and sturdy integrity protection of its
transmission and of economical info.
Huang et al (2012) considered the RFID tag-reader common verification theme. A
hardware method of Associate during RFID authentication protocol traditionalist to
EPC category one invention two ordinary is projected.
Firmino et al (2009) stated this protocol is an extension of RFID systems for the
protocol proposed by Kinzel and Kanter, adding to the original protocol: a mutual
authentication and the definition of frames. Through simulations it was possible to
observe that the security level of the proposed protocol is a function only of the
computational resources of the entities in the RFID system.
Batina et al (2007) stated that Public-key cryptography (PKC) proposed a gorgeous
respond to the counterfeiting downside however whether or not a public key
cryptosystem are often enforced on associate degree RFID tag otherwise not
remainder overcast.
Choi et al (2010) presented a paper that designates the deduced security weakness
and demands that could occur in an electronic passport, and suggests a direction for
security service based on safe key distribution and an authorization technique. In the
proposed research paper the proposed public key method to hash lock on reverse
functional difficulty of a one-direction hash function to detect and verify a damaged
electronic passport increases stability and creates resistance on capture. And to block
illegal information on an authentication server, the kill Tag method is executed. The
proposed method provides the high efficiency of a multi-leader management method
through a mutual authentication mechanism and a multi-leader management method
between the passport and the Reader. Therefore, the method can increase security by
protecting from reprinting, wiretapping and meson efficiently.
Chong et al (2008) proposed Anti-counterfeiting may be a international
disadvantage. The brands owners lay communicate advanced associate-counterfeiting
techniques to look for an honest technical answer.
Li et al (2008) presented an article that outlines achievable attacks by evaluating the
RFID system. The researchers analyzed some typical security mechanisms, and seen
the shortcomings and inequality contrasted to the EPC C1G2 standards.
Alomair et al (2012) Presented to procedure with constant-time complexness
resolved the matter of personal recognition of tags in inexpensive, Radio frequency
identification (RFID) scheme forward that associate degree person has complete
management over the communicating. A RFID reader making an attempt to spot and
demonstrate a tag inside it’s contrast generates and transmits a random proposed to
the RFID tag, that returns a primary hash of its current anonym and counter, and a
instant hash that's a operate of the key. The reader uses the same knowledge or data to
spot the RFID tag and its secret key by relation to info and returns unusual hash
values that shown the reader to the RFID tag. The foremost costly operation that
RFID tags square measure needed to perform could be a hash operate.
Molnar and Wagner (2004) exposed privacy harms associated Radio Frequency
Identification (RFID) in laboratory, clarified proposed deployments, as well as
advocated novel structural design for library RFID. The researchers provides a theme
for building private verification with occupation power inside the diversity of tags,
and protocols that accomplish personal authentication while not valuable crypto-logic
primitives; the researchers consider this theme are going to be of freelance interest on
the far side RFID applications.
Weis et al (2003) presented several technologies, low-priced Radio frequency
Identification systems can become enveloping in their everyday lives once affixed to
daily client effects as "smart labels". The researchers explained privacy as well as
defense threats and the technique they pertain to the characteristic setting of low-
priced RFID devices. The analyzers recommend many security mechanisms and
counsel areas for prospect investigate.
Paillard et al (2005) presented new distributed approach for generating all prime
numbers given limit From Eratosthenes who elaborated the first prime sieve more
than years ago the advances the parallel computers which have permitted reach large
limits obtain the previous results shorter time prime numbers generation still
represents attractive domain research Nowadays prime numbers play central role
cryptography and their interest has been increased the very recent proof that primarily
testing. In this work propose new distributed algorithm which generates all prime
numbers given finite interval based the wheel sieve far know this paper designs the
first fully distributed wheel sieve algorithm Distributed algorithms prime numbers
generation wheel sieve broadcast and leader election adding its own value itself which
are eliminated. The next number the first number that has not been eliminated the next
prime which will sieve again the same interval and until obtaining prime number can
another parallelization this algorithm that was implemented distributed way master
slave framework where each slave executes symmetrical manner the same code
interval data sieved and where these intervals are distributed the master process.
Zou et al (2011) presented obscurity is a crucial feature in several 2 party
communication systems. It’s a foremost which means is that either the message
sender or the receiver (or both) is insubstantial to substitute users, smooth among
themselves. Similarly, obscurity is a dangerous feature in multi-party calculate
environment, except, extremely little analysis is performed on this subject despite the
fact that several secure cluster communication schemes are projected.
In this research, the researchers emphasized the ideas of obscurity for secure cluster
communication and suggested to increase currently fictitious inventive cluster key
management machinery, admission manages Polynomial, to multiple-party cluster
26
statement. This recently widespread matter can't exclusively implement unspecified
cluster association and cluster size however conjointly applied secure and unspecified
cluster communication.
Alomair and Radha (2010) embed a frequency Identification (RFID) tag into
individual things permits the distinctive identification of such things over the wireless
medium, whereas not the necessity for a line-of-sight path. One altogether the
foremost challenges for the in development of the RFID technology is that the
economical, however personal, identification of cheap tags inside the presence
of adversaries attempting to illicitly track users via tags in their possession.
Associate RFID system consisted of two sensible components, namely, the interactive
protocol between RFID reader-tag pairs and so the reader-database data recovery
mechanism. Attributable to the massive kind of tags in associate extremely typical
RFID system, the private identification of tags is also a troublesome draw back.
Throughout this paper, the researchers investigate privacy-preserving RFID systems
and classify them supported the machine efficiency of tag identification. The
researchers incontestable the close relations between the degrees of privacy attain by
the reader-tag communication and so the reader-database data recovery quality.
Aaditeshwar and Beg (2006) proposed Radio Frequency Identification RFID system
is in advance attractiveness in a broad assortment of application like asset tracking,
personnel identification, and sensor networks. In this paper, the researcher’s first
described a basis-set of requirements that need to be necessarily satisfied to alleviate
security as well as privacy tribulations in RFID scheme. The researchers then outline
some recent proposals that try to solve these issues, and then explore in detail a
research publication by Molnar, et al that uses a pseudonym based tree walking
security scheme, and claims to meet all the requirements.
However, the researchers identify some attacks that are still possible in this scheme in
slightly different threat models, and then extend the scheme to mitigate these attacks.
The researchers also address the issue of secure establishment of session keys to
exchange information between tags, readers, and centralized trusted centers, which
had not been proposed earlier.
27
Shih et al (2005) employed omnipresent network property in society can demand an
in depth examination of private privacy from each the technical and social aspects.
The privacy issues raised by their indiscriminate nature are grave enough to demand a
comprehensive and effective method which will guarantee user privacy whereas
holding their advantages (Floerkemeier, and Lampe, 2004). A number of them enable
tag output to incorporate comparatively constant info. A number of them demand the
info within the rewritten tag memory by to avoid chase.
Additionally fail to convince the forward defense demand. While there have many
existing method, nobody presented a whole resolution. With innovative knowledge
advances permitting additional options to be incorporated into tags, the road between
RFID devices, good cards, and all-purpose computers can blur. Understanding RFID
security these days can aid in development of secure omnipresent calculating systems
in the prospect. Identifier intrinsic privacy or security intimidation of RFID systems
are going to be additionally useful for decision-making concerning the compulsion of
RFID makers and also the privacy rights of end consumers.
T Li et al stated that RFID (Radio Frequency Identification) technology can identify
an object and get its information conveniently and automatically via radio waves, but
it causes security and privacy problems for its exchange information without contact
and without notifying the tag owner. In response to this situation, scholars propose
many authentication protocols based on cryptographic techniques. Random numbers
play a very important role in those protocols, but the incorrect using of them leads the
protocols vulnerable to attacks.
Pateriya and Sangeetasharma (2011) cleared that RFID appears like an improved
candidate for numerous applications like, good appliances, shopping, medication
compliance, passports, libraries; toll- payment transponders etc. than the well
establish barcode system. However attributable to its value and resource constraint
limitations, it doesn't have a sufficient security and privacy support. Presently, several
scientist and individual work to implement light-weight low value security and
privacy protocol to extend the relevance.
So, during this paper the researchers review several of the fundamental and latest
work on this field. Here, the researchers considered that with as several solutions
28
there square measure as several issues additionally. But, there's additionally several
sensible solutions that support to develop a full-fledged protocol for RFID resource
forced surroundings. Numerous light-weight solutions are projected for RFID
however still they\'re expensive further as liable to the safety. So, there's a
requirement for radical light-weight resolution like during which uses straightforward
bit-wise operations like standard addition, exclusive OR.
Yong Ki Lee et al (2011) presented a paper that discusses that all the functional and
security related necessities for Radio frequency Identification techniques like system
scalability, inscrutability and anti-cloning are intricate to acquire because of
dominating constraint factors in functional area, memory storage, etc. Because of the
insufficiency of possessions majority of the projected protocols were intended or
proposed by implementing symmetric key cryptographic algorithms. Additionally,
common public-key cryptography based substantiation or endorsement protocols are
susceptible in terms of obscurity. Consequently, the researchers propose a new
endorsement protocol that is referred as EC-RAC using Elliptic Curve cryptography.
Feldhofer, Martin et al (2010) discussed the motivation for integrating strong
cryptographic algorithms into passive RFID tags is to prevent counterfeiting of goods,
providing privacy protection to the tag’s memory. Authentication allows achieving
the security goals by means of challenge-response protocols. What about the
implementation costs of the cryptographic primitives? An extensive evaluation of
several symmetric-key algorithms and public-key primitives has been done. In order
to provide a proof-of-concept, two prototypes of the Advanced Encryption Standard
(AES) are available in silicon
Tongliang Li et al stated that RFID (Radio Frequency Identification) technology can
identify an object and get its information conveniently and automatically via radio
waves, but it causes security and privacy problems for its exchange information
without contact and without notifying the tag owner. In response to this situation,
scholars propose many authentication protocols based on cryptographic techniques.
Random numbers play a very important role in those protocols, but the incorrect using
of them leads the protocols vulnerable to attacks. This paper takes focus on the
random numbers in related authentication protocols, then gives some rules about the
29
using of the random numbers, proposes an analysis method of using random numbers
in RFID schemes to achieving the security and privacy goal, and examples are given
at the end.
Yousuf, Y. et al provided a comprehensive survey of various RFID authentication
protocols proposed in the literature and classify them in different categories. The
researchers then study RFID authentication protocols having minimalist technique
namely EMAP, LMAP and M2MAP.
Yong Ki Lee et al stated that Radio Frequency Identification (RFID) structure are
steady changing into predominate attributable to their immense applications like
presented chains, inventory, tolling, baggage organization, access management etc.
However attributable to generality of RFIDs the problem should be taken into
consideration. During this paper the researchers recommend many authentication
protocols that area unit all completed from a similar construction blocks.
P. Peris-Lopez et.al presented RFID technology could be a present technology, and
looks destined to become additional an additional present. An earliest cryptanalytic
primitive does not seem to be supported on affordable RFID tags. Despite this, there
square measure a huge range of proposals supported the utilization of classical hash
functions. Moreover, none of the revealed verification protocols square measure proof
against active attacks. As a outcome of during this protocol tags ought to support a
hash-function on-board, a brand new light-weight hash perform, named Tav-128, is
additionally projected.
Jiang Zhi-wei et al analyzed the security of two different protocols based on the hash
function and find their drawbacks. Afterwards, the researchers propose a revised
OHLCAP and analyze its property. Meanwhile, it provides mutual authentication and
intractability and protects from impersonation and replay attack.
Ki Lee et al stated that Radio Frequency Identification (RFID) structure are steady
changing into predominate attributable to their immense applications like presented
30
chains, inventory, tolling, baggage organization, access management etc. However
attributable to generality of RFIDs the problem should be taken into consideration.
Yu-Jung Huang et al considered the RFID tag-reader common verification theme. A
hardware method of Associate during RFID authentication protocol traditionalist to
EPC category one invention two ordinary is projected.
Kavitha, S.M. et al proposed the projected system has been implemented exploitation
ISE machine and synthesized exploitation Xilinx synthesis technology.
Li Heng et al discussed Enhancement and promotion of RFID technology, making
RFID a growing range of application areas, for cost and technical considerations, the
current RFID system, the security of information transmitted under consideration, for
people to develop a variety of authentication protocol, for information security to a
certain extent improved. However, the current authentication protocols are still some
gaps, so the researchers are considering the introduction of the existing authentication
protocol chaotic algorithm, the plaintext information transmitted encrypted, thus
increasing the RFID system's information security.
He Lei et al proposed a one-way Hash based low-cost authentication protocol. It can
not only provide security properties the original has but also provide forward security
and prevents against de-synchronization attack.
Kejia Wu et al proposed a protocol suitable to mobile RFID systems. The proposed
protocol requires only hash, XOR and simple calculations but can provide good
security and privacy protection features. It is effectively secure against threats such as
impersonation, traceability and reply attack.
Firmino, M. et al This protocol is an extension of RFID systems for the protocol
proposed by Kinzel and Kanter, adding to the original protocol: a mutual
authentication and the definition of frames. Through simulations it was possible to
observe that the security level of the proposed protocol.
Batina, L. et al stated that Public-key cryptography (PKC) proposed a gorgeous
respond to the counterfeiting downside however whether or not a public key
31
cryptosystem are often enforced on associate degree RFID tag or not remains
indistinct.
Arbit, A. et al produced for a description on a sensible approach, and a operating
paradigm implementation, of a public-key anti-counterfeiting scheme supported the
Electronic Product Code (EPC) normal for offer chain RFID tags. Contrary to
previous claims of uselessness, the researchers have shown that EPC tag area unit
capable of playacting straight public-key secret writing.
Lopez et.al presented RFID technology could be a present technology, and looks
destined to become additional an additional present. An earliest cryptanalytic
primitive does not seem to be supported on affordable RFID tags. Despite this, there
square measure a huge range of proposals supported the utilization of classical hash
functions. Moreover, none of the revealed verification protocols square measure proof
against active attacks.
Yang Zhang et al presented Public-Key Cryptography (PKC) is essential to ensure
the authenticity and confidentiality of communication in open computer networks
such as the Internet. In the present paper, the researchers introduce a high-speed
implementation of arithmetic in Optimal Prime Fields (OPFs) for the ATmega128, an
8-bit processor used in a number of sensor nodes including the MICAz mote.
Karabat, C. et.al proposed a novel Radio Frequency Identification (RFID) system to
preserve privacy and enhance security by using the public key cryptography method.
In the proposed architecture, the access rights of the tags are controlled by a backend
server. These improve security of the system and remedy privacy problems. Here they
analyze the security of the proposed system and demonstrate its robustness against
impersonation, replay, cryptanalytic and tracking attacks. Furthermore, the
researchers show the performance of the proposed system under collusion which is
very common problem in many practical applications.
Junfeng Fan et al presented associate degree FPGA-based testing strategy for
cryptographical chips. Employing a block-based design, a testing bus and a shadow
FPGA, they're able to check info escape of every block.
Batina, L. et al in this research paper they recommend two possible solutions for
public-key cryptography and these two solutions are mainly based on arithmetic on
32
elliptic/hyper elliptic curves. First possible solution trusts on Elliptic Curve-
Cryptography, while the second approach relies on HECC on curves of genus 2 over
F2p.
Yong-Sik Choi et al presented a paper that designates the deduced security weakness
and demands that could occur in an electronic passport, and suggests a direction for
security service based on safe key distribution and an authorization technique. In the
proposed research paper the proposed public key method to hash lock on reverse
functional difficulty of a one-direction hash function to detect and verify a damaged
electronic passport increases stability and creates resistance on capture. And to block
illegal information on an authentication server, the kill Tag method is executed. The
proposed method provides the high efficiency of a multi-leader management method
through a mutual authentication mechanism and a multi-leader management method
between the passport and the Reader. Therefore, the method can increase security by
protecting from reprinting, wiretapping and meson efficiently.
Piao, Chunhui et al presented a paper that states that in RFID applications, there are
situations where RFID tags can be grouped and numbered continuously in a group.
Aiming at such applications, the group-based polling anti-collision algorithm for
RFID tag identification is proposed.
Bo Yan et al proposed a product life cycle monitoring information system based on
RFID and Internet of things. This system gives effective technical references for
enterprises to monitor whole life cycle of products with Internet of things.
Jeng, A.B. et al presented a paper that focuses on passive and active RFID collision
problems with authentication and counterfeit. The researchers propose a new protocol
called CRPA to make anti-collision protocol and authentication protocol working
together for passive RFID tags. Previously, the researchers have proposed a suitable
communication protocol with the function of anti-collision and anti-counterfeiting
called CRPAC for active RFID tags.
Kang-Joong Seo et al proposed a feasible security mechanism for anti-counterfeiting
and privacy protection was proposed using XOR and random number shifting
operations to enhance RFID tags security providing a low cost. However, their
authentication protocol has some drawbacks and security problems because they did
33
not consider the surrounding environments. The researchers conduct analysis on the
protocol and identify problematic areas for improvement of the research. The
researchers also provide an enhanced authentication scheme based on the comment.
Razaq, A. et al presented a paper that investigates the ISO 18000-6 Type C and Gen2
standards and they point out the security drawbacks and limitations of the existing air
interface that should be addressed for widespread of this ubiquitous technology.
Ren Zheng et al proposed in order to solve the application problems of EPC
Network, the anti-counterfeiting system with anti-counterfeiting model and rules are
used in this paper. By research on the supply chains in the logistics field, the
researchers set up models to represent the real supply chain and the researchers also
work out some rules based on the model to achieve the anti-counterfeiting function. A
basic model is shown as an example to represent one supply chain model of a product.
Yongqing Fu et al proposed an article that creates analysis on one in all the attack
strategies Denial of Service (DoS). The researchers totally expound and examined the
lively electronic jamming to the RFID system that, declared as Active electronic
jamming Attack later, may be a kind of DoS. Through theoretical derivation and
simulation, the foremost effective active electronic jamming approach is reviewed,
that is additionally incontestable by providing experimental consequence. This effort
might offer a reference for RFID trendy to forestall or weaken this sort of DoS molest
to the best extent.
Xuemei Li et al proposed to support reliable and personal privacy controllable
service, the proposed security architecture has user gateway and privacy management
server. It is shown that the proposed architecture mitigates many threats relating to
RFID user.
Basel Alomair et.al Presented to procedure with constant-time complexness resolved
the matter of personal recognition of tags in inexpensive, Radio frequency
identification (RFID) scheme forward that associate degree person has complete
management over the communicating. A RFID reader making an attempt to spot and
demonstrate a tag inside it’s contrast generates and transmits a random proposed to
34
the RFID tag, that returns a primary hash of its current anonym and counter, and a
instant hash that's a operate of the key.
The reader uses the same knowledge or data to spot the RFID tag and its secret key by
relation to info and returns unusual hash values that shown the reader to the RFID tag.
The foremost costly operation that RFID tags square measure needed to perform
could be a hash operate.
H. Lee and J. Kim Radio frequency identification (RFID) technology that is used to
identify objects and users and automatically takes advantage of contextual
information such as user's location is expected to become an important and a core
technology of ubiquitous infrastructure.
S. Weis et al in this research the researchers described a quick description of RFID
systems and their operation. The analyzers recommend many security mechanisms
and counsel areas for prospect investigate.
Juels A. presented radio-frequency identification (RFID) tag may be a tiny, cheap
semiconductor unit that emits Associate in symbol in response to a question from a
close-by reader. The researchers recommended a brand new security model for
authentication and privacy in RFID tags. The researchers explained a protocol that
obviously achieved the properties of verification and privacy in RFID tags in their
planned model, and during a sensible sense. It involved no computationally intensive
crypto logical operations, and comparatively very little storage.
Gabriel Paillard presented new distributed approach for generating all prime
numbers given limit From Eratosthenes who elaborated the first prime sieve more
than years ago the advances the parallel computers which have permitted reach large
limits obtain the previous results shorter time prime numbers generation still
represents attractive domain research Nowadays prime numbers play central role
cryptography and their interest has been increased the very recent proof that primarily
testing.
In this work propose new distributed algorithm which generates all prime numbers
given finite interval based the wheel sieve far know this paper designs the first fully
distributed wheel sieve algorithm Distributed algorithms prime numbers generation
35
wheel sieve broadcast and leader election adding its own value itself which are
eliminated.
The next number the first number that has not been eliminated the next prime which
will sieve again the same interval and until obtaining prime number can another
parallelization this algorithm that was implemented distributed way master slave
framework where each slave executes symmetrical manner the same code interval
data sieved and where these intervals are distributed the master process.
Bezawada Bruhadeshwar and Sandeep S. Kulkarni The researchers proposed a
family of algorithms that presented a trade-off between the number of keys preserved
by users and the time needed for rekeying due to revocation of multiple users. The
researchers show that some well-known algorithms in the literature are members of
this family.
G. H. Chiou and W. Chen have proposed the locking concept and a secure lock
implemented based on the Chinese Remainder Theorem. By using this secure lock,
the researchers have proposed secure broadcasting protocols for solving the secure
broadcasting problem, It is clear that these are distributed protocols since each user
can compute the lock by himself. In the last section, the researchers have shown that
the security of the cipher which is used in their protocols is not downgraded. So, their
proposed protocols are secure. The first point of merit in their proposed protocols is
their efficiency because only one copy of the cipher text is broadcasted. Second, in
their proposed protocols, the secret key is equal to the number of secret keys which
are needed in the one-to-one applications.
Actually, the same secret keys are used. Thus, the number of secret keys which are
used in their protocol is minimized. The third merit is that the sent-out message need
not contain the names of the receivers. Furthermore, in the public key based protocol,
the sender’s ID (SID) is also enciphered. Since the receiver’s addresses are inherent in
the ciphenext of X, the security level of the sent out message is not disclosed and the
attack using traffic analysis is also infeasible.
Finally, the Chinese Remainder Theorem is used to implement the secure lock. In
most typical applications, the number of users in a group is small, therefore the secure
lock implemented by the Chinese Remainder Theorem is suitable. In case that there
36
are a large number of users in a group, the researchers can partition the users into a
number of subgroups with suitable size.
Choi et al presented a paper that designates the deduced security weakness and
demands that could occur in an electronic passport, and suggests a direction for
security service based on safe key distribution and an authorization technique. In the
proposed research paper the proposed public key method to hash lock on reverse
functional difficulty of a one-direction hash function to detect and verify a damaged
electronic passport increases stability and creates resistance on capture. And to block
illegal information on an authentication server, the kill Tag method is executed. The
proposed method provides the high efficiency of a multi-leader management method
through a mutual authentication mechanism and a multi-leader management method
between the passport and the Reader. Therefore, the method can increase security by
protecting from reprinting, wiretapping and meson efficiently.
Xukai Zou et.al presented obscurity is a crucial feature in several 2 party
communication systems. It’s a foremost which means is that either the message
sender or the receiver (or both) is intangible to alternative users, even among
themselves. Several mechanisms are projected to cover the characteristics of the
sender, receiver, or both. Likewise, obscurity is a critical feature in multi-party
computing environments, but, very little analysis is performed on this subject despite
the fact that several secure cluster communication schemes are projected.
In this research, the researchers emphasized the ideas of obscurity for secure cluster
communication and suggested to increase a currently fictitious inventive cluster key
management mechanism, Access control Polynomial, to multiple-party cluster
communication. This recently extensive theme can't solely enforce unspecified cluster
association and cluster size however conjointly applied secure and unspecified cluster
communication.
Aaditeshwar Seth and Mirza Beg: in this paper, the researcher’s first described a
basis-set of requirements that need to be necessarily satisfied to mitigate security and
privacy problems in RFID systems. The researchers then outline some recent
proposals that try to solve these issues, and then explore in detail a research
publication by Molnar, et al [1] that uses a pseudonym based tree walking security
scheme, and claims to meet all the requirements.
37
However, the researchers identify some attacks that are still possible in this scheme in
slightly different threat models, and then extend the scheme to mitigate these attacks.
The researchers also address the issue of secure establishment of session keys to
exchange information between tags, readers, and centralized trusted centers, which
had not been proposed earlier. Their extensions make the overall scheme complete
that meets all the requirements.
Dong-Her Shih et.al employed omnipresent network property in society can demand
an in depth examination of private privacy from each the technical and social aspects.
The privacy issues raised by their indiscriminate nature are grave enough to demand a
comprehensive and effective method which will guarantee user privacy whereas
holding their advantages (Floerkemeier, and Lampe, 2004).
A number of them enable tag output to incorporate comparatively constant info. A
number of them demand the info within the rewritten tag memory by to avoid chase.
Additionally fail to convince the forward defense demand. While there have many
existing method, nobody presented a whole resolution. With innovative knowledge
advances permitting additional options to be incorporated into tags, the road between
RFID devices, good cards, and all-purpose computers can blur.
Understanding RFID security these days can aid in development of secure
omnipresent calculating systems in the prospect. Identifier intrinsic privacy or
security intimidation of RFID systems are going to be additionally useful for decision-
making concerning the compulsion of RFID makers and also the privacy rights of end
consumers.
Basel et.al Presented to procedure with constant-time complexness resolved the
matter of personal recognition of tags in inexpensive, Radio frequency identification
(RFID) scheme forward that associate degree person has complete management over
the communicating. A RFID reader making an attempt to spot and demonstrate a tag
inside it’s contrast generates and transmits a random proposed to the RFID tag,
that returns a primary hash of its current anonym and counter, and a instant hash that's
a operate of the key. The reader uses the same knowledge or data to spot the RFID tag
and its secret key by relation to info and returns unusual hash values that shown the
38
reader to the RFID tag. The foremost costly operation that RFID tags square measure
needed to perform could be a hash operate.
Molnar et.al exposed privacy harms associated Radio frequency Identification
(RFID) in laboratory, clarified proposed deployments, as well as advocated novel
structural design for library RFID. The researchers provides a theme for building
private verification with occupation power inside the diversity of tags, and protocols
that accomplish personal authentication while not valuable cryptologic primitives; the
researchers consider this theme are going to be of freelance interest on the far side
RFID applications.
Paillard et.al presented new distributed approach for generating all prime numbers
given limit From Eratosthenes who elaborated the first prime sieve more than years
ago the advances the parallel computers which have permitted reach large limits
obtain the previous results shorter time prime numbers generation still represents
attractive domain research Nowadays prime numbers play central role cryptography
and their interest has been increased the very recent proof that primality testing In this
work propose new distributed algorithm which generates all prime numbers given
finite interval based the wheel sieve far know this paper designs the first fully
distributed wheel sieve algorithm Distributed algorithms prime numbers generation
wheel sieve broadcast and leader election adding its own value itself which are
eliminated The next number the first number that has not been eliminated the next
prime which will sieve again the same interval and until obtaining prime number can
another parallelization this algorithm that was implemented.
Zou et.al presented obscurity is a crucial feature in several 2 party communication
systems. In this research, the researchers emphasized the ideas of obscurity for secure
cluster communication and suggested to increase currently fictitious inventive cluster
key management machinery, admission manages Polynomial, to multiple-party cluster
statement. This recently widespread matter can't exclusively implement unspecified
cluster association and cluster size however conjointly applied secure and unspecified
cluster communication.
39
S. Lindsey, C et.al presented device webs consisting of nodes with restricted battery
energy and wireless communications area unit deployed to gather helpful info from
the sector. Gathering detected info in associate in energy economical manner is
essential to operative the device network for an extended amount of your time. Data
Information assortment downside is outlined wherever, in a very spherical of
communication, every device node incorporates a packet to be send to the isolated
stand station. There is a few mounted quantity of energy value within the physical
science once transmittal or receiving a packet and a variable value once transmittal a
packet that depends on the gap of transmission. If every node transmits its detected
information on to the bottom station, then it will use up its power rapidly.
X. Co, et.al continued advance of wireless communication technologies have not able
to the readying of huge scale wireless device networks. The sensors limited energy
makes energy expenditure a vital issue. In particular hop wireless sensor networks,
cluster heads election methodology supported residual energy will acquire higher
energy potency than the strategy within which cluster heads area unit electoral in
turns or by possibilities.
Rodoplu and T. H. Meng described a dispersed situation based network protocol
optimized for least amount energy utilization in mobile wireless networks that hold up
peer-to-peer communication. Curtained several variety of indiscriminately deployed
nodes over a vicinity, the researchers demonstrated that an easy native improvement
theme dead at every node guarantees sturdy property of the complete network and
attains the world minimum power resolution for motionless networks. Appropriate to
its restricted nature, these procedures prove to be self-reconfiguring and continue near
the minimum energy resolution once used to mobile networks.
Balakrishnan et.al considered linear systems along with any old parameters that lie
between given higher and lounge bounds. Apart from many special cases, the
computation of the several amount of interest for such systems will be present merely
during Associate in complete search in parameter space. The researchers specified a
general branch and convinced algorithmic rule that implements this explore in an
exceedingly methodical manner and concern it to computing the minimum constancy
degree.
40
Xing-Wei et.al introducing the knowledge of the fuzzy mathematics, probability
theory and gaming theory, a QoS(Quality of Service)multicast routing scheme with
ABC(Always Best Connected)supported is proposed. It uses the interval to describe
the user QoS requirement and the edge (link) parameter with the edge parameter
probability and the user satisfaction degree introduced. With the help of the edge
evaluation and the gaming analysis, it tries to find a QoS multicast tree with the
Pareto optimum under the Nash equilibrium on both the network provider utility and
the user utility achieved or approached based on the particle swarm optimization
algorithm. Simulation results have shown that it is both feasible and effective.
Deng Qiang and Xie Dong-liang proposed a holistic QoS model to evaluate the
performance of WSN. QoS requirements within a WSN reference architecture is
presented, and then a two-way mapping between application layer parameters and
network layer parameters is carefully analyzed using fuzzy logic. Finally, the
researchers proposed a fuzzy logic based comprehensive evaluation model for
systematic QoS in WSN, and use a case study to illustrate its effectiveness.
Ian F. Akyildiz et.al severed energy constraints of powered device nodes necessitate
energy-efficient communication protocols so as to satisfy application objectives of
wireless device networks (WSN). Though, the overwhelming preponderance of the
present solutions area unit supported classical bedded protocols approach. It is a
method more resource efficient to own a combined theme that melts ordinary protocol
layer functionalities keen on a cross-layer constituent for resource controlled device
nodes.
Min Shao et.al proposed for sensing element networks deployed to watch and report
real events, event supply namelessness is a beautiful and significant security property,
which sadly is additionally terribly tough and dearly-won to realize. This is often not
solely as a result of adversaries could attack against sensing element supply privacy
through traffic analysis, however conjointly as a result of sensing element networks
square measure terribly restricted in resources. As such, a sensible trade-off between
security and performance is fascinating.
41
During this paper, for the primary time authors propose the notion of statistically
strong source anonymity, underneath a difficult attack model wherever a world
assaulter is in a position to watch the traffic within the entire network. Authors
propose a theme known as FitProbRate, which realizes statistically robust supply
namelessness for sensing element networks. They conjointly demonstrate the
hardiness of our theme underneath numerous applied mathematics tests that may be
used by the assaulter to sight real events. During this paper analysis and simulation
results shown that planned theme, besides providing supply namelessness, will
considerably scale back real event coverage latency compared to 2 baseline schemes.
Raghavendra V. Kulkarni et.al discussed to the non-beacon nodes estimation their
locality exploitation using distance measurements from 3 or a lot of non-collinear
beacon they will be receive indication from. The range based localization work was
developed as a dimensional optimization difficulty, and addressed exploitation bio-
inspired algorithms, utilizing their fast convergence to superiority explanation.
Location data of the haphazardly deployed nodes is that the demand in several
applications of wireless sensor networks. To organize little special beacon nodes have
locality consciousness, which facilitate the standard nodes to localize may be a
general answer to the localization trouble.
Here, the nodes that acquire localize in iteration act as orientation for remaining nodes
to localize. Utilizing particle swarm optimization as well as bacterial foraging
algorithm the disadvantage has been self addressed. Comparison of the performances
of PSO and BFA in terms of the quantity of nodes localized, localization accuracy and
calculation time has been proposed. The static shortest path (SP) problem is well
addressed in the recent years with the use of intelligent optimization system for e.g.
genetic algorithm (GAs), artificial neural networks and particle swarm optimization
etc. has been presented by Shengxiang Yang et.al
Mutazono et.al The use of Gas with memory scheme and immigrants to sort out the
dynamic SP routing problem in MANETs has been proposed by the authors.
MANETs are considered to be the target system for the authors since it is the new
generation wireless network. These memory based and immigrants GAs adapts the
environmental change i.e. change in network topology quickly and produces a high
42
quality solution after every change and is shown in the experimental results. One of
the most difficult tasks in the area of WSNs is to control the power consumption of
the batteries and the higher network lifetime.
For the sensor networks which contain large number of sensor nodes, centralized
control is not suitable hence we use self-organized method. Research work on bio
inspired self-organization methods seeks attention because it has the potential to be
applicable in the WSNs. A focus on calling behavior of Japanese tree frogs has been
considered by the authors. This behavior can be used in designing an energy efficient
sleep control method which gives adaptive operation periods. A self-organizing
scheduling method has been presented by authors who are inspired by the frogs
calling behavior for data transfer in WSNs which is energy efficient.
Tanveer A Zia and Md Zahidul Islam to minimize the overhead, this proposed
algorithm which contains new algorithm for mobile ad hoc network by the
combination of Ant Colony approach and Zone based routing approach which uses
cluster to get shortest path which sends the small number of control messages. It is
shown in the simulation that the Zone based ant colony routing algorithm has short
route establishment overhead when compared to other zone based ant colony
algorithms in mobile scenario. The use of WSNs in sensitive application which
includes defense, healthcare, early bushfire detection, habitat monitoring etc, needs a
careful consideration.
Federico S. et.al author uses a scheme for the up wash caused by a flying bird and
shows that a group of birds can self organizes into a V formation if each and every
bird has to process spatial and network knowledge through an adaptive diffusion
process. Birds are required to achieve measurement of the up wash and also have to
use the information from the neighboring birds in the proposed diffusion algorithm.
The results obtained have several interesting applications such as, first a simple
diffusion algorithm that can reckon for self-organization in the birds, this algorithm
runs in real time and fully distributed, second, is that the birds can self-organized
based on the up wash which is generated by the neighboring birds, third is to achieve
flight formation information sharing is necessary by the birds. A modification in the
algorithm is also proposed which shows that the bird can also get organized into a U
43
formation after starting from V formation. According to the authors this new
formation is more effective as it leads to equalization effect i.e. every bird in the
group observes same wash up.
Veeramachaneni and L. A. Osadciw honey and ants in the real world to achieve the
above target. This proposed method is based upon the use of data migration technique
and relies heavily on migratory transportation unit known as Ant Agents to search the
vacant storage resources within the network. It is shown by the simulation result that
the cooperative data gathering is beneficial for storage controlled nodes in WSNs. For
sensor management of the multi sensor networks a Swarm Intelligence based
approach.
R. Hassan et.al on how foraging should proceed the researchers explained the control
system on E. coli and discuss the range of bacterial swarming and social foraging that
dictates it. Authors next presented a computer program which imitates the distributed
optimization process which is represented by the activity of social foraging. The
researchers use it to a multiple function minimization problem and discuss its
relationship with existing optimization algorithm in brief to illustrate its operation.
The researchers closes the article with a discussion in brief about the use of bio
mimicry of social foraging in the development of adaptive controllers and cooperative
control plans for autonomous vehicles and for this they provide some fundamental
ideas.
A. Gopakumar and L. Jacob proposed a novel and computationally efficient global
optimization method based on swarm intelligence for locating nodes in a WSN
environment. The mean square varies error of all neighboring anchor nodes is taken
because the objective perform for this nonlinear optimization drawback.
Shih et.al employed omnipresent network property in society can demand an in depth
examination of private privacy from each the technical and social aspects. The
privacy issues raised by their indiscriminate nature are grave enough to demand a
comprehensive and effective method which will guarantee user privacy whereas
holding their advantages (Floerkemeier, and Lampe, 2004). A number of them enable
44
tag output to incorporate comparatively constant info. A number of them demand the info
within the rewritten tag memory by to avoid chase. Additionally fail to convince the
forward defense demand. While there have many existing method, nobody presented a
whole resolution.