Position-Verification in Multi-Channel Models

We propose an efficient collusion-attack-resistant position-verification protocol in a new model named multi-channel model. In the multi-channel model, there are lots of communication channels. When a player picks a random channel and sends a short message over it, the message might slip by an adversary with high probability if the adversary does not know the channel beforehand. This idea is motivated by the multiple-access methods. We adopt it to solve the position-verification task. Adding different constraints into the multi-channel model, we make three sub-models: receivingconstrained multi-channel model, sending-constrained multi-channel model and both-constrained multichannel model. Our position-verification protocol is secure under all of these sub-models with appropriate parameters.

[1]  Ronen Shaltiel,et al.  Constant-Round Oblivious Transfer in the Bounded Storage Model , 2006, Journal of Cryptology.

[2]  Chi-Jen Lu.  Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors , 2003, Journal of Cryptology.

[3]  Srdjan Capkun,et al.  Secure Localization with Hidden and Mobile Base Stations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Michael O. Rabin,et al.  Hyper-Encryption and Everlasting Security , 2002, STACS.

[5]  Yonatan Aumann,et al.  Information Theoretically Secure Communication in the Limited Storage Space Model , 1999, CRYPTO.

[6]  Rafail Ostrovsky,et al.  Position Based Cryptography , 2009, CRYPTO.

[7]  Claude Crépeau,et al.  Oblivious transfer with a memory-bounded receiver , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Salil P. Vadhan,et al.  Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.

[9]  Serge Fehr,et al.  Position-Based Quantum Cryptography , 2011, ERCIM News.

[10]  Giovanni Di Crescenzo,et al.  Perfectly Secure Password Protocols in the Bounded Retrieval Model , 2006, TCC.

[11]  Yan Zong Ding,et al.  Oblivious Transfer in the Bounded Storage Model , 2001, CRYPTO.

[12]  Yuguang Fang,et al.  Secure localization and authentication in ultra-wideband sensor networks , 2006, IEEE Journal on Selected Areas in Communications.

[13]  Yonatan Aumann,et al.  Everlasting security in the bounded storage model , 2002, IEEE Trans. Inf. Theory.

[14]  Ueli Maurer,et al.  On Generating the Initial Key in the Bounded-Storage Model , 2004, EUROCRYPT.

[15]  Stefan Dziembowski,et al.  Intrusion-Resilient Secret Sharing , 2007, FOCS 2007.

[16]  Rafail Ostrovsky,et al.  Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..

[17]  Ueli Maurer,et al.  Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.

[18]  Yan Zong Ding,et al.  Error Correction in the Bounded Storage Model , 2005, TCC.

[19]  Ueli Maurer.  Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.