نتایج جستجو برای: distance bounding protocol

تعداد نتایج: 489170  

2014
Max Kanovich Tajana Ban Kirigin Vivek Nigam Andre Scedrov Carolyn Talcott

Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity to infer an upper bound of the distance between two agents. We classify such security protocols as cyber-physical. The key elements of such protocol...

2002
CHANDANA PAUL FUMIYA IIDA RAJA DRAVID

In this paper a novel hopping robot is introduced that uses inverse pendulum dynamics to induce several different gaits. Its mechanical structure consists of a rigid inverted T-shape mounted on four compliant feet. An upright “T” structure is connected to this by a rotary joint. The horizontal beam of the upright “T” is connected to the vertical beam by a second rotary joint. Using this two deg...

Journal: :CoRR 2010
Karim M. El Defrawy Srdjan Capkun Gene Tsudik

Secure distance bounding (DB) protocols allow one entity, the verifier, to securely obtain an upper-bound on the distance to another entity, the prover. Thus far, DB was considered mostly in the context of a single prover and a single verifier. There has been no substantial prior work on secure DB in group settings, where a set of provers interact with a set of verifiers. The need for group dis...

Journal: :IACR Cryptology ePrint Archive 2008
Jorge Munilla Alberto Peinado

Singelée and Preneel have recently proposed a enhancement of Hancke and Kuhn’s distance bounding protocol for RFID. The authors claim that their protocol offers substantial reductions in the number of rounds, though preserving its advantages: suitable to be employed in noisy wireless environments, and requiring so few resources to run that it can be implemented on a low-cost device. Subsequentl...

Journal: :IACR Cryptology ePrint Archive 2009
Dang Nguyen Duc Kwangjo Kim

In this paper, we propose a grouping-proof protocol for RFID tags based on secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called mafia fraud atttack. Mafia fra...

2012
Asli Bay Ioana Boureanu Aikaterini Mitrokotsa Iosif Spulber Serge Vaudenay

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, eventually impersonating the prover to the verifier and possibly gaining the privileges of the former. This sort of simple relay attacks are prev...

2009
Dang Nguyen Duc Jangseong Kim Kwangjo Kim

In this paper, we propose a grouping-proof protocol for RFID tags based on (n, n)-secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called mafia fraud attack (som...

2013
Ioana Boureanu Aikaterini Mitrokotsa Serge Vaudenay

Relay attacks (and, more generally, man-in-the-middle attacks) are a serious threat against many access control and payment schemes. In this work, we present distance-bounding protocols, how these can deter relay attacks, and the security models formalizing these protocols. We show several pitfalls making existing protocols insecure (or at least, vulnerable, in some cases). Then, we introduce t...

Journal: :Journal of Computer Security 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید