نتایج جستجو برای: epc c1 g2 standard

تعداد نتایج: 558311  

Journal: :IACR Cryptology ePrint Archive 2015
Behzad Abdolmaleki Hamidreza Bakhshi Karim Baghery Mohammad Reza Aref

In the past few years, the design of RFID authentication protocols in accordance with the EPC Class-1 Generation-2 (EPC C1 G2) standards, has been one of the most important challenges in the information security domain. Although RFID systems provide user-friendly services for end-users, they can make security and privacy concerns for them. In this paper we analyze the security of an RFID mutual...

Journal: :IACR Cryptology ePrint Archive 2015
Seyed Salman Sajjadi GhaemMaghami Afrooz Haghbin Mahtab Mirmohseni

Radio Frequency Identification (RFID) applications have spread all over the world and, in order to provide their security and privacy, researchers proposed different kind of protocols. In this paper, we analyzes the privacy of a new protocol, proposed by YuJehn in 2015 which is based on Electronic Product Code Class1 Generation 2 (EPC C1 G2) standard. By applying the Ouafi-Phan privacy model, w...

Journal: :IACR Cryptology ePrint Archive 2011
Masoumeh Safkhani Nasour Bagheri Majid Naderi

In this paper, we analyze the security of AZUMI protocol which is compliant with the EPCClass-1 Generation-2 standard and recently has been proposed by Peris et al. This protocol is an improvement to a protocol proposed by Chen and Deng which has been cryptanalysed by Peris et al. and Kapoor and Piramuthu. However, our security analysis clearly shows that the designers were not successful in th...

2015
Masoumeh Safkhani Mehdi Hosseinzadeh Mojtaba Eslamnezhad Namin Samad Rostampour Nasour Bagheri

Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication protocols, called RAPLT and SRP, and proved that these protocols are vulnerable against de-synchronization and secret disclosure attacks. The time complexity of their attacks were O(2). In addition, they proposed an improved version of SRP entitled SRP, for which they claim the security would be O(2). Howe...

Journal: :IACR Cryptology ePrint Archive 2015
Masoumeh Safkhani Nasour Bagheri Mehdi Hosseinzadeh Mojtaba Eslamnezhad Namin Samad Rostampour

Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication protocols, called RAPLT and SRP, and proved that these protocols are vulnerable against de-synchronization and secret disclosure attacks. The time complexity of their attacks were O(2). In addition, they proposed an improved version of SRP entitled SRP, for which they claim the security would be O(2). Howe...

2014
Seyed Mohammad Alavi Karim Baghery Behzad Abdolmaleki

Recently, due to widespread use of Radio Frequency IDentification (RFID) systems in personal applications, security and privacy of these systems have got more attention. In order to provide security and privacy of RFID users, different authentication protocols have been proposed. In 2014, Mohammadi et al. proposed an improved authentication protocol for RFID systems. They claimed that their pro...

2013
Kalikinkar Mandal Guang Gong

Pseudorandom number generators play an important role to provide security and privacy on radio frequency identification (RFID) tags. In particular, the EPC Class 1 Generation 2 (EPC C1 Gen2) standard uses a pseudorandom number generator in the tag identification protocol. In this paper, we first present a pseudorandom number generator, named the filtering nonlinear feedback shift register using...

Journal: :IACR Cryptology ePrint Archive 2013
Nasour Bagheri Masoumeh Safkhani

Peris-Lopez et al. recently provides some guidelines that should be followed to design a secure yoking-proof protocol [10]. In addition, conforming to those guidelines and EPC C1 G2, they presented a yoking-proof for low-cost RFID tags, named Kazahaya. However, in this letter, we scrutinize its security showing how an passive adversary can retrieve secret parameters of patient’s tag in cost of ...

Journal: :The art of discrete and applied mathematics 2023

A vertex colouring f: V(G) → C of a graph G is complete if for any c1, c2 ∈ with c1 ≠ there are in adjacent vertices v1, v2 such that f(v1) = and f(v2) c2. The achromatic number the maximum achr(G) colours proper G. Let G1▫G2 denote Cartesian product graphs G1 G2. In paper achr(Kr2 + r 1▫Kq) determined an infinite q’s provided finite projective plane order.

Journal: :IACR Cryptology ePrint Archive 2016
Karim Baghery Behzad Abdolmaleki M. J. Emadi

The term "Internet of Things (IoT)" expresses a huge network of smart and connected objects which can interact with other devices without our interposition. Radio frequency identification (RFID) is a great technology and an interesting candidate to provide communications for IoT networks, but numerous security and privacy issues need to be considered. In this paper, we analyze the security and ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید