一种多验证者的可验证量子随机数生成协议  

CERTIFIABLE QUANTUM RANDOM NUMBER GENERATION PROTOCOLWITH MULTIPLE VERIFIERS

作　　者：郑思豪 刘志昊[2,3] Zheng Sihao;Liu Zhihao(School of Cyber Science and Engineering,Southeast University,Nanjing 211189,Jiangsu,China;School of Computer Science and Engineering,Southeast University,Nanjing 211189,Jiangsu,China;Key Laboratory of Computer Network and Information Integration(Southeast University),Ministry of Education,Nanjing 211189,Jiangsu,China)

机构地区：[1]东南大学网络空间安全学院,江苏南京211189 [2]东南大学计算机科学与工程学院,江苏南京211189 [3]东南大学计算机网络和信息集成教育部重点实验室,江苏南京211189

出　　处：《计算机应用与软件》2025年第3期326-331,358,共7页Computer Applications and Software

基　　金：国家自然科学基金项目(61871120);江苏省自然科学基金项目(BK20191259);江苏省六大人才高峰项目(XYDXX-003);中央高校基本科研业务费专项资金项目(2242020K40046)。

摘　　要：Brakerski等提出的基于密码学测试的可验证量子随机数生成协议能够实现从持有单台量子设备的证明者处生成可验证的随机数,然而该协议中只有一名验证者,在应用范围上存在一定局限性。在该协议的基础上,结合门限秘密共享方案,提出了一种多验证者的可验证量子随机数生成协议。该协议使得n名验证者能够从一名证明者处获得相同的可验证随机数,从而拓宽了原协议的应用范围。安全性分析表明,对于一个计算能力不受限制,拥有证明者全部量子边信息以及不超过t名验证者信息的量子敌人,N个回合的协议生成的比特序列具有Ω(N)比特的最小熵。The certifiable quantum random number generation protocol based on cryptographic test proposed by Brakerski et al.can generate certifiable random numbers from the prover who holds a single quantum device.However,there is only one verifier in the protocol,thus there are certain limitations in application range.Based on the protocol of Brakerski et al.,combined with the threshold secret sharing scheme,a multi-verifier certifiable quantum random number generation protocol is proposed.This protocol enabled n verifiers to obtain the same certifiable random number from one prover,thus broadening the scope of application of the original protocol.The security analysis shows that for a computationally unbounded quantum adversary with quantum side information of the prover and the information of at most t verifiers,the bit sequence generated by the N-round protocol hasΩ(N)bits of min-entropy.

关 键 词：信息安全 密码协议 量子信息 量子随机数 

分 类 号：TN918[电子电信—通信与信息系统]