针对量子对手的块最小熵源的有限设备无关提取

基于能量约束的对抗量子敌手的认证随机性生成

Certified Randomness Generation against Quantum Adversaries via Energy Constraints

本研究提出一种基于能量约束的制备-测量QRNG，证明单轮冯·诺依曼熵的紧下界，显著提升认证随机性生成的安全性与速率。

A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries

In privacy amplification, two mutually trusted parties aim to amplify the secrecy of an initial shared secret $X$ in order to establish a shared private key $K$ by exchanging messages over an insecure communication channel. If the channel is authenticated the task can be solved in a single round of communication using a strong randomness extractor; choosing a quantum-proof extractor allows one to establish security against quantum adversaries. In the case that the channel is not authenticated, Dodis and Wichs (STOC'09) showed that the problem can be solved in two rounds of communication using …

Secure Quantum Extraction Protocols

Knowledge extraction, typically studied in the classical setting, is at the heart of several cryptographic protocols. We introduce the notion of secure quantum extraction protocols. A secure quantum extraction protocol for an NP relation $\mathcal{R}$ is a classical interactive protocol between a sender and a receiver, where the sender gets the instance $z$ and a witness $w$, while the receiver only gets the instance $z$. For any efficient quantum adversarial sender (who follows the protocol but can choose its own randomness), there exists a quantum extractor that can extract a witness $w'$ su…

A modular framework for randomness extraction based on Trevisan's construction

Informally, an extractor delivers perfect randomness from a source that may be far away from the uniform distribution, yet contains some randomness. This task is a crucial ingredient of any attempt to produce perfectly random numbers---required, for instance, by cryptographic protocols, numerical simulations, or randomised computations. Trevisan's extractor raised considerable theoretical interest not only because of its data parsimony compared to other constructions, but particularly because it is secure against quantum adversaries, making it applicable to quantum key distribution. We discuss…

Device-independent randomness extraction for arbitrarily weak min-entropy source

Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of the devices. We show here how to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy source in a device independent setting. To do this we use Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the random sequence $n$. Our protocol is robust, it can to…

CopyQNN：不同量子噪声下的量子神经网络提取攻击

CopyQNN: Quantum Neural Network Extraction Attack under Varying Quantum Noise

针对含噪中等规模量子计算机中量子噪声影响QNN提取攻击的问题，提出CopyQNN框架，通过三步数据清洗及量子域对比与迁移学习，显著提升攻击性能并大幅减少查询次数。

无结构的可验证量子优势

Verifiable Quantum Advantage without Structure

本文在随机预言机模型下证明了无需高度结构化假设的量子优势，包括量子可解但经典不可解的NP搜索问题、抗经典攻击但量子可逆的密码学原语分离，以及具有最少交互轮数的可公开验证量子性证明。

The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation

The application and analysis of the Cut-and-Choose technique in protocols secure against quantum adversaries is not a straightforward transposition of the classical case, among other reasons due to the difficulty to use rewinding in the quantum realm. We introduce a Quantum Computation Cut-and-Choose (QC-CC) technique which is a generalisation of the classical Cut-and-Choose in order to build quantum protocols secure against quantum covert adversaries. Such adversaries can deviate arbitrarily provided that their deviation is not detected. As an application of the QC-CC we give a protocol for s…

A single-qubit position verification protocol that is secure against multi-qubit attacks

The position of a device or agent is an important security credential in today's society, both online and in the real world. Unless in direct proximity, however, the secure verification of a position is impossible without further assumptions. This is true classically, but also in any future quantum-equipped communications infrastructure. We show in this work that minimal quantum resources, in the form of a single qubit, combined with classical communication are sufficient to thwart quantum adversaries that pretend to be at a specific position and have the ability to coordinate their action wit…

通过极小极大方法对抗量子干扰源的信道编码

Channel coding against quantum jammers via minimax

本文提出了一种极小极大方法，用于表征在不同共享资源模型下完全量子任意变化信道的容量，并证明其与复合信道容量一致。