Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2004.11596

Help | Advanced Search

Quantum Physics

arXiv:2004.11596 (quant-ph)
[Submitted on 24 Apr 2020 (v1) , last revised 11 Jun 2020 (this version, v5)]

Title: Quantum Key Recycling with Optimal Key Recycling Rate based on Error Rate

Title: 基于误码率的最优密钥回收量子密钥回收

Authors:Yu-Chin Lu, Chia-Wei Tsai, Tzonelih Hwang
Abstract: We propose a new Quantum Key Recycling (QKR) protocol, which can tolerate the noise in the quantum channel. Our QKR protocol recycles the used keys according to the error rate. The key recycling rate of the pre-shared keys in our QKR protocol is optimized depending on the real error rate in the quantum channel. And our QKR protocol has higher efficiency than the exiting QKR protocol with error-tolerance. The security proof shows the security of the recycled keys is universal composable.
Abstract: 我们提出一种新的量子密钥回收(QKR)协议,该协议可以容忍量子信道中的噪声。 我们的QKR协议根据误码率回收已使用的密钥。 在我们的QKR协议中,预共享密钥的密钥回收率根据量子信道中的实际误码率进行优化。 并且,我们的QKR协议比现有的具有容错能力的QKR协议效率更高。 安全证明表明,回收的密钥的安全性是通用可组合的。
Comments: 8 pages, 3 figures. There is a related study here (arXiv:2005.14488 [quant-ph])
Subjects: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR)
Cite as: arXiv:2004.11596 [quant-ph]
  (or arXiv:2004.11596v5 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2004.11596
arXiv-issued DOI via DataCite

Submission history

From: Tzonelih Hwang [view email]
[v1] Fri, 24 Apr 2020 08:49:47 UTC (336 KB)
[v2] Wed, 27 May 2020 09:51:27 UTC (338 KB)
[v3] Mon, 1 Jun 2020 04:34:47 UTC (364 KB)
[v4] Mon, 8 Jun 2020 09:06:50 UTC (388 KB)
[v5] Thu, 11 Jun 2020 21:12:02 UTC (384 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2020-04
Change to browse by:
cs
cs.CR

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号