RFID Authentication Efficient Proactive Information Security within Computational Security

Kopeetsky, Marina; Shamir, Adi

doi:10.1007/s00224-009-9236-0

Cited by 11 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Memory space on current low-cost tags is another limitation to the security of these approaches. An enhanced version of the PCSP protocol, presented in [18], aims at preventing active attacks against the protocol while keeping similar requirements, i.e., on-tag PRNG primitives and matrix operations.…”

Section: Low-overhead and Ultra-lightweight Solutionsmentioning

confidence: 99%

Security Threat Mitigation Trends in Low-Cost RFID Systems

García-Alfaro

Barbeau

Kranakis

2010

Data Privacy Management and Autonomous Spontaneous Security

View full text Add to dashboard Cite

Abstract. The design and implementation of security threat mitigation mechanisms in RFID systems, specially in low-cost RFID tags, are gaining great attention in both industry and academia. One main focus of research interests is the authentication and privacy techniques to prevent attacks targeting the insecure wireless channel of these systems. Cryptography is a key tool to address these threats. Nevertheless, strong hardware constraints, such as production costs, power consumption, time of response, and regulations compliance, makes the use of traditional cryptography in these systems a very challenging problem. The use of low-overhead procedures becomes the main approach to solve these challenging problems where traditional cryptography cannot fit. Recent results and trends, with an emphasis on lightweight techniques for addressing critical threats against low-cost RFID systems, are surveyed.

show abstract

Section: Low-overhead and Ultra-lightweight Solutionsmentioning

confidence: 99%

Security Threat Mitigation Trends in Low-Cost RFID Systems

García-Alfaro

Barbeau

Kranakis

2010

Data Privacy Management and Autonomous Spontaneous Security

View full text Add to dashboard Cite

show abstract

“…However, we conjecture that our schemes are information-theoretically secure even in case of adaptive adversary. Furthermore, consider the case that an adversary is not able to listen to parts of the transmitted random string (e.g., [5]). Then, our schemes are secure in the presence of an adaptive adversary that misses a linear fraction of the transmitted random string.…”

Section: Discussionmentioning

confidence: 99%

Information security for sensors by overwhelming random sequences and permutations

Gilboa¹,

Kopeetsky²,

Persiano³

et al. 2014

Ad Hoc Networks

Self Cite

View full text Add to dashboard Cite

a b s t r a c tWe propose efficient schemes for information-theoretically secure key exchange in the Bounded Storage Model (BSM), where the adversary is assumed to have limited storage. Our schemes generate a secret One Time Pad (OTP) shared by the sender and the receiver, from a large number of public random bits produced by the sender or by an external source. Our schemes initially generate a small number of shared secret bits, using known techniques. We introduce a new method to expand a small number of shared bits to a much longer, shared key.Our schemes are tailored to the requirements of sensor nodes and wireless networks. They are simple, efficient to implement and take advantage of the fact that practical wireless protocols transmit data in frames, unlike previous protocols, which assume access to specific bits in a stream of data.Indeed, our main contribution is twofold. On the one hand, we construct schemes that are attractive in terms of simplicity, computational complexity, number of bits read from the shared random source and expansion factor of the initial key to the final shared key. On the other hand, we show how to transform any existing scheme for key exchange in BSM into a more efficient scheme in the number of bits it reads from the shared source, given that the source is transmitted in frames.

show abstract

“…Proactive event based systems have been studied by many researchers recently. Some examples include proactive management of transport processes [14] and proactive application event notification in sensor network [15]. Engel et al, proposed a proactive event processing framework based on CEP, PA and MDP [2,16].…”

Section: Related Workmentioning

confidence: 99%

A Proactive Parallel Complex Event Processing Method for Large-Scale Intelligent Transportation Systems

Wang¹,

Zhang²

2014

IJMUE

View full text Add to dashboard Cite

Intelligent Transportation Systems (ITS) is one of the important application areas of the Internet of Things (IoT). The key issue is how to process the huge events generated by IoT system to support ITS. In this paper a proactive parallel complex event processing method is proposed for congestion control in large-scale ITS. A Bayesian model averaging method is used to obtain accurate predictions under different event context. Based on the predictive analysis, a parallel Markov decision processes model is designed to support decision making for large-scale ITS. An optimized parallel policy iteration algorithm is proposed based on state partition and policy decomposition. The experimental evaluations show that this method has good accuracy and scalability when used to process congestion control in large-scale ITS.

show abstract

RFID Authentication Efficient Proactive Information Security within Computational Security

Cited by 11 publications

References 10 publications

Security Threat Mitigation Trends in Low-Cost RFID Systems

Security Threat Mitigation Trends in Low-Cost RFID Systems

Information security for sensors by overwhelming random sequences and permutations

A Proactive Parallel Complex Event Processing Method for Large-Scale Intelligent Transportation Systems

Contact Info

Product

Resources

About