Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Position Based Cryptography

Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky

Published Jan 1, 2009• 159 citations
Publisher
DOI
10.1007/978-3-642-03356-8_23

Related papers

Position-Based Cryptography from Noisy Channels

Stefan Dziembowski, Maciej Zdanowicz

Lecture notes in computer science•Jan 1, 2014•7 citations

Position-Based Cryptography and Multiparty Communication Complexity

Joshua Brody, Stefan Dziembowski, Sebastian Faust +1 more

Lecture notes in computer science•Jan 1, 2017•7 citations

Position based cryptography with location privacy: A step for Fog Computing

Rupeng Yang, Qiuliang Xu, Man Ho Au +3 more

Future Generation Computer Systems•Jun 3, 2017•62 citations

Multiple-Valued Logic and Neural Network in the Position-Based Cryptography Scheme

Alexey Yu. Bykovsky

Journal of Russian Laser Research•Sep 1, 2021•10 citations

Secure-Positioning-Protocol-Based Symmetric Cryptography

Qing-shui XUE, Fengying Li, Xiangwei Zheng +4 more

Position-based cryptography has attracted lots of researchers’ attention. In the mobile Internet, there are lots of position-based security applications. For the first time, one new conception, positioning-protocol-based symmetric cryptography is proposed. Based on one secure positioning protocol, one symmetric model is proposed. In the model, positioning protocols are bound to symmetric cryptography tightly, not loosely. Moreover, we propose one concrete positioning-protocol-based symmetric scheme, its correctness is proved. To our best knowledge, it is the first positioning-protocol-based symmetric scheme.

DEStech Transactions on Computer Science and Engineering•Dec 6, 2017•0 citations

Loss-tolerant position-based quantum cryptography

Bing Qi, George Siopsis

Position-based quantum cryptography (PBQC) allows a party to use its geographical location as its only credential to implement various cryptographic protocols. Such a protocol may lead to important applications in practice. Although it has been shown that any PBQC protocol is breakable if the adversaries pre-share an arbitrarily large entangled state, the security of PBQC in the bounded-quantum-storage model is still an open question. In this paper, we study the performance of various PBQC protocols over a lossy channel under the assumption that no entanglement is pre-shared between adversaries. By introducing the decoy state idea, we show that an extended Bennett-Brassard-1984--type PBQC protocol implemented with a weak coherent source and realistic single-photon detectors can tolerate an overall loss (including both the channel loss and the detection efficiency) of 13 dB if the intrinsic quantum bit error rate is 1%. We also study a few continuous variable PBQC protocols and show that they suffer from a 3-dB loss limitation.

arXiv:1502.02020•Physical Review A•Apr 28, 2015•31 citations
Position-based cryptography has attracted lots of researchers’ attention. In the mobile Internet, there are lots of position-based security applications. For the first time, one new conception, positioning-protocol-based symmetric cryptography is proposed. Based on one secure positioning protocol, one symmetric model is proposed. In the model, positioning protocols are bound to symmetric cryptography tightly, not loosely. Moreover, we propose one concrete positioning-protocol-based symmetric scheme, its correctness is proved. To our best knowledge, it is the first positioning-protocol-based symmetric scheme.
Position-based quantum cryptography (PBQC) allows a party to use its geographical location as its only credential to implement various cryptographic protocols. Such a protocol may lead to important applications in practice. Although it has been shown that any PBQC protocol is breakable if the adversaries pre-share an arbitrarily large entangled state, the security of PBQC in the bounded-quantum-storage model is still an open question. In this paper, we study the performance of various PBQC protocols over a lossy channel under the assumption that no entanglement is pre-shared between adversaries. By introducing the decoy state idea, we show that an extended Bennett-Brassard-1984--type PBQC protocol implemented with a weak coherent source and realistic single-photon detectors can tolerate an overall loss (including both the channel loss and the detection efficiency) of 13 dB if the intrinsic quantum bit error rate is 1%. We also study a few continuous variable PBQC protocols and show that they suffer from a 3-dB loss limitation.