<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tutorial on QCrypt Conference Website</title><link>https://qcrypt.net/tags/tutorial/</link><description>Recent content in Tutorial on QCrypt Conference Website</description><generator>Hugo</generator><language>en</language><atom:link href="https://qcrypt.net/tags/tutorial/index.xml" rel="self" type="application/rss+xml"/><item><title>Tutorial Talk: Continuous-Variable Quantum Key Distribution</title><link>https://qcrypt.net/2026/sessions/tutorial/gehring/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://qcrypt.net/2026/sessions/tutorial/gehring/</guid><description>&lt;h2 id="biography"&gt;Biography&lt;/h2&gt;&#10;&lt;p&gt;Tobias Gehring is CSO at Celare Quantum Communications, a quantum key distribution vendor, and at Alea Quantum Technologies, a company making quantum random number generators. He is also an Associate Professor at the Technical University of Denmark (DTU) where he researches continuous-variable quantum key distribution and quantum random number generation. The two companies are spin-off companies of DTU. Tobias received his PhD in Physics from University of Hannover, Germany, in 2013 after which he became postdoctoral researcher at DTU, and eventually Associate Professor. He has made several seminal contributions to the field of quantum cryptography and led the Danish effort in the European Quantum Communication Infrastructure initiative.&lt;/p&gt;</description></item><item><title>Tutorial Talk: Quantum cryptography beyond QKD: advances and practical challenges</title><link>https://qcrypt.net/2026/sessions/tutorial/bozzio/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://qcrypt.net/2026/sessions/tutorial/bozzio/</guid><description>&lt;h2 id="biography"&gt;Biography&lt;/h2&gt;&#10;&lt;p&gt;Mathieu Bozzio is a Senior Scientist / Lecturer within the University of Vienna’s &amp;ldquo;Quantum Information Science and Quantum Computation” group. His research interests include the design of quantum-cryptographic primitives beyond QKD, the study of practical quantum advantage and the search for new physical security assumptions. Before that, he completed a physics degree at Imperial College London and a PhD in quantum cryptography at Université Paris-Saclay.&lt;/p&gt;&#10;&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;&#10;&lt;p&gt;Owing to its fundamental principles, quantum theory holds the promise to enhance the security of modern cryptography, from key exchange to digital signatures, anonymous communication, leader election, online banking and delegated computation. While quantum key distribution (QKD) has already enabled secure key exchange over hundreds of kilometers, a myriad of other quantum-cryptographic primitives are being developed to secure future applications against quantum adversaries. This tutorial will provide an introduction to the main quantum primitives and their classification (according to security levels), summarize their possibilities and limits, and discuss practical challenges related to their photonic security and experimental realizations.&lt;/p&gt;</description></item><item><title>Tutorial Talk: Security Proofs for Quantum Key Distribution</title><link>https://qcrypt.net/2026/sessions/tutorial/wolf/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://qcrypt.net/2026/sessions/tutorial/wolf/</guid><description>&lt;h2 id="biography"&gt;Biography&lt;/h2&gt;&#10;&lt;p&gt;Ramona Wolf is an Assistant Professor in the Department of Theoretical Physics at the University of Innsbruck. Previously, she held a Junior Professorship at the University of Siegen and was a postdoctoral researcher at ETH Zurich with Renato Renner. Her research focuses on the security of quantum cryptographic protocols, in particular quantum key distribution and randomness generation, and their links to the foundations of quantum theory.&lt;/p&gt;&#10;&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;&#10;&lt;p&gt;Throughout history, cryptography has been caught in a vicious circle: Cryptographers keep inventing new methods to hide information, which in turn are broken by cryptanalysts, prompting cryptographers to devise even more sophisticated encryption methods, and so on. Quantum key distribution offers a way to break this circle by enabling information-theoretic secure encryption based (almost) solely on the laws of physics. Nonetheless, caution is still advised: Even these protocols can only break the vicious circle if they come with a complete security proof against all possible attacks. In this tutorial, I will introduce the principles underlying modern security proofs for QKD, including the assumptions on which they rely, discuss key techniques such as finite-key analysis, and survey recent advances to highlight both progress and remaining challenges.&lt;/p&gt;</description></item><item><title>Tutorial Talk: Self-testing in quantum cryptography</title><link>https://qcrypt.net/2026/sessions/tutorial/supic/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://qcrypt.net/2026/sessions/tutorial/supic/</guid><description>&lt;h2 id="biography"&gt;Biography&lt;/h2&gt;&#10;&lt;p&gt;Ivan Šupić is a CNRS researcher at the University Grenoble Alpes. Previously, he held a postdoctoral position at Sorbonne University (LIP6) and at the University of Geneva, and completed his PhD at ICFO Barcelona. His research focuses on the certification of quantum resources, in particular self-testing and device-independent quantum information processing, as well as their connections to quantum cryptography and quantum foundations.&lt;/p&gt;&#10;&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;&#10;&lt;p&gt;How much can we learn about a quantum system by only looking at its measurement statistics, without making any assumptions about its inner workings? Self-testing provides a striking answer: in certain scenarios, the observed correlations alone are enough to completely determine the underlying quantum state and measurements, up to local isometries. Born in quantum cryptography through the pioneering work of Mayers and Yao, who showed that the security of certain protocols could be guaranteed even with completely untrusted devices, self-testing has since grown into one of the most versatile tools in quantum information theory. It is closely connected to the theoretical foundations of device-independent quantum key distribution and randomness generation, and has found remarkable applications in theoretical computer science: from delegated quantum computation and proofs of quantumness to various quantum complexity results, including the landmark MIP*=RE theorem. In this tutorial, I will introduce the concept of self-testing from the ground up, take a guided tour through its most important applications, from its cryptographic origins to its far-reaching implications in computer science, and then unpack the main techniques used to prove self-testing results.&lt;/p&gt;</description></item></channel></rss>