Title
Universally composable secure positioning in the bounded retrieval model.
Abstract
The universal composition security of secure positioning, which is a vital primitive in position-based cryptography, is investigated in this paper. This paper proposes a universally composable secure positioning model, which is a bounded retrieval model (F BRM) with the ideal functionalities of secure positioning (F SP d ). Then, a one-dimensional version of a novel secure positioning protocol SPreg1 is presented, which is universally composable and is secure in the (F REG, F BRM)-hybrid model. Protocol SPreg1 additionally offers verifier authentication properties, as opposed to similar existing secure positioning protocols. Lastly, a generic version of the secure positioning protocol SPregd in d dimensions is proposed based on the protocol SPreg1. In summary, the proposed secure positioning protocols have been proved to be secure in the universally composable framework.
Year
DOI
Venue
2015
10.1007/s11432-015-5412-9
SCIENCE CHINA Information Sciences
Keywords
Field
DocType
secure positioning, position-based cryptography, universally composable, bounded retrieval model, ideal functionality, 安全定位, 位置密码学, 通用可组合, 有界提取模型, 理想函数, 110105
Authentication,Cryptography,Computer science,Secure two-party computation,Bounded function,Distributed computing
Journal
Volume
Issue
ISSN
58
11
1869-1919
Citations 
PageRank 
References 
3
0.38
12
Authors
4
Name
Order
Citations
PageRank
Junwei Zhang1469.28
Jianfeng Ma2120789.64
Chao Yang3356.47
Yang Li414545.40