2014
DOI: 10.1002/wcm.2482
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: This paper examines Vaudenay's privacy model, which is one of the first and most complete privacy models that featured the notion of different privacy classes. We enhance this model by introducing two new generic adversary classes, k‐strong and k‐forward adversaries where the adversary is allowed to corrupt a tag at most k times. Moreover, we introduce an extended privacy definition that also covers all privacy classes of Vaudenay's model. In order to achieve highest privacy level, we study low cost primitives… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 44 publications
0
3
0
Order By: Relevance
“…They did present architectures for processing RFID event data and included their experience and performance for prototype implementation; also, they presented business considerations for RFID usage of participants in the pharmaceutical supply chain. In [53], the authors proposed a new mutual authentication protocol in RFID systems that uses an ID tag encrypted with a hash function and a stream cipher-based OTP by a challenge-response pair of PUFs, which was invented by Naccache and Fremanteau in 1992 [54]. Thus, there is no crucial disclosure problem in the protocol.…”
Section: Using Rfid Tag Id Verification For Anti-counterfeitingmentioning
confidence: 99%
See 1 more Smart Citation
“…They did present architectures for processing RFID event data and included their experience and performance for prototype implementation; also, they presented business considerations for RFID usage of participants in the pharmaceutical supply chain. In [53], the authors proposed a new mutual authentication protocol in RFID systems that uses an ID tag encrypted with a hash function and a stream cipher-based OTP by a challenge-response pair of PUFs, which was invented by Naccache and Fremanteau in 1992 [54]. Thus, there is no crucial disclosure problem in the protocol.…”
Section: Using Rfid Tag Id Verification For Anti-counterfeitingmentioning
confidence: 99%
“…In [60], autonomic tracing of production processes with mobile agent-based computing (highly dynamic and cooperative, based on the idea of considering the closest provider to a buyer) was proposed; it relies on the use of agent-based ubiquitous computing technologies. In [53], the authors proposed a new mutual authentication protocol in RFID systems that uses an ID tag which is encrypted with a hash function and a stream cipher-based OTP by a challenge−response PUF [54]. There is no crucial disclosure problem in this protocol as the OTP is generated by using a NLM-128 generator which is simple, easy to implement in the hardware and software and highly secure as any one-way hash function can produce most of OTPs.…”
Section: Using Rfid Tag Id Verification For Anti-counterfeitingmentioning
confidence: 99%
“…-Restricted unclonability is equivalent to EUF-CMA security -Indistinguishability implies EUF-CMA security and one-wayness -No implication between one-wayness and EUF-CMA security -Pseudorandomness implies indistinguishability -(MP, n, |R|, λ, )-min-entropy implies (MP, n, , δ 1 , )-EUF-CMA security -(MP, n, |R|, log |R|, )-min-entropy implies (MP, n, , )-pseudorandomness. 4 Comparison to Existing Security Models 5 We do not limit the number of physical attacks the adversary can mount as defined in [18]. Instead, the pamter-resilience assures there is no extra information is leaked by the physical attacks.…”
Section: Relationships Between the Security Propertiesmentioning
confidence: 99%