Filters








11 Hits in 5.8 sec

Yet Another Ultralightweight Authentication Protocol That Is Broken [chapter]

Gildas Avoine, Xavier Carpent
2013 Lecture Notes in Computer Science  
Eghdamian and Samsudin published at ICIEIS 2011 an ultralightweight mutual authentication protocol that requires few bitwise operations.  ...  The simplicity of the design makes the protocol very suitable to low-cost RFID tags.  ...  This attack is an additional example of the lack of security of ultralightweight protocols, and it questions about the relevance of this approach to design authentication protocols.  ... 
doi:10.1007/978-3-642-36140-1_2 fatcat:txze26bxqnaola7muyay2puwsu

An ultralightweight RFID authentication protocol with CRC and permutation

Lijun Gao, Maode Ma, Yantai Shu, Yuhua Wei
2014 Journal of Network and Computer Applications  
Recently, an ultralightweight RFID authentication protocol with permutation has been proposed to provide security and prevent all possible attacks.  ...  However, the major barrier that the RFID system is facing presently is the security and privacy issue.  ...  Analysis shows that simple, lightweight and ultralightweight RFID authentication protocols are more effective and efficient.  ... 
doi:10.1016/j.jnca.2013.10.014 fatcat:fymwyizvajeq7blqaoyuxjjfoy

Ultra-lightweight Authentication [chapter]

Xavier Carpent, Paolo D'Arco, Roberto De Prisco
2021 Security of Ubiquitous Computing Systems  
After that, we survey the weaknesses and the common pitfalls in both the design and the analysis of ultra-lightweight authentication protocols.  ...  AbstractIn this chapter we provide a critical look at the state of the art in ultra-lightweight authentication protocols.  ...  Another popular but flawed way of proving security of proposed ultralightweight protocols is the use of logic modeling and formal protocol verification software. A notable example is [492] .  ... 
doi:10.1007/978-3-030-10591-4_6 fatcat:2dqwgrwef5ellgfzwchwhnbuyi

Non-standard Attacks against Cryptographic Protocols, with an Example over a Simplified Mutual Authentication Protocol [chapter]

Julio C. Hernandez-Castro, Juan M. E. Tapiador, Arturo Ribagorda
2008 Communications in Computer and Information Science  
We show how an attack based on Simulated Annealing can efficiently recover the tag's secret ID, which is the value the protocol is designed to conceal.  ...  We illustrate our approach with a straightforward application in the form of an attack against a slightly simplified version of an ultra-lightweight authentication protocol for RFID environments called  ...  As all the previous attempts to design ultralightweight protocols have failed (essentially all proposals have been broken), this new scheme was specially interesting.  ... 
doi:10.1007/978-3-540-87477-5_62 fatcat:pz7gk5ghbff2dew3pec4urnxs4

Questioning the security of three recent authentication and key agreement protocols

Amir Masoud Rahmani, Mokhtar Mohammadi, Shima Rashidi, Jan Lansky, Stanislava Mildeova, Masoumeh Safkhani, Saru Kumari, Mehdi Hosseinzadeh
2021 IEEE Access  
The proposed protocol is based on bilinear pairings as the main source of the security. Another protocol is the Yu et al.'  ...  The authentication mechanism is the first step that allows the protocol parties to trust each other.  ...  Her current research interests include the security analysis of lightweight and ultralightweight protocols, targeting constrained environments, such as RFID, the IoT, VANET, and WSN.  ... 
doi:10.1109/access.2021.3094875 fatcat:2sh7ollsmzb2da4ieojpy4gwwi

An Enhanced Authentication Protocol for RFID Systems

Mehdi Hosseinzadeh, Omed Hassan Ahmed, Sarkar Hasan Ahmed, Cuong Trinh, Nasour Bagheri, Saru Kumari, Jan Lansky, Bao Huynh
2020 IEEE Access  
In this paper, we analyse the security of two mutual authentication protocols that have been recently proposed by Gao et al.  ...  The proposed attacks are almost deterministic and the complexity of each attack is a session for the hash-based and three sessions for Rabin public key based protocol.  ...  Although it is common in the literature to break an ultralightweight mutual authentication protocol with just a few queries and with a high probability, however, the analysed protocols in this paper are  ... 
doi:10.1109/access.2020.3008230 fatcat:775t6wzeu5gknoa767bseoakeq

Security Protocols in a Nutshell [article]

Mohsen Toorani
2016 arXiv   pre-print
protocols, is provided.  ...  Furthermore, a survey on computational security models for authenticated key exchange (AKE) and password-authenticated key exchange (PAKE) protocols, as the most important and well-studied type of security  ...  Protocols that postpone authentications to the end of the protocol are much more vulnerable to the DoS attack than protocols that take care of authentication at earlier stages.  ... 
arXiv:1605.09771v2 fatcat:mkbc3in6tvdo7madnvqaxogbfq

Mersenne twister-based RFID authentication protocol

Mehmet Hilal ÖZCANHAN, Gökhan DALKILIÇ
2015 Turkish Journal of Electrical Engineering and Computer Sciences  
This work presents an ultra-lightweight, cryptographic, mutual authentication protocol for radio-frequency identification (RFID) tags. The proposed scheme is more secure than its predecessors.  ...  Next, we present a proposal that resists all of the known passive attacks. The proposal obeys the properties and rules of addition-rotation-XOR with constants systems.  ...  It is not logical make comparisons against fully broken protocols or non-ARX systems. Gossamer is the only protocol that qualifies to be in the ARX-c category.  ... 
doi:10.3906/elk-1212-95 fatcat:dsioh6hpuzcs5g3lx6rnga4dy4

Formal Computational Unlinkability Proofs of RFID Protocols [article]

Hubert Comon, Adrien Koutsos
2017 arXiv   pre-print
We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model.  ...  properties of hash functions (Collision-Resistance, PRF); ii) To formalize computational unlinkability in the model; iii) To illustrate the method, providing the first formal proofs of unlinkability of RFID protocols  ...  Similarly, as reported in [18] , other RFID protocols that were claimed secure turned out to be broken.  ... 
arXiv:1705.02296v1 fatcat:wjvqkczh7jg53bci73yrmvn4v4

An Evolutionary Game-Based Mechanism for Routing P2P Network Flow among Selfish Peers

Fang Zuo, Wei Zhang
2014 Journal of Networks  
The network complexity is required experts' operators.  ...  The DAIM model is expected to satisfy the requirement of autonomic functionalities.  ...  Such as HY Chien proposed an ultralightweight RFID authentication protocol [6] , however, there are two de-synchronization attacks to break the protocol, as pointed out by Sun et al. [7] . H. Y.  ... 
doi:10.4304/jnw.9.01.10-17 fatcat:tbmafdamk5am7a6ba26gsxzydq

Aalborg Universitet Lightweight Cryptography for Passive RFID Tags Lightweight Cryptography for Passive RFID Tags

David, Mathieu David, Moderator Assoc, Kiel Jensen, Mathieu David, Niels Vej, Aalborg Denmark
2011 unpublished
Our main concern is the integrability of these selected primitives into real passive 5 6 RFID tags.  ...  We select two of these branches, ultralightweight cryptography and symmetric-key cryptography, and propose a cryptographic primitive in each of them.  ...  Experience has proven that trying to fix a broken cipher will ultimately result in a new cipher that can still be easily broken (e.g. TEA [169] ).  ... 
fatcat:lrxrgztwvvc7fkwl5efhykdl5a