基于可能比特串的长距离高效量子数字签名
Efficient Quantum Digital Signatures over Long Distances with Likely Bit Strings
AI总结：
提出利用可能比特串改进基于哈希函数的量子数字签名协议，显著提升签名速率（超100倍）并延长签名距离（约150公里），同时通过Alice参与验证降低计算复杂度。
摘要：
量子数字签名（QDS）能够为消息提供针对伪造和抵赖的信息论安全性。与以往专注于签署单比特消息的QDS协议相比，基于哈希函数的QDS协议可以节省量子资源，并且能够签署任意长度的消息。利用可能比特串的思想，我们提出了一种基于哈希函数的长距离高效QDS协议。我们的可能比特串方法可以应用于任何基于量子密钥分发的QDS协议，以显著提高签名速率并大幅增加QDS协议的安全签名距离。为了节省计算资源，我们提出了一种改进方法，其中Alice参与Bob和Charlie的验证过程。这消除了与所有可能字符串的巨大数量相关的计算复杂性。我们以发送或不发送QDS为例展示了我们方法和改进方法的优势。在典型参数下，与不使用可能比特串的基于哈希函数的QDS协议相比，我们的方法和改进方法都能将签名速率提高100倍以上，并将签名距离增加约150公里。
英文摘要：
Quantum digital signatures (QDSs) can provide information-theoretic security of messages against forgery and repudiation. Compared with previous QDS protocols that focus on signing one-bit messages, hash function-based QDS protocols can save quantum resources and are able to sign messages of arbitrary length. Using the idea of likely bit strings, we propose an efficient QDS protocol with hash functions over long distances. Our method of likely bit strings can be applied to any quantum key distribution-based QDS protocol to significantly improve the signature rate and dramatically increase the secure signature distance of QDS protocols. In order to save computing resources, we propose an improved method where Alice participates in the verification process of Bob and Charlie. This eliminates the computational complexity relating to the huge number of all likely strings. We demonstrate the advantages of our method and our improved method with the example of sending-or-not-sending QDS. Under typical parameters, both our method and our improved method can improve the signature rate by more than 100 times and increase the signature distance by about 150 km compared with hash function-based QDS protocols without likely bit strings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
