{"calendar":"https://qcrypt.net/2025/schedule/program.ics","conference":{"address":"Sanya, Hainan, China","attendanceMode":"offline","city":"Sanya, China","endDate":"2025-08-29","name":"QCrypt 2025","startDate":"2025-08-25","timezone":"Asia/Shanghai","url":"https://qcrypt.net/2025/","venue":"Mangrove Tree Resort World Sanya Bay","year":"2025"},"days":[{"date":"2025-08-26","sessions":[{"date":"2025-08-26","key":"stuff/welcome","start":"2025-08-26T08:30:00+08:00","tags":["welcome"],"title":"Welcome Remark","url":"https://qcrypt.net/2025/sessions/stuff/welcome/"},{"chair":"Thomas Hahn","date":"2025-08-26","format":"tutorial","key":"tutorial/Tupkary","speakers":["Devashish Tupkary"],"start":"2025-08-26T08:40:00+08:00","title":"Tutorial Talk: Security proofs for decoy-state BB84 and their performance","url":"https://qcrypt.net/2025/sessions/tutorial/tupkary/","video":"https://youtu.be/dnaBkGFt9I0"},{"chair":"Thomas Hahn","date":"2025-08-26","format":"invited","key":"invited/Fedorov","speakers":["Kirill Fedorov"],"start":"2025-08-26T09:55:00+08:00","title":"Invited Talk: Quantum secure microwave communication","url":"https://qcrypt.net/2025/sessions/invited/fedorov/","video":"https://youtu.be/02NLvnu0GFs"},{"date":"2025-08-26","format":"break","key":"stuff/break","start":"2025-08-26T10:40:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Yu-Huai Li","date":"2025-08-26","format":"invited","key":"invited/Xie","speakers":["Zhenda Xie"],"start":"2025-08-26T11:10:00+08:00","title":"Invited Talk: Optical Quantum Network using Drones","url":"https://qcrypt.net/2025/sessions/invited/xie/","video":"https://youtu.be/eaUJhe4Ftkg"},{"chair":"Yu-Huai Li","date":"2025-08-26","format":"contributed","key":"contributed/2a","papers":[{"abstract":"We demonstrate an entanglement-based quantum key distribution (QKD) system employing frequency-bin encoding. The entangled state is generated using two independent high-finesse ring resonators fabricated on a silicon photonic chip. The system implements the BBM92 protocol with a passive basis selection scheme and enables simultaneous acquisition of sixteen projective measurements across two mutually unbiased bases. To counteract random phase fluctuations induced by thermal instabilities in the transmission fiber, we apply a real-time adaptive phase correction to the measurement basis.\nWe achieve stable QKD over a 26 km fiber spool with a secure key rate exceeding 4.5 bit/s.","authors":[{"affiliation":"University of Florence","name":"Giulia Guarda"},{"affiliation":"University of Pavia","name":"Noemi Tagliavacche"},{"affiliation":"University of Pavia","name":"Massimo Borghi"},{"affiliation":"University of Florence","name":"Domenico Ribezzo"},{"affiliation":"University of Pavia","name":"Marco Liscidini"},{"affiliation":"University of Florence","name":"Davide Bacco"},{"affiliation":"University of Pavia","name":"Matteo Galli"},{"affiliation":"University of Pavia","name":"Daniele Bajoni"}],"pid":103,"title":"Frequency-bin entanglement-based quantum key distribution","video":"https://youtu.be/CGdB9bd_tyU"},{"abstract":"The development of quantum networks is paramount towards practical and secure communications. Quantum digital signatures (QDS) offer an information-theoretically secure solution for ensuring data integrity, authenticity, and nonrepudiation, rapidly growing from proof-of-concept to robust demonstrations. However, previous QDS systems relied on expensive and bulky optical equipment, limiting large-scale deployment and reconfigurable networking construction. Here, we introduce and verify a chip-based QDS network, placing the complicated and expensive measurement devices in the central relay while each user needs only a low-cost transmitter. We demonstrate the network with a three-node setup using an integrated encoder chip and decoder chip. By developing a 1-decoy-state one-time universal hashing-QDS protocol, we achieve a maximum signature rate of 0.0414 times per second for a 1 Mbit messages over fiber distances up to 200 km, surpassing all current state-of-the-art QDS experiments. This study validates the feasibility of chip-based QDS, paving the way for large-scale deployment and integration with existing fiber infrastructure.","authors":[{"affiliation":"Guangxi University","name":"Yongqiang Du"},{"affiliation":"Nanjing University","name":"Bing-Hong Li"},{"affiliation":"National Information Optoelectronics Innovation Center","name":"Xin Hua"},{"affiliation":"Nanjing University","name":"Xiao-Yu Cao"},{"affiliation":"Guangxi University","name":"Zhengeng Zhao"},{"affiliation":"Guangxi University","name":"Feng Xie"},{"affiliation":"Guangxi University","name":"Zhenrong Zhang"},{"affiliation":"Renmin University of China","name":"Hua-Lei Yin"},{"affiliation":"National Information Optoelectronics Innovation Center","name":"Xi Xiao"},{"affiliation":"Guangxi University","name":"Kejin Wei"}],"pid":68,"title":"Chip-integrated quantum signature network over 200 km (original 1b/3)","video":"https://youtu.be/yXv6nMGo8l0"}],"start":"2025-08-26T11:55:00+08:00","title":"Contributed Talk 2a","url":"https://qcrypt.net/2025/sessions/contributed/2a/"},{"date":"2025-08-26","key":"stuff/lunch","start":"2025-08-26T12:35:00+08:00","tags":["lunch"],"title":"Lunch","url":"https://qcrypt.net/2025/sessions/stuff/lunch/"},{"chair":"Zhenda Xie","date":"2025-08-26","format":"contributed","key":"contributed/2b","papers":[{"abstract":"Quantum key distribution (QKD) has been proven to be an essential technology to resist the threat of quantum computing. Major technological powers such as the United States and countries in Europe have already begun the development of quantum key distribution networks. After years of technological research, China has further developed the operational-level 10,000-kilometre quantum secure communication network for business applications ‘China Quantum Communication Network’ (CN-QCN), developed based on ‘Shanghai-Beijing Backbone’. This report summarizes the advanced practices of CN-QCN in areas such as Backbone and　Metropolitan networks organization and network management. It also highlights several initiatives designed to enhance the network usability, proposes a method for evaluating the availability of quantum networks.","authors":[{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Hao-Ze Chen"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Ming-Han Li"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Yu-Zhou Wang"},{"affiliation":"Anhui CAS Quantum Network Co., Ltd., Hefei, China","name":"Zhen-Geng Zhao"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Cheng Ye"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Fei-Long Li"},{"affiliation":"Anhui CAS Quantum Network Co., Ltd., Hefei, China","name":"Zhu Chen"},{"affiliation":"Anhui CAS Quantum Network Co., Ltd., Hefei, China","name":"Sheng-Long Han"},{"affiliation":"Anhui CAS Quantum Network Co., Ltd., Hefei, China","name":"Bao Tang"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Ya-Jun Miao"},{"affiliation":"CAS Quantum Network Co., Ltd., Shanghai, China","name":"Wei Qi"}],"pid":95,"title":"Implementation of carrier-grade quantum communication networks over 10000 km: from Shanghai-Beijing Backbone to China quantum communication network","video":"https://youtu.be/S_82ZwaSdJ8"},{"abstract":"The no-cloning theorem leads to information-theoretic security in various quantum cryptographic protocols. However, this security typically derives from a possibly weaker property that classical information encoded in certain quantum states cannot be broadcast.  To formally capture this property, we introduce the study of ``orthogonality broadcasting.\"  When attempting to broadcast the orthogonality of two different qubit bases, we establish that the power of classical and quantum communication is equivalent. However, quantum communication is shown to be strictly more powerful for broadcasting orthogonality in higher dimensions. We then relate orthogonality broadcasting to quantum position verification and provide a new method for establishing error bounds in the no pre-shared entanglement model that can address protocols previous methods could not. Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.","authors":[{"affiliation":"National University of Singapore","name":"Ian George"},{"affiliation":"QuSoft, CWI Amsterdam","name":"Rene Allerstorfer"},{"affiliation":"Sorbonne Université","name":"Philip Verduyn Lunel"},{"affiliation":"University of Illinois at Urbana-Champaign","name":"Eric Chitambar"}],"pid":38,"title":"Orthogonality Broadcasting and Quantum Position Verification","video":"https://youtu.be/mJpIhVU_N4s"},{"abstract":"In this work, we address the challenge of dynamically rerouting quantum key distribution (QKD) links during live operation without the need for a system restart. Our novel resynchronization method, combined with a qubit-based clock frequency recovery algorithm, enables seamless rerouting of quantum channels in software-defined networks (SDNs). We validate our method with our 625 MHz real-time BB84 QKD system, using free-running cost-effective quartz oscillators and without an optical clock channel. The effectiveness of our method is demonstrated by the reliable system operation covering fiber length changes exceeding 100 km and sustaining channel interruptions of multiple minutes. We believe that our findings will significantly enhance the utility of QKD systems and simplify their flexible integration into existing and future telecom infrastructures, including optically switched SDNs.","authors":[{"affiliation":"Fraunhofer HHI","name":"Jan Krause"},{"affiliation":"Fraunhofer HHI","name":"Stephanie Renneke"},{"affiliation":"Fraunhofer HHI","name":"Jonas Hilt"},{"affiliation":"Fraunhofer HHI","name":"Oliver Peters"},{"affiliation":"Fraunhofer HHI","name":"Peter Hanne"},{"affiliation":"Fraunhofer HHI","name":"Andy Schreier"},{"affiliation":"Fraunhofer HHI","name":"Ronald Freund"},{"affiliation":"Fraunhofer HHI","name":"Nino Walenta"}],"pid":89,"title":"Dynamic rerouting of quantum key distribution links during live operation","video":"https://youtu.be/JI9Cx8Tnj6A"},{"abstract":"Quantum networks, which integrate multiple quantum computers and the channels connecting them, are crucial for distributed quantum information processing but remain inherently susceptible to channel noise. \nThe channel purification protocol emerges as a promising technique for directly suppressing noise in quantum channels without complex encoding and decoding operations, making it particularly suitable for remote quantum information transmission in optical systems. \nIn this work, leveraging the spatial and polarization degrees of freedom of photons, we propose a novel experimental configuration that efficiently implements the channel purification protocol, utilizing two Fredkin gates to coherently interfere independent noise channels. \nBased on this configuration, we experimentally demonstrate that the protocol can suppress the noise with various noise levels and forms.\nFurthermore, we apply our protocol in a practical application of entanglement distribution, showing that the channel purification can effectively protect the distributed entanglement from channel noise.","authors":[{"affiliation":"University of Science and Technology of China","name":"Yueyang Fei"},{"affiliation":"Tsinghua University","name":"Zhenhuan Liu"},{"affiliation":"University of Science and Technology of China","name":"Rui Zhang"},{"affiliation":"University of Science and Technology of China","name":"Yu-Ao Chen"}],"pid":96,"title":"Experimental Quantum Channel Purification","video":"https://youtu.be/0T5Gczd2JU4"}],"start":"2025-08-26T14:00:00+08:00","title":"Contributed Talk 2b","url":"https://qcrypt.net/2025/sessions/contributed/2b/"},{"date":"2025-08-26","format":"break","key":"stuff/break","start":"2025-08-26T15:20:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Christian Majenz","date":"2025-08-26","format":"tutorial","key":"tutorial/Liu","speakers":["Yang Liu"],"start":"2025-08-26T15:50:00+08:00","title":"Tutorial Talk: Twin-field quantum key distribution experiments","url":"https://qcrypt.net/2025/sessions/tutorial/liu/","video":"https://youtu.be/lpBHgJBbPTQ"},{"date":"2025-08-26","key":"stuff/group","start":"2025-08-26T17:05:00+08:00","tags":["group"],"title":"Group photo \u0026 Poster (Even Number)","url":"https://qcrypt.net/2025/sessions/stuff/group/"},{"date":"2025-08-26","key":"stuff/banquet","start":"2025-08-26T18:25:00+08:00","tags":["banquet"],"title":"Banquet","url":"https://qcrypt.net/2025/sessions/stuff/banquet/"},{"chair":"Qiang Zhang","date":"2025-08-26","key":"lecture/Brassard","speakers":["Gilles Brassard"],"start":"2025-08-26T19:30:00+08:00","title":"After dinner talk: Two quantum tales","url":"https://qcrypt.net/2025/sessions/lecture/brassard/","video":"https://youtu.be/2SHz6PhthVc"}]},{"date":"2025-08-27","sessions":[{"chair":"Giuseppe Vallone","date":"2025-08-27","format":"invited","key":"invited/Zhou","speakers":["Lai Zhou"],"start":"2025-08-27T08:40:00+08:00","title":"Invited Talk: Field trial of TF-QKD using independent optical frequency combs ","url":"https://qcrypt.net/2025/sessions/invited/zhou/","video":"https://youtu.be/SeicA3Xb-e0"},{"chair":"Giuseppe Vallone","date":"2025-08-27","format":"contributed","key":"contributed/2c","papers":[{"abstract":"Quantum information allows us to build quantum money schemes, where a bank can issue banknotes in the form of authenticatable quantum states that cannot be cloned or counterfeited: a user in possession of k banknotes cannot produce k + 1 banknotes. Similar to paper banknotes, in existing quantum money schemes, a banknote consists of an unclonable quantum state and a classical serial number, signed by the bank. Thus, they lack one of the most fundamental properties cryptographers look for in a currency scheme: privacy/anonymity. \n\nIn this work, we construct the first public-key quantum coin scheme, that is, a money scheme where all banknotes are identical. Assuming existence of subspace-hiding obfuscation, we construct a public-key quantum coin scheme.\n    \nFurther, we show that quantum coins do not necessarily provide privacy against all adversaries. Therefore, we develop formal definitions of privacy for quantum money schemes. Then, we construct the first public-key quantum money schemes that satisfy these security notions. Namely,  assuming existence of indistinguishability obfuscation (iO) and hardness of Learning with Errors (LWE), we construct a public-key quantum money scheme with anonymity against users and traceability by authorities. a public-key quantum money scheme with untraceability (i.e. not even the bank/authorities can track banknotes).\n\nAs another application, we show that the no-cloning principle allows us to construct schemes, with advanced security guarantees that are classically impossible, for a seemingly unrelated application: voting! Assuming existence of iO and hardness of LWE, we construct a universally verifiable quantum voting scheme with classical votes.\n\nFinally, to achieve our results, we develop a variety of technical tools, which we believe might be of independent interest. We show a new result called quantum-state read-once small-range distributions, which shows how to simulate superposition query access to an exponential size oracle with quantum-state outputs using single copy each of polynomially many state samples. We construct a deterministic classical signature scheme secure against quantum-query access to the signing oracle. We construct publicly rerandomizable encryption with strong correctness from  LWE, where no adversary is able to produce a malicious ciphertext and a malicious random tape such that the ciphertext before and after rerandomization (with the malicious tape)  decrypts to different values.","authors":[{"affiliation":"Carnegie Mellon University","name":"Alper Cakan"},{"affiliation":"NTT Research","name":"Vipul Goyal"},{"affiliation":"NTT Social Informatics Laboratories","name":"Takashi Yamakawa"}],"pid":126,"title":"Anonymous Quantum Money, (Upgradeable) Quantum Coins, and Quantum Voting","video":"https://youtu.be/hs5Jkvw6FPQ"},{"abstract":"Random numbers are used in a wide range of sciences. In many applications, generating unpredictable private random numbers is indispensable. Device-independent quantum random number generation is a framework that makes use of the intrinsic randomness of quantum processes to generate numbers that are fundamentally unpredictable according to our current understanding of physics. While device-independent quantum random number generation is an exceptional theoretical feat, the difficulty of controlling quantum systems makes it challenging to carry out in practice. It is therefore desirable to harness the full power of the quantum degrees of freedom (the dimension) that one can control. It is known that no more than 2log(d) bits of private device-independent randomness can be extracted from a quantum system of local dimension d. In this paper we demonstrate that this bound can be achieved for all dimensions d by providing a family of explicit protocols. In order to obtain our result, we develop new certification techniques that can be of wider interest in device-independent applications for scenarios in which complete certification ('self-testing') is impossible or impractical. With our C*-algebra representation tools, we are able to device-independently certify non-projective measurements for the purpose of randomness generation. Our protocols use a class of measurements we call \"balanced informationally complete\" (BIC) POVMs, which we anticipate to be useful in scenarios where normally symmetric informationally complete (SIC) POVMs are useful. Moreover, we explicitly construct BIC-POVMs in every dimension, circumventing the problem with SIC-POVMs which are only conjectured to exist in every dimension.","authors":[{"affiliation":"University of York","name":"Máté Farkas"},{"affiliation":"University of Auckland","name":"Jurij Volčič"},{"affiliation":"University of Copenhagen","name":"Sigurd Anker Laursen Storgaard"},{"affiliation":"University of Copenhagen","name":"Ranyiliu Chen"},{"affiliation":"University of Copenhagen","name":"Laura Mančinska"}],"pid":90,"title":"Maximal device-independent randomness in every dimension (original 1c/1)","video":"https://youtu.be/itF6lRCTMu0"},{"abstract":"Quantum no-cloning theorem gives rise to the intriguing possibility of quantum copy protection where we encode a program or functionality in a quantum state such that a user in possession of k copies cannot create k + 1 copies, for any k. Introduced by Aaronson (CCC’09) over a decade ago, copy protection has proven to be notoriously hard to achieve. Previous work has been able to achieve copy-protection for various functionalities only in restricted models: (i) in the bounded collusion setting where k → k + 1 security is achieved for a-priori fixed collusion bound k (in the plain model with the same computational assumptions as ours, by Liu, Liu, Qian, Zhandry [TCC’22]), or, (ii) only k → 2k security is achieved (relative to a structured quantum oracle, by Aaronson [CCC’09]). In this work, we give the first unbounded collusion-resistant (i.e. multiple-copy secure) copy protection schemes, answering the long-standing open question of constructing such schemes, raised by multiple previous works starting with Aaronson (CCC’09). More specifically, we obtain the following results. We construct (i) public-key encryption, (ii) public-key functional encryption, (iii) signature and (iv) pseudorandom function schemes whose keys are copy-protected against unbounded collusions in the plain model (i.e. without any idealized oracles), assuming (post-quantum) subexponentially secure iO and LWE. We show that any unlearnable functionality can be copy-protected against unbounded collusions, relative to a classical oracle. As a corollary of our results, we rule out the existence of hyperefficient quantum shadow tomography, – even given non-black-box access to the measurements, assuming subexponentially secure iO and LWE, or, – unconditionally relative to a quantumly accessible classical oracle, and hence answer an open question by Aaronson (STOC’18). We obtain our results through a novel technique which uses identity-based encryption to construct multiple copy secure copy-protection schemes from 1-copy → 2-copy secure schemes. We believe our technique is of independent interest. Along the way, we also obtain the following results. We define and prove the security of new collusion-resistant monogamy-of-entanglement games for coset states. We construct a classical puncturable functional encryption scheme whose master secret key can be punctured at all functions f such that f(m0) ̸= f(m1).","authors":[{"affiliation":"Carnegie Mellon University","name":"Alper Cakan"},{"affiliation":"NTT Research","name":"Vipul Goyal"}],"pid":122,"title":"Impossibility of Hyperefficient Shadow Tomography: Unbounded Multiple-Copy Secure Copy-Protection","video":"https://youtu.be/ychHTONQ9fI"},{"abstract":"We present the strategic framework and technical foundations behind the development of the National Quantum-Safe Network (NQSN) in Singapore—a resilient, fully interoperable quantum-safe network. The testbed features a star-topology architecture built on production-grade fiber infrastructure, supporting multi-protocol quantum key distribution (QKD) and diverse applications from multiple vendors. A centralised key and network management system underpins its interoperability, enabling seamless integration across technologies. We further explore a range of quantum-secured use cases, including data center connectivity, edge computing, hybrid QKD–post-quantum cryptography (PQC) encryption, and multi-layer integration within the OSI stack. These technical insights demonstrate the feasibility and flexibility of deploying quantum-safe capabilities in a multi-input, multi-output network environment.","authors":[{"affiliation":"CQT, NUS","name":"Hao Qin"},{"affiliation":"CQT, NUS","name":"Jing Yan Haw"},{"affiliation":"CQT, NUS","name":"M. Wee"},{"affiliation":"ECE, NUS","name":"R. Frappier"},{"affiliation":"CQT, NUS","name":"C. Liang"},{"affiliation":"Fraunhofer SG @ NTU","name":"X. Duan"},{"affiliation":"SPMS, NTU","name":"Y. Cai"},{"affiliation":"Fraunhofer SG @ NTU","name":"S. Sarda"},{"affiliation":"SPMS, NTU","name":"K.W. Qiu"},{"affiliation":"CQT, NUS","name":"R. Murthy"},{"affiliation":"CQT, NUS","name":"T. Rimprongern"},{"affiliation":"ECE, NUS","name":"B. Sikdar"},{"affiliation":"SPMS, NTU","name":"N. Ng"},{"affiliation":"CQT, Dept. of Physics, NUS","name":"C. Kurtsiefer"},{"affiliation":"Fraunhofer SG @ NTU","name":"M. Kasper"},{"affiliation":"CQT, Dept. of Physics, NUS","name":"A. Ling"}],"pid":141,"title":"NQSN Singapore: A fully interoperable quantum-safe network testbed with versatile reference applications","video":"https://youtu.be/GjbxF5If1zk"}],"start":"2025-08-27T09:25:00+08:00","title":"Contributed Talk 3a (original 2c)","url":"https://qcrypt.net/2025/sessions/contributed/2c/"},{"date":"2025-08-27","format":"break","key":"stuff/break","start":"2025-08-27T10:45:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Gláucia Murta","date":"2025-08-27","format":"invited","key":"invited/Pauwels","speakers":["Jef Pauwels"],"start":"2025-08-27T11:10:00+08:00","title":"Invited Talk: Long-range quantum correlations and DIQKD in routed Bell scenarios","url":"https://qcrypt.net/2025/sessions/invited/pauwels/","video":"https://youtu.be/biOJmCaeucA"},{"chair":"Gláucia Murta","date":"2025-08-27","format":"contributed","key":"contributed/3a","papers":[{"abstract":"Variational techniques have been recently developed to find tighter bounds on the von Neumann entropy in a completely device-independent (DI) setting. This, in turn, has led to significantly improved key rates of DI protocols, in both the asymptotic limit as well as in the finite-size regime. In this work, we derive novel variational expressions for Petz-Rényi divergences instead. We also derive two critical applications of this result. First, we show how these variational expressions can be used to further improve the finite-size key rate of DI protocols, by developing a fully-Rényi entropy accumulation theorem that can utilize these expressions for key rate computations. Second, we derive a security condition for DI advantage distillation that is based on the pretty good fidelity. We implement these techniques to derive increased noise tolerances for DIQKD protocols, which surpass the previously known bounds.","authors":[{"affiliation":"Weizmann Institute of Science","name":"Thomas Hahn"},{"affiliation":"University of Waterloo","name":"Amir Arqand"},{"affiliation":"University of Waterloo","name":"Ernest Tan"},{"affiliation":"Télécom Paris","name":"Peter Brown"}],"pid":115,"title":"Simpler and Tighter Device-Independent Security Proofs","video":"https://youtu.be/EFJqK5uMHHw"},{"abstract":"Computational entropy notions play a central role in classical cryptography, with well-developed frameworks for analyzing unpredictability, leakage resilience, and pseudo-randomness. In the quantum setting, however, computational analogues of entropy remain largely unexplored. While quantum information theory provides powerful tools based on information-theoretic entropy, these do not capture the limitations of computationally bounded quantum adversaries.\n    In this work, we initiate the study of quantum computational entropy by defining \\emph{quantum computational unpredictability entropy}, a natural generalization of classical unpredictability entropy to the quantum setting. Our definition is based on the operational meaning of quantum min-entropy, but restricts the adversary to efficient quantum guessing strategies.\n    We prove that this entropy satisfies several important properties, including a leakage chain rule that holds even in the presence of prior quantum side-information. We also show that unpredictability entropy supports pseudo-randomness extraction against quantum adversaries with bounded computational power.  Together, these results lay a foundation for developing cryptographic tools that rely on min-entropy in the quantum computational setting.","authors":[{"affiliation":"Weizmann Institute of Science","name":"Noam Avidan"},{"affiliation":"Weizmann Institute of Science","name":"Rotem Arnon"}],"pid":136,"title":"Computational quantum unpredictability entropy and quantum leakage resilience (original 1c/3)","video":"https://youtu.be/7yHs6pXQ7JM"}],"start":"2025-08-27T11:55:00+08:00","title":"Contributed Talk 3b (original 3a)","url":"https://qcrypt.net/2025/sessions/contributed/3a/"},{"date":"2025-08-27","key":"stuff/lunch","start":"2025-08-27T12:35:00+08:00","tags":["lunch"],"title":"Lunch","url":"https://qcrypt.net/2025/sessions/stuff/lunch/"},{"chair":"Davide Rusca","date":"2025-08-27","format":"tutorial","key":"tutorial/Vallone","speakers":["Giuseppe Vallone"],"start":"2025-08-27T14:00:00+08:00","title":"Tutorial Talk: Advances in Quantum Random Number Generation","url":"https://qcrypt.net/2025/sessions/tutorial/vallone/","video":"https://youtu.be/MTYwfLCgfjQ"},{"date":"2025-08-27","format":"break","key":"stuff/break","start":"2025-08-27T15:15:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Feihu Xu","date":"2025-08-27","format":"invited","key":"invited/Li","speakers":["Yu-Huai Li"],"start":"2025-08-27T15:45:00+08:00","title":"Invited Talk: Microsatellite-based quantum key distribution and beyond","url":"https://qcrypt.net/2025/sessions/invited/li/","video":"https://youtu.be/9mjmOo-vjB8"},{"chair":"Feihu Xu","date":"2025-08-27","format":"invited","key":"invited/Seabrook","speakers":["Hannah Seabrook"],"start":"2025-08-27T16:30:00+08:00","title":"Invited Talk: Surpassing the loss-noise robustness trade-off in QKD","url":"https://qcrypt.net/2025/sessions/invited/seabrook/","video":"https://youtu.be/OVoEBmrReT4"},{"chair":"Feihu Xu","date":"2025-08-27","format":"contributed","key":"contributed/1a","papers":[{"abstract":"We demonstrate a practical high-performance mode-pairing quantum key distribution system that is able to surpass the repeaterless key rate bound using commercial lasers. We propose a frequency tracking scheme to address phase fluctuations and a theoretical model to analyze the phase noise and optimize the system parameters. Our system achieves a secret key rate of 47.8 bit/s over 403 km standard fiber, which is 2.92 times of the repeaterless bound. Furthermore, we compare the performance between MP-QKD and no-phase-locking TF-QKD under various practical conditions and show that MP-QKD exhibits superior performance at short distances with low error rates, while TF-QKD is more advantageous for long distances with consistent error rates.","authors":[{"affiliation":"University of Science and Technology of China","name":"Likang Zhang"},{"affiliation":"University of Science and Technology of China","name":"Wei Li"},{"affiliation":"University of Science and Technology of China","name":"Jiawei Pan"},{"affiliation":"University of Science and Technology of China","name":"Yichen Lu"},{"affiliation":"University of Science and Technology of China","name":"Wenwen Li"},{"affiliation":"University of Science and Technology of China","name":"Zheng-Ping Li"},{"affiliation":"Tsinghua University","name":"Yizhi Huang"},{"affiliation":"Tsinghua University","name":"Xiongfeng Ma"},{"affiliation":"University of Science and Technology of China","name":"Feihu Xu"},{"affiliation":"University of Science and Technology of China","name":"Jianwei Pan"}],"pid":29,"title":"Experimental mode-pairing quantum key distribution surpassing the repeaterless bound","video":"https://youtu.be/5mdyYuor0Do"},{"abstract":"Quantum key distribution (QKD) stands as the most successful application of quantum information\nscience, providing information-theoretic security for key exchange. While it has evolved from\nproof-of-concept experiments to commercial products, widespread adoption requires chip-based integration to reduce costs, enable mass production, facilitate miniaturization, and enhance system\nperformance. Here, we demonstrate the first fully photonic-integrated continuous-variable QKD\n(CVQKD) system operating at a classical telecom symbol rate of 16 GBaud. Our system integrates\na silicon photonic transmitter circuit (excluding the laser source) and a 20 GHz photonic-electronic\nreceiver, which features a phase-diverse silicon photonic integrated circuit and custom-designed\nGaAs pHEMT transimpedance amplifiers. Advanced digital signal processing allows our system to\nachieve the highest reported secure key rate to date, reaching 0.289 Gb/s and 0.246 Gb/s over a\n20 km fiber link in the asymptotic and finite-size regimes, respectively. These results establish a\nrecord key rate and represent a critical step toward scalable, cost-effective, and mass-deployable\nquantum-secure communication using photonic-integrated CVQKD systems.","authors":[{"affiliation":"Technical University of Denmark","name":"Adnan Hajomer"},{"affiliation":"Technical University of Denmark","name":"Ivan Derkach"},{"affiliation":"Technical University of Denmark","name":"Ulrik L. Andersen"},{"affiliation":"Ghent University-imec","name":"Axl Bomhals"},{"affiliation":"Ghent University-imec","name":"C´edric Bruynsteen"},{"affiliation":"Ghent University-imec","name":"Aboobackkar Sidhique"},{"affiliation":"Ghent University-imec","name":"Xin Yin"},{"affiliation":"Technical University of Denmark","name":"Tobias Gehring†"}],"pid":101,"title":"Chip-Based 16 GBaud Continuous-Variable Quantum Key Distribution (original 1b/2)","video":"https://youtu.be/b9m_WTFrXXg"}],"start":"2025-08-27T17:15:00+08:00","title":"Contributed Talk 3c (original 1a)","url":"https://qcrypt.net/2025/sessions/contributed/1a/"},{"date":"2025-08-27","key":"stuff/poster","start":"2025-08-27T17:55:00+08:00","tags":["poster"],"title":"Poster (Odd Number)","url":"https://qcrypt.net/2025/sessions/stuff/poster/"},{"date":"2025-08-27","key":"stuff/dinner","start":"2025-08-27T19:00:00+08:00","tags":["dinner"],"title":"Dinner","url":"https://qcrypt.net/2025/sessions/stuff/dinner/"}]},{"date":"2025-08-28","sessions":[{"chair":"Ian George","date":"2025-08-28","format":"tutorial","key":"tutorial/Speelman","speakers":["Florian Speelman"],"start":"2025-08-28T08:40:00+08:00","title":"Tutorial Talk: Quantum position verification: where are we now?","url":"https://qcrypt.net/2025/sessions/tutorial/speelman/","video":"https://youtu.be/EzEmNInUACU"},{"chair":"Ian George","date":"2025-08-28","format":"invited","key":"invited/Murta","speakers":["Gláucia Murta"],"start":"2025-08-28T09:55:00+08:00","title":"Invited Talk: Anonymous communication in quantum networks","url":"https://qcrypt.net/2025/sessions/invited/murta/","video":"https://youtu.be/wZqprfTs_nM"},{"date":"2025-08-28","format":"break","key":"stuff/break","start":"2025-08-28T10:40:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Kirill Fedorov","date":"2025-08-28","format":"invited","key":"invited/Nehoran","speakers":["Barak Nehoran"],"start":"2025-08-28T11:10:00+08:00","title":"Invited Talk: A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire","url":"https://qcrypt.net/2025/sessions/invited/nehoran/","video":"https://youtu.be/dNzOyUlGKpA"},{"chair":"Kirill Fedorov","date":"2025-08-28","format":"contributed","key":"contributed/4a","papers":[{"abstract":"Quantum sensors are powerful tools for measuring physical quantities with high sensitivity, enabling, for instance, the mapping of Earth’s gravitational field , detecting very small changes of magnetic fields, or the passage of time. The underlying principle is to use a quantum state as a probe that interacts with the physical quantity of interest, thereby encoding relevant information into the state. Although individual quantum sensors may exhibit remarkable sensitivity, the precision of a certain measurement can be significantly enhanced when multiple probes are entangled. Distributed quantum sensing extends this further and leverages entanglement among spatially separated sensors, allowing them to function as\na single, coherent system. This approach enables measurements across extended spatial regions, while surpassing the precision achievable by independent sensors. However, a significant challenge in a network setting is ensuring that sensors deployed across different parties serve as the necessary resources for the correct functioning of the target sensing task. This challenge has motivated the combination of quantum cryptography with quantum sensing. In this context, Shettell et al. introduced the notion of privacy for sensor networks, ensuring that, beyond the metrological advantage of cooperative estimation of a global function, parties can also maintain the privacy of their local information and control what data is accessible to others. In this work, we adopt this protocol and focus on a multi-user quantum\nsensor network framework to analyze the privacy aspects of this parameter estimation task, leveraging a high-quality four-party GHZ state source.","authors":[{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Nicolas Laurent-Puig"},{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Laura dos Santos Martins"},{"affiliation":"Instituto Superior Técnico, Universidade de Lisboa, Portugal","name":"Luis Bugalho"},{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Santiago Scheiner"},{"affiliation":"Instituut-Lorentz, Universiteit Leiden, P.O. Box 9506, 2300 RA Leiden, The Netherlands","name":"Majid Hassani"},{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Sean Moore"},{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Damian Markham"},{"affiliation":"Sorbonne Université, CNRS, LIP6","name":"Eleni Diamanti"}],"pid":97,"title":"Experimental Private Quantum Sensing","video":"https://youtu.be/KWt0n3g6xlU"},{"abstract":"We develop a flexible and robust framework for finite-size security proofs of quantum key distribution (QKD) protocols under coherent attacks, applicable to both fixed- and variable-length protocols. Our methods achieve high finite-size key rates across a broad class of protocols while imposing minimal requirements. In particular, it eliminates the need for restrictive assumptions such as limited repetition rates or the implementation of virtual tomography procedures. To achieve this goal, we introduce new numerical techniques for the evaluation of conditional sandwiched Renyi entropies, enabling tight key rate bounds without compromising generality. In doing so, we find an alternative formulation of the ``QKD cone'' studied in previous work, which may be of independent interest. Moreover, we illustrate the versatility of our framework by applying it to several practically relevant protocols, including decoy-state protocols. Furthermore, we extend the analysis to accommodate realistic device imperfections, such as independent intensity and phase imperfections. Overall, our framework provides both greater scope of applicability and better key rates than existing techniques, especially for small block sizes, offering a scalable path toward secure quantum communication under realistic conditions.","authors":[{"affiliation":"Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo","name":"Lars Kamin"},{"affiliation":"Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo","name":"John Burniston"},{"affiliation":"Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo","name":"Ernest Y.-Z. Tan"}],"pid":57,"title":"Renyi security framework against coherent attacks applied to decoy-state QKD (original 1c/4)","video":"https://youtu.be/pv1XlEsbmTg"}],"start":"2025-08-28T11:55:00+08:00","title":"Contributed Talk 4a","url":"https://qcrypt.net/2025/sessions/contributed/4a/"},{"date":"2025-08-28","key":"stuff/lunch","start":"2025-08-28T12:35:00+08:00","tags":["lunch"],"title":"Lunch","url":"https://qcrypt.net/2025/sessions/stuff/lunch/"},{"chair":"Charles Lim","date":"2025-08-28","format":"industry","key":"stuff/industry","speakers":["Haeseong Lee","Charles Lim","Gillian Makamara","Hao Qin","Qiang Zhang"],"start":"2025-08-28T14:00:00+08:00","tags":["industry"],"title":"Industry Panel","url":"https://qcrypt.net/2025/sessions/stuff/industry/","video":"https://youtu.be/tlMDH0YXRCA"},{"chair":"Devashish Tupkary","date":"2025-08-28","format":"contributed","key":"contributed/4c","papers":[{"abstract":"Recent work of Bostanci, Nehoran, Zhandry (STOC'25, QIP'25) formalized the notion of quantum fire: A quantum state that can be cloned efficiently but cannot be converted to a classical string. Nehoran and Zhandry (QIP'23) gave a construction of quantum fire relative to an (inefficient) unitary quantum oracle, and proved its correctness and security. Bostanci et al (STOC'25, QIP'25)  gave a candidate construction of quantum fire based on cryptographic group action assumptions, and proved its correctness. However, they do not have a proof of security, and the security is only conjectured without any justification at all.  In this work, we give the first construction of (public-key) quantum fire relative to a classical oracle, and prove its correctness and security.  This resolves the open question posed by  Bostanci et al (STOC'25, QIP'25) and Nehoran and Zhandry (QIP'23). Further, assuming existence of one-way functions, our scheme can also be made efficient. We note that, even in the unitary quantum oracle setting, no efficient quantum fire scheme existed: Nehoran-Zhandry show that their unitary oracle cannot be made efficient.\n\nImplications to Physics: In quantum mechanics, various fundamental principles called no-go properties exist, such as no-cloning theorem, no-hiding theorem, no-deleting theorem, no-telegraphing theorem and so on. Most of these no-go properties have been shown to be equivalent to each other. However, our result gives the first (classical oracle) separation between no-go properties of quantum mechanics! Our result means that, relative to a classical oracle, no-telegraphing does not imply no-cloning. Note that, in the information-theoretic setting, no-cloning and no-telegraphing are equivalent. Our result means that the equivalency of the fundamental no-go principles of quantum mechanics that we take for granted might not hold in a computational world!","authors":[{"affiliation":"Carnegie Mellon University","name":"Alper Cakan"},{"affiliation":"NTT Research","name":"Vipul Goyal"},{"affiliation":"NTT Research","name":"Omri Shmueli"}],"pid":127,"title":"Public-Key Quantum Fire From Classical Oracles","video":"https://youtu.be/YrvEx2u1ug0"},{"abstract":"The degree of experimentally attainable nonlocality, as gauged by the loophole-free or effective violation of Bell inequalities, remains severely limited due to inefficient detectors. We address an experimentally motivated question: Which quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors? For any Bell inequality and any specification of detection efficiencies, the optimal strategies are those that maximally violate a tilted version of the Bell inequality in ideal conditions. In the simplest scenario, we demonstrate that the quantum strategies that maximally violate the doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. We utilize Jordan's lemma and Grobner basis-based proof technique to analytically derive self-testing statements for the entire family of doubly-tilted CHSH inequalities and numerically demonstrate their robustness. These results enable us to reveal the insufficiency of even high levels of the Navascues-Pironio-Acin hierarchy to saturate the maximum quantum violation of these inequalities.","authors":[{"affiliation":"Universidad Nacional de La Plata","name":"Nicolas Gigena"},{"affiliation":"University of Gdansk","name":"Ekta Panwar"},{"affiliation":"Politecnico di Bari","name":"Giovanni Scala"},{"affiliation":"Universidad de Valladolid","name":"Mateus Araújo"},{"affiliation":"University of York","name":"Máté Farkas"},{"affiliation":"University of Gdansk","name":"Anubhav Chaturvedi"}],"pid":135,"title":"Self-testing tilted strategies for maximal loophole-free nonlocality (original 1c/2)","video":"https://youtu.be/WzqWm3uEhZY"}],"start":"2025-08-28T14:45:00+08:00","title":"Contributed Talk 4b","url":"https://qcrypt.net/2025/sessions/contributed/4c/"},{"date":"2025-08-28","format":"break","key":"stuff/break","start":"2025-08-28T15:25:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Christian Majenz","date":"2025-08-28","format":"contributed","key":"contributed/4b","papers":[{"abstract":"Recent studies have revealed critical source-side vulnerabilities in practical quantum key distribution systems. Despite their demonstrated risks, these threats receive limited attention in both academic discussions and practical implementations. To highlight the urgency of addressing source-side vulnerabilities, we will report two widespread but overlooked loopholes: the induced-photorefractive effect and the pattern effect, including a report of the first-time system-level attack against a running MDI-QKD. Except for the attack, we will also report countermeasures against the loopholes, including a fully-passive QKD architecture resistant to encoding side-channels and a correlation-immune QKD protocol mitigating the pattern effect. These works provide essential insights and solutions for advancing the practical deployment of secure QKD systems.","authors":[{"affiliation":"University of science and technology of China","name":"Feng-Yu Lu"},{"affiliation":"University of science and technology of China","name":"Jia-Xuan Li"},{"affiliation":"University of science and technology of China","name":"Ze-Hao Wang"},{"affiliation":"University of science and technology of China","name":"Shuang Wang"},{"affiliation":"University of science and technology of China","name":"Zhen-Qiang Yin"},{"affiliation":"University of science and technology of China","name":"De-Yong He"},{"affiliation":"University of science and technology of China","name":"Wei-Chen"},{"affiliation":"University of science and technology of China","name":"Zheng-Fu Han"},{"affiliation":"University of science and technology of China","name":"Guang-Can Guo"}],"pid":43,"title":"Implementation security of quantum key distribution transmitters","video":"https://youtu.be/o6EF7kDPZJw"},{"abstract":"Quantum key distribution (QKD) protocol has been proven to be informationally-theoretical security. Unfortunately, due to device imperfections in practice, QKD systems have exposed various vulnerabilities that are exploited by an eavesdropper to conduct quantum hackings, such as laser-seeding attacks, blinding attacks, etc. Most of these attacks currently remain only at the stage of possibility verification or white-box testing. In this paper, we propose and implemented plug-and-play attack on a QKD system as a black box, whose interface and access for the public are the only known information. Through this attack, we actively modified the gate positions and synchronization parameters of the QKD system during the calibration procedure, allowing the attack operate during the whole lifetime of the system running without being noticed. Furthermore, the implemented hacking system only connects to the quantum channel but has no access to the inside of QKD engine, which takes minutes to optimize the hacking parameters to start the eavesdropping. This work illustrates Eve's capability to successfully eavesdrop on keys from QKD systems under current conditions in a more intuitive and concrete way.","authors":[{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Anqi Huang"},{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Qingquan Peng"},{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Xialong Yuan"},{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Junxuan Liu"},{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Yichen Liu"},{"affiliation":"College of Computer Science and Technology, National University of Defense Technology","name":"Zihao Chen"},{"affiliation":"Russian Quantum Center, Skolkovo, Moscow 121205, Russia","name":"Vadim~Makarov"}],"pid":70,"title":"Plug-and-play attack on a quantum key distribution system as black box"},{"abstract":"In this work, we derive the first lifting theorems for establishing security in the quantum\nrandom permutation and ideal cipher models. These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.\nBy applying these lifting theorems, we improve previous results and obtain new quantum query complexity bounds and post-quantum security results. Notably, we derive tight bounds for the quantum hardness of the double-sided zero search game and establish the post-quantum security for the preimage resistance, one-wayness, and multi-collision resistance of constant-round sponge, as well as the collision resistance of the Davies-Meyer construction.","authors":[{"affiliation":"University of Edinburgh","name":"Alexandru Cojocaru"},{"affiliation":"The University of Texas at Austin","name":"Minki Hhan"},{"affiliation":"UC San Diego","name":"Qipeng Liu"},{"affiliation":"NTT Social Informatics Laboratories","name":"Takashi Yamakawa"},{"affiliation":"Ewha Womans University","name":"Aaram Yun"}],"pid":81,"title":"Quantum Lifting for Invertible Permutations and Ideal Ciphers","video":"https://youtu.be/J1XFuq2b__I"}],"start":"2025-08-28T15:50:00+08:00","title":"Contributed Talk 4c (original 4b)","url":"https://qcrypt.net/2025/sessions/contributed/4b/"},{"date":"2025-08-28","key":"stuff/award","start":"2025-08-28T16:50:00+08:00","tags":["award"],"title":"Awards and Business Meeting","url":"https://qcrypt.net/2025/sessions/stuff/award/"},{"date":"2025-08-28","key":"stuff/dinner","start":"2025-08-28T18:20:00+08:00","tags":["dinner"],"title":"Dinner","url":"https://qcrypt.net/2025/sessions/stuff/dinner/"},{"chair":"Marco Lucamarini","date":"2025-08-28","key":"lecture/Pan","speakers":["Jian-Wei Pan"],"start":"2025-08-28T19:30:00+08:00","title":"Public Lecture: Dream or Reality? Quantum Information Processing the Past, Present and Beyond","url":"https://qcrypt.net/2025/sessions/lecture/pan/","video":"https://youtu.be/r_ieFaI8BRw"}]},{"date":"2025-08-29","sessions":[{"chair":"Máté Farkas","date":"2025-08-29","format":"contributed","key":"contributed/5a","papers":[{"abstract":"In the recent breakthrough result (Mastel and Slofstra, STOC24), the authors show that there is a two-player one-round perfect zero-knowledge MIP* protocol for RE. We build on their result to show that there exists a succinct two-player one-round perfect zero-knowledge MIP* protocol for RE with polylog question size and O(1) answer size, or with O(1) question size and polylog answer size. To prove our result, we analyze the four central compression techniques underlying the MIP*=RE proof (Ji et al., arXiv:2001.04383) --- question reduction, oracularization, answer reduction, and parallel repetition --- and show that they all preserve the perfect (as well as statistical and computational) zero-knowledge properties of the original protocol. Furthermore, we complete the study of the conversion between constraint-constraint and constraint-variable binary constraint system (BCS) nonlocal games, which provide a quantum information characterization of MIP* protocols. While Paddock (arXiv:2203.02525) established that any near perfect strategy for a constraint-variable game can be mapped to a constraint-constraint version, we prove the converse, fully establishing their equivalence.","authors":[{"affiliation":"The University of Hong Kong","name":"Xingjian Zhang"},{"affiliation":"Concordia University","name":"Honghao Fu"}],"pid":69,"title":"Succinct Perfect Zero-knowledge for MIP*","video":"https://youtu.be/XT4LsZ6DAzU"},{"abstract":"Remote state preparation with verifiability (RSPV) is an important quantum cryptographic primitive [GV19,Zha22]. In this primitive, a client would like to prepare a quantum state (sampled or chosen from a state family) on the server side, such that ideally the client knows its full description, while the server holds and only holds the state itself. In this work we make several contributions on its formulations, constructions and applications. In more detail:\n\n- We first work on the definitions and abstract properties of the RSPV problem. We select and compare different variants of definitions [GV19,Zha22,GMP22], and study their basic properties (like composability and amplification).\n\n- We also study a closely related question of how to certify the server's operations (instead of solely the states). We introduce a new notion named *remote operator application with verifiability* (ROAV). We compare this notion with related existing definitions [SW87,MY04,MV21,NZ23], study its abstract properties and leave its concrete constructions for further works.\n\n- Building on the abstract properties and existing results [BGKPV], we construct a series of new RSPV protocols. Our constructions not only simplify existing results [GV19] but also cover new state families, for example, states in the form of $\\frac{1}{\\sqrt{2}}(\\ket{0}\\ket{x_0}+\\ket{1}\\ket{x_1})$. All these constructions rely only on the existence of weak NTCF [BKVV,AMR22], without additional requirements like the adaptive hardcore bit property [BCMVV,AMR22].\n\n- As a further application, we show that the classical verification of quantum computations (CVQC) problem [ABEM,Mah18] could be constructed from assumptions on group actions [ADMP20]. This is achieved by combining our results on RSPV with group-action-based instantiation of weak NTCF [AMR22], and then with the quantum-gadget-assisted quantum verification protocol [FKD18].","authors":[{"affiliation":"Zhongguancun Laboratory","name":"Jiayu Zhang"}],"pid":83,"title":"Formulations and Constructions of Remote State Preparation with Verifiability, with Applications","video":"https://youtu.be/S3mjOmiXMlE"},{"abstract":"High-dimensional (HD) entanglement promises both enhanced key rates and overcoming obstacles faced by modern-day quantum communication. However, modern convex optimization-based security arguments are limited by computational constraints; thus, accessible dimensions are far exceeded by progress in HD photonics, bringing forth a need for efficient methods to compute key rates for large encoding dimensions. In response to this problem, we present a flexible analytic framework facilitated by the dual of a semi-definite program and diagonalizing operators inspired by entanglement-witness theory, enabling the efficient computation of key rates in high-dimensional systems. To facilitate the latter, we show how matrix completion techniques can be incorporated to effectively yield improved, computable bounds on the key rate in paradigmatic high-dimensional systems of time- or frequency-bin entangled photons and beyond, revealing the potential for very high dimensions to surpass low dimensional protocols already with existing technology. In our accompanying work, we show how our findings can be used to establish finite-size security against coherent attacks for general HD-QKD protocols both in the fixed- and variable-length scenario and we examine the performance under realistic conditions. Detailed manuscripts for Refs. [1] and [2] can be found attached.","authors":[{"affiliation":"Technische Universität Wien","name":"Florian Kanitschar"},{"affiliation":"Technische Universität Wien","name":"Marcus Huber"}],"pid":45,"title":"A Framework for the Security Analysis of Practical High-Dimensional QKD Setups (Remote)","video":"https://youtu.be/SwBd4m0_nSY"},{"abstract":"We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched R\\'{e}nyi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R\\'{e}nyi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced security proof technique that was developed to analyze prepare-and-measure QKD with no limitations on the repetition rate. In particular, our generalization yields ``fully adaptive'' protocols that can in principle update the entropy estimation procedure during the protocol itself, similar to the quantum probability estimation framework.","authors":[{"affiliation":"Institute for Quantum Computing, University of Waterloo","name":"Amir Arqand"},{"affiliation":"Institute for Quantum Computing, University of Waterloo","name":"Ernest Y.-Z. Tan"}],"pid":62,"title":"Marginal-constrained entropy accumulation theorem (Remote)","video":"https://youtu.be/F8D90pyUOg0"},{"abstract":"Asynchronous measurement-device-independent quantum key distribution (AMDI-QKD) stands out for its experimental simplicity and high key rate generation. To simplify the system further, we devise a post-measurement compensation scheme to accurately estimate the mutual frequency offset between two compact lasers using just the announced quantum-signal detection results, thereby obviating the need for optical reference light. As a result, we demonstrate an AMDI-QKD system operating at 2.5 GHz and achieving secure key rates (SKRs) of 537 and 101 kbit/s at distances of 100 and 201 km, respectively. By leveraging ultra-stable lasers, we achieve the highest SKRs with measurement-device-independent security within the 100 to 400 km range.","authors":[{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Shanfeng Shao"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Jinping Lin"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Chengfang Ge"},{"affiliation":"Cyprus University of Technology","name":"Mariella Minder"},{"affiliation":"Nanjing University","name":"Yuan-Mei Xie"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Ao Shen"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Zhengyu Yan"},{"affiliation":"Renmin University of China","name":"Hua-Lei Yin"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Lai Zhou"},{"affiliation":"Beijing Academy of Quantum Information Sciences","name":"Zhiliang Yuan"}],"pid":26,"title":"High-Rate Asynchronous Measurement-Device-Independent Quantum Communication without Optical Reference Light (original 1b/1)","video":"https://youtu.be/lZlPoEpRLF0"},{"abstract":"Quantum key distribution (QKD) enables information-theoretically secure communication, even in the era of quantum information. In all QKD systems, clock synchronization between two remote users---commonly referred to as Alice and Bob---is a fundamental requirement. This is typically achieved by transmitting an additional reference clock signal from Alice to Bob. In such a scheme, additional synchronization devices are required, increasing system complexity and introducing external noise. To address these issues, a novel synchronization technology, called the qubit-based synchronization method, was proposed. This method directly synchronizes two users using quantum signals, thereby dramatically reducing system complexity. However, previous qubit-based synchronization methods are not applicable to time-bin phase-encoding QKD systems, as multiple time slides introduce disturbances to time recovery. In this paper, we propose a machine-learning-enhanced qubit-based synchronization method. By introducing a K-nearest neighbor model, this method can efficiently classify each time slide in time-bin phase-encoding QKD, thereby enabling successful time recovery. We demonstrate our method using a time-bin phase-encoding reference-frame-independent (RFI)-QKD and successfully distribute secure key bits over up to 200 km of fiber spools. Our work simplifies the complexity of QKD system and significantly advances the practical application of QKD.","authors":[{"affiliation":"School of Electronics and Communication Engineering, Sun Yat-Sen University, Shenzhen 518107, China","name":"Ye Chen"},{"affiliation":"Tian","name":"Zhiyu"},{"affiliation":"Fan","name":"Xiaodong"},{"affiliation":"Xie","name":"Ziran"},{"affiliation":"Sun","name":"Shihai"}],"pid":71,"title":"Reference-frame-independent quantum key distribution based on machine-learning-enhanced qubit-based synchronization (original 1b/4)","video":"https://youtu.be/CEKLHaSKnTs"}],"start":"2025-08-29T08:40:00+08:00","title":"Contributed Talk 5a","url":"https://qcrypt.net/2025/sessions/contributed/5a/"},{"date":"2025-08-29","format":"break","key":"stuff/break","start":"2025-08-29T10:40:00+08:00","tags":["break"],"title":"Coffee Break","url":"https://qcrypt.net/2025/sessions/stuff/break/"},{"chair":"Yang Liu","date":"2025-08-29","format":"contributed","key":"contributed/5b","papers":[{"abstract":"Continuous-variable quantum key distribution (CVQKD) can allow remote users to share high-rate and unconditionally secure secret keys with capabilities of well compatibility with classical optical communication networks and effective resistance against background noise. We overcome the excess noise due to atmospheric effects especially in daylight without extra wavelength conversion and spectral filtering, and demonstrate for the first time all-day free-space quantum key distribution over 7 km in an urban atmosphere and 9.6 km in a marine atmosphere with Gaussian-modulated continuous variables. This achieved distribution distance of secure quantum secret keys is well beyond the effective thickness of the aerosphere, hence presenting a possible alternative way for realizing satellite-based quantum cryptography communication in daylight. Moreover, given that the CVQKD system is naturally compatible with existing ground fibre telecommunication networks, it marks an essential step for realizing integrated air-ground quantum access networks with cross-domain applications.","authors":[{"affiliation":"State Key Laboratory of Photonics and Communications, Institute for Quantum Sensing and Information Processing, Shanghai Jiao Tong University, Shanghai 200240, China","name":"Tianxiang Zhan"},{"affiliation":"State Key Laboratory of Photonics and Communications, Institute for Quantum Sensing and Information Processing, Shanghai Jiao Tong University, Shanghai 200240, China","name":"Peng Huang"}],"pid":18,"title":"All-day free-space quantum key distribution with continuous variables","video":"https://youtu.be/an97oAcWw0I"},{"abstract":"How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we study the classical cryptographic problem that two parties would like to perform secure computations *with long outputs*. As a basic primitive and example, we first consider the following problem which we call *secure function sampling* with long outputs: suppose $f:\\{0,1\\}^n\\rightarrow \\{0,1\\}^m$ is a public, efficient classical function, where $m$ is big; Alice would like to sample $x$ from its domain and sends $f(x)$ to Bob; what Bob knows should be no more than $f(x)$ even if it behaves maliciously. Classical cryptography, like FHE and succinct arguments [Gen09,Kil92,HW15], allows us to achieve this task within communication complexity $O(n+m)$; could we achieve this task with communication complexity independent of $m$?\n\nIn this work, we first design a quantum cryptographic protocol that achieves secure function sampling with approximate security, within $O(n)$ communication (omitting the dependency on the security parameter and error tolerance). We also prove the classical impossibility using techniques in [HW15], which means that our protocol indeed achieves a type of quantum advantage. Building on the secure function sampling protocol, we further construct protocols for general secure two-party computations [Yao86,GB01] with approximate security, with communication complexity only depending on the input length and the targeted security. In terms of the assumptions, we construct protocols for these problems assuming only the existence of collapsing hash functions [Unr16]; what's more, we also construct a classical-channel protocol for these problems additionally assuming the existence of noisy trapdoor claw-free functions [BCMVV,BKVV]","authors":[{"affiliation":"Zhongguancun Laboratory","name":"Jiayu Zhang"}],"pid":52,"title":"A Quantum Approach For Reducing Communications in Classical Secure Computations with Long Outputs","video":"https://youtu.be/rJ4Oz1eC20g"},{"abstract":"We give novel and tighter lifting theorems for security games in the quantum random oracle model (QROM), as well as in Noisy Intermediate-Scale Quantum (NISQ) settings such as the hybrid query model, the noisy oracle and the bounded-depth models. At the core of our main results lies a novel measure-and-reprogram framework that we call coherent reprogramming.\nThis framework gives a tighter lifting theorem for query complexity problems.\nSecondly, we provide, for the first time, a hybrid lifting theorem for hybrid algorithms that can perform both quantum and classical queries, as well as a lifting theorem for quantum algorithms with access to noisy oracles or bounded quantum depth. At the core of these results lies a novel measure-and-reprogram framework, called hybrid coherent measure-and-reprogramming, tailored specifically for hybrid algorithms.\nEquipped with both lifting theorems, we are able to prove directly both quantum and NISQ security and complexity results by calculating a single combinatorial quantity, relying solely on classical reasoning.\nCrucially, we derive the first direct product theorems in the average case, both in the quantum and the hybrid settings— i.e., an enabling tool to determine the hardness of solving multi-instance security games. This allows us to derive in a straightforward manner the hardness of various security games, for example (i) the non-uniform hardness of salted games, (ii) the hardness of specific cryptographic tasks such as the multiple instance version of one-wayness and collision-resistance, and (iii) uniform or non-uniform hardness of many other games.","authors":[{"affiliation":"University of Edinburgh","name":"Alexandru Cojocaru"},{"affiliation":"Texas A\u0026M University","name":"Juan Garay"},{"affiliation":"UC San Diego","name":"Qipeng Liu"},{"affiliation":"Portland State University","name":"Fang Song"}],"pid":24,"title":"NISQ Security and Complexity via Simple Classical Reasoning","video":"https://youtu.be/aBT1-tPQN9U"},{"abstract":"We show how to construct simulation secure one-time memories, and thus one-time programs, without computational assumptions in the presence of constraints on quantum hardware. Specifically, we build one-time memories from random linear codes and quantum random access codes (QRACs) when constrained to non-adaptive, constant depth, and D-dimensional geometrically-local quantum circuit for some constant D. We place no restrictions on the adversary's classical computational power, number of qubits it can use, or the coherence time of its qubits. Notably, our construction can still be secure even in the presence of fault tolerant quantum computation as long as the input qubits are encoded in a non-fault tolerant manner (e.g. encoded as high energy states in non-ideal hardware). Unfortunately though, our construction requires decoding random linear codes and thus does not run in polynomial time. We leave open the question of whether one can construct a polynomial time information theoretically secure one-time memory from geometrically local quantum circuits.\nOf potentially independent interest, we develop a progress bound for information leakage via collision entropy (Rényi entropy of order 2) along with a few key technical lemmas for a \"mutual information\" for collision entropies. We also develop new bounds on how much information a specific $2 \\mapsto 1$ QRAC can leak about its input, which may be of independent interest as well.","authors":[{"affiliation":"University of Maryland, QuICS","name":"Lev Stambler"}],"pid":60,"title":"Information Theoretic One-Time Programs from Geometrically Local QNC0 Adversaries","video":"https://youtu.be/aARmbJdB25I"},{"abstract":"We present a robust and composable device-independent (DI) quantum protocol between\ntwo parties for oblivious transfer (OT) using Magic Square devices in the bounded storage\nmodel [DFR`07, DFSS08] in which the (honest and cheating) devices and parties have no long-\nterm quantum memory. After a fixed constant (real-world) time interval, referred to as DELAY,\nthe quantum states decohere completely. The adversary (cheating party), with full control over\nthe devices, is allowed joint (non-IID) quantum operations on the devices, and there are no time\nand space complexity bounds placed on its powers. The running time of the honest parties is\npolylog(λ) (where λ is the security parameter). Our protocol has negligible (in λ) correctness\nand security errors and can be implemented in the NISQ (Noisy Intermediate Scale Quantum)\nera. By robustness, we mean that our protocol is correct even when devices are slightly off\n(by a small constant) from their ideal specification. This is an important property since small\nmanufacturing errors in the real-world devices are inevitable. Our protocol is sequentially\ncomposable and, hence, can be used as a building block to construct larger protocols (including\nDI bit-commitment and DI secure multi-party computation) while still preserving correctness\nand security guarantees.\nNone of the known DI protocols for OT in the literature are robust and secure against joint\nquantum attacks. This was a major open question in device-independent two-party distrustful\ncryptography, which we resolve.\nWe prove a parallel repetition theorem for a certain class of entangled games with a hybrid\n(quantum-classical) strategy to show the security of our protocol. The hybrid strategy helps to\nincorporate DELAY in our protocol. This parallel repetition theorem is a main technical contribution of our work. Since our games use hybrid strategies and the inputs to our games are not independent, we use a novel combination of ideas from previous works showing parallel rep-\netition of classical games [Raz95, Hol07], quantum games [JPY14, JMS20, JK22], and anchored\ngames [BVY17, JK21].\nAlthough we present security proof for protocols in the bounded storage model with no\nlong-term quantum memory (after DELAY), we state (without further justification) that we\ncan extend our results, along the lines of [JK22] and [DFR`07], to incorporate linear (in the\nnumber of devices) long term quantum memory and linear leakage between the devices.","authors":[{"affiliation":"CQT, NUS","name":"Rishabh Batra"},{"affiliation":"University of Montreal","name":"Sayantan Chakraborty"},{"affiliation":"CQT, NUS","name":"Rahul Jain"},{"affiliation":"University of Ottawa","name":"Upendra Kapshikar"}],"pid":123,"title":"A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model","video":"https://youtu.be/d3ahJusi4rc"}],"start":"2025-08-29T11:00:00+08:00","title":"Contributed Talk 5b","url":"https://qcrypt.net/2025/sessions/contributed/5b/"},{"date":"2025-08-29","key":"stuff/closing","start":"2025-08-29T12:40:00+08:00","tags":["closing"],"title":"Closing Remark","url":"https://qcrypt.net/2025/sessions/stuff/closing/"},{"date":"2025-08-29","key":"stuff/lunch","start":"2025-08-29T12:50:00+08:00","tags":["lunch"],"title":"Lunch","url":"https://qcrypt.net/2025/sessions/stuff/lunch/"}]}],"papers":"https://qcrypt.net/2025/schedule/papers.json","schedulePage":"https://qcrypt.net/2025/schedule/","timezone":"Asia/Shanghai"}