Untraceability of RFID Protocols

Deursen, Ton van; Mauw, Sjouke; Radomirović, Saša

doi:10.1007/978-3-540-79966-5_1

Cited by 44 publications

(43 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this kind of networks, we have provided a solution for detecting a particular trust relation between two nodes in an anonymous and unobservable way. We believe that these two properties will be of first importance in a near future in the design of security protocols, for instance in the RFID research field [16,10]. In future work, we plan to address some complexity issues of our solutions: decreasing the complexity of trust detection algorithm, reduce the use of asymmetric cryptography and add appropriate cryptographic puzzles for mitigating the exhaustion of computation resources.…”

Section: Resultsmentioning

confidence: 99%

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks

Heen

Guette²,

Genet

2009

Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks

View full text Add to dashboard Cite

Abstract. More and more mobile devices feature wireless communication capabilities. They can self-organize in a mobile ad hoc network in order to communicate and maintain connectivity without any infrastructure component.In this context, some devices may benefit from established trust relations in order to communicate private data. Various solutions already exist for establishing and detecting such trust relations. But is it still possible to detect a trust relation in an unobservable manner? That is, in a way that an attacker cannot understand whether devices share a trust relation or not.We exhibit a solution to this problem. Our solution guaranties the anonymity and the unobservability of participants against passive and active attackers. The security properties of the solution are machine checked with the AVISPA framework [2] and the SPAN tool [5].The main applications could be found in mobile ad hoc networks and in vehicular networks [6,7] where anonymity and unobservability contribute to a better privacy.

show abstract

Section: Resultsmentioning

confidence: 99%

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks

Heen

Guette²,

Genet

2009

Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks

View full text Add to dashboard Cite

show abstract

“…So far, attempts at formalising privacy have usually been domain-specific (e.g., [22,2,10,3,4,23,11,12,24]). We advocate a domain-independent approach to privacy, and develop a formal framework to achieve this in Sect.…”

Section: Privacy Notionsmentioning

confidence: 99%

Enforcing Privacy in the Presence of Others: Notions, Formalisations and Relations

Dong

Jonker

Pang

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Protecting privacy against bribery/coercion is a necessary requirement in electronic services, like e-voting, e-auction and e-health. Domain-specific privacy properties have been proposed to capture this. We generalise these properties as enforced privacy: a system enforces a user's privacy even when the user collaborates with the adversary. In addition, we account for the influence of third parties on a user's privacy. Third parties can help to break privacy by collaborating with the adversary, or can help to protect privacy by cooperating with the target user. We propose independency of privacy to capture the negative privacy impact that third parties can have, and coalition privacy to capture their positive privacy impact. We formally define these privacy notions in the applied pi calculus and build a hierarchy showing their relations.

show abstract

“…Although these protocols tried to provide secure and untraceable communication for RFID systems, however many weaknesses have been found in them [16,17,18,19,20,21]. In this context, Yeh et al have recently proposed a RFID mutual authentication protocol compatible with EPC C-1 G-2 standard [22] that we name SRP (Securing RFID Protocol) in this paper.…”

Section: Introductionmentioning

confidence: 99%

Attacks on a Lightweight Mutual Authentication Protocol under EPC C-1 G-2 Standard

Habibi

Alagheband

Aref

2011

Information Security Theory and Practice. Security and Privacy of Mobile Devices in Wireless Communication

View full text Add to dashboard Cite

Abstract. Yeh et al. have recently proposed a mutual authentication protocol based on EPC Class-1 Gen.-2 standard. They claim their protocol is secure against adversarial attacks and also provides forward secrecy. In this paper we show that the proposed protocol does not have cited security features properly. A powerful and practical attack is presented on this protocol whereby the whole security of the protocol is broken. Furthermore, Yeh et al.'s protocol does not assure the untraceabilitiy and backwarduntraceabilitiy attributes. We also will propose our revision to safeguard the Yeh et al.'s protocol against cited attacks.

show abstract

Untraceability of RFID Protocols

Cited by 44 publications

References 35 publications

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks

Enforcing Privacy in the Presence of Others: Notions, Formalisations and Relations

Attacks on a Lightweight Mutual Authentication Protocol under EPC C-1 G-2 Standard

Contact Info

Product

Resources

About