2006
DOI: 10.1007/978-3-540-49823-0_20
|View full text |Cite
|
Sign up to set email alerts
|

Secure Communication for RFIDs Proactive Information Security Within Computational Security

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…The requirements of this protocol are modular algebra operations, such as multiplication of matrices, and on-tag PRNG primitives. Based on similar requirements, such as on-tag PRNG and matrix algebra operations, Dolev et al present in [17] two low-overhead proactive unidirectional protocols, called PISP (Proactive Informational Secure Protocol) and PCSP (Proactive Computationally Secure Protocol), with evolving on-tag secrets that expands indefinitely over time. Both PISP and PCSP are compared and contrasted in a joint publication appeared in [19].…”
Section: Low-overhead and Ultra-lightweight Solutionsmentioning
confidence: 99%
“…The requirements of this protocol are modular algebra operations, such as multiplication of matrices, and on-tag PRNG primitives. Based on similar requirements, such as on-tag PRNG and matrix algebra operations, Dolev et al present in [17] two low-overhead proactive unidirectional protocols, called PISP (Proactive Informational Secure Protocol) and PCSP (Proactive Computationally Secure Protocol), with evolving on-tag secrets that expands indefinitely over time. Both PISP and PCSP are compared and contrasted in a joint publication appeared in [19].…”
Section: Low-overhead and Ultra-lightweight Solutionsmentioning
confidence: 99%
“…We see in the use of mutual and proactive evolving predistributed secret schemes (e.g., approaches presented in [25,13]) the most promising candidate for our motivation scenario. These solutions, which mainly rely on the use of on-board pseudo-random number generators, relax the drawbacks detected on the use of hashing functions and environmental values.…”
Section: Summary and Discussionmentioning
confidence: 99%
“…The authors show, indeed, the possibility of a denial-of-service in the strategy presented in [25], and summarized as Protocol 2. An alternative solution, presented in [13], and summarized in Protocol 3, has been reported as computationally secure while still lightweight enough for being implemented in resource-constrained RFID labels.…”
Section: Summary and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The vector ARV is updated by performing xor of corresponding entries with randomly chosen new n dimensional vector at any communication session. Our work is mostly related to the schemes presented in [6] and filed as patent [7]. In this paper we present here an equivalent solution that maintains only a vector of n numbers instead of O(n 2 ) numbers.…”
Section: Introductionmentioning
confidence: 99%