[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Site Facilities::
Indexing::
Contact us::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Print ISSN
Print ISSN: 2476-3047
..
:: Search published articles ::
Showing 3 results for Rfid

, ,
Volume 3, Issue 1 (9-2014)
Abstract

A set of technologies, that use radio waves for identifying people or objects, is called radio frequency identification system or RFID. RFID performance depends on tag and reader devices which use radio waves to communicate to each other. In some applications of RFID systems, the proof of concurrent presence for a number of objects or persons together in a given time is crucial. Grouping proof protocols are designed to address these needs, in fact grouping proof shows that two or more tags are evaluated by a reader simultaneously. This proof must be verified by the corresponding verifier. In this article this type of protocols are introduced and analyzed. At the first, the idea of designing a grouping proof is presented and then related protocols and their security analysis are presented. Finally, a comparison between protocols is provided.
Doctor Nasoor Bagheri, Mr Reza Aghamohammadi,
Volume 3, Issue 2 (3-2015)
Abstract


Ghodsieh Karimi , Morteza Adeli, Mohammad Ali Hadavi,
Volume 13, Issue 2 (12-2024)
Abstract

With the increasing use of RFID tags, there is a need for specific protocols to communicate with these tags. Among these protocols, the ownership transfer stands out as it ensures the security and privacy of objects for the new owner after a change of ownership. Recently, a lightweight object ownership transfer protocol has been proposed for RFID networks. This protocol utilizes a lightweight linear function for security. The designers of the protocol claim that it is secure against known attacks while also being lightweight. In this paper, we identify vulnerabilities in the function used in this protocol and demonstrate that it is susceptible to the secret disclosure attack. We show that with at most 4 × L executions of the protocol (where L is the key length), one can obtain the necessary information from intercepted data to execute the attack and subsequently recover the shared keys used in the protocol.


Page 1 from 1     

دوفصل نامه علمی  منادی امنیت فضای تولید و تبادل اطلاعات( افتا) Biannual Journal Monadi for Cyberspace Security (AFTA)
Persian site map - English site map - Created in 0.06 seconds with 29 queries by YEKTAWEB 4710