Please wait a minute...
设为首页 | 加入收藏  
通信与信息网络学报  2016 Issue (4)    DOI: 10.11959/j.issn.2096-1081.2016.045
  本期目录 | 过刊浏览 | 高级检索 |
Position based key exchange: definitions and implementations
Junwei ZHANG(),Fangqiong DU(),Jianfeng MA(),Chao YANG()
School of Cyber Engineering, Xidian University, Xi’an 710071, China
全文: PDF(740 KB)   HTML     XML
输出: BibTeX | EndNote (RIS)  
服务
加入引用管理器
E-mail Alert
RSS
作者相关文章
Abstract

Chandran, et al.introduce the direction of position based cryptography at CRYPTO 2009.In position based cryptography, the position of a party is used to be its unique “credential” in order to realize the cryptographic tasks, such as position based encryption, position based signature, position based key exchange and so on.Position based key exchange, as a basic primitive in position based cryptography, can be used to establish a shared key based on the position of the participant.To begin with, this paper presents the notions of the prover-to-verifier mode and the prover-to-prover mode for position based key exchange.In the prover-to-verifier mode, a secret key can be shared between a prover and the verifiers according to the position of the prover.While in the prover-to-prover mode, two provers located at the valid positions can negotiate a shared key with the help of the verifiers and any other party whose position is illegal cannot obtain the shared key.At the same time, this paper formalizes two security definitions against colluding adversaries: position based prover-to-verifier key exchange and position based prover-to-prover key exchange.Then, this paper introduces the bounded retrieval model and the implementations of position based key exchange in two modes based on the bounded retrieval model.Finally, this paper discusses the position based key exchange protocols in two modes from both security and performance perspectives.

Key wordsposition based key exchange    position based cryptography    prover-to-verifier    prover-to-prover    bounded retrieval model
出版日期: 2017-04-05
链接本文:  
http://www.infocomm-journal.com/jcin/CN/10.11959/j.issn.2096-1081.2016.045
  
Figure1   The p2v mode in 2-dimensions
  
Figure2   The p2p mode in 2-dimensions
  
Figure3   Protocol p2vKE$lt@span sup=1$gt@1$lt@/span$gt@
  
Figure4   Protocol p2pKE1
protocol p2vKE3 p2vKEC3 p2pKE3 p2pKEC3 p2pKEE3
verifier computation 4F 4F + 2F+2g 8F 8F 8F
verifier communication |r|+4|X| |r|+4|X|+|g| |r|+ 7|X| |r|+7|X| |r|+7|X|
prover computation 4F 4F+2f+2g 4F+f 4F + 3f + 2g 4F+ f + 2g + 2E
prover communication 0 |g| 0 |g| |g| + |q|
mode p2v p2v p2p p2p p2p
set-up assumptions 1,2,3 1,2,3 1,2,3 1,2,3 1,2,3,4
key confirmation no yes no yes yes
without key escrow no no yes
  
Table1   Comparison results
[1] RAO B , MINAKAKIS L . Evolution of mobile location-based services[J]. Communications of the ACM, 2003,46(12): 61-65.
[2] BERESFORD A R , STAJANO F . Location privacy in pervasive computing[J]. IEEE pervasive computing, 2003,2(1): 46-55.
[3] ZHANG J W , MA J F , MOON S J . Universally composable secure TNC model and EAP-TNC protocol in IF-T[J]. Science china information sciences, 2010,53(3): 465-482.
[4] CHANDRAN N , GOYAL V,MORI-ARTY R , et al . Position based cryptography[C]// Advances in Cryptology-CRYPTO,Springer Berlin Heidelberg, 2009: 391-407.
[5] BUHRMAN H , CHANDRAN N , FEHR S ,et al. Position-based quantum cryptography:impossibility and constructions[J]. Siam Journal on Computing, 2010,43(1): 150-178.
[6] LAU H K , LO H K . Insecurity of position-based quantumcryptography protocols against entanglement attacks[J].Physical review a,2011,83(1):012322. Physical review a, 2011,83(1):012322
[7] TOMAMICHEL M , FEHR S , KANIEWSKI J ,et al. One-sided device-independent QKD and position-based cryptography from monogamy games[C]// Advances in Cryptology-EUROCRYPT,2013, 7881: 609-625.
[8] ZHANG J W , MA J F , YANG C ,et al. Universally composable secure positioning in the bounded retrieval model[J].Science China information sciences, 2015,58(11): 110105:1-110105:15.
[9] ZHANG J W , MA Z , MA J F ,et al. UC security model of position based key exchange[J]. Journal of computer research and development, 2014,51(2): 353-359.
[10] ZHANG J W , CHEN Z P , MA J F ,et al. Provably secure position based prover-to-prover key exchange protocols[J]. Acta electronica sinica, 2016,44(1): 353-359.
[11] PERRIG A , SZEWCZYK R , TYGAR J D ,et al. SPINS:security protocols for sensor networks[J]. Wireless networks, 2002,8(5): 521-534.
[12] ZHANG J W , MA J F , MOON S J . Universally composable onetime signature and broadcast authentication[J]. Science China information sciences, 2010,53(3): 567-580.
[13] GOLDREICH O , GOLDWASSER S,MI-CALI S . How to construct random functions[J]. Journal of the ACM, 1986,33(4): 792-807.
[14] ZHANG J W , MA J F , YANG C . Protocol derivation system for the Needham-Schroeder family[J]. Security and communication networks, 2015,8: 2687-2703.
[15] CHEN L , KUDLA C . Identity based authenticated key agreement protocols from pairings[J]. International journal of information security, 2007,20(4): 219-233.
[16] BONEH D . The decision Diffie-Hellman problem[J]. Algorithmic number theory, 1998,23(2): 48-63.
No related articles found!
本论文下载/浏览情况
全文


摘要

版权所有 © 2015 《通信与信息网络学报》编辑部