Program

9:00 - 9:05 Opening remarks

9:05 - 9:50 Invited talk

- Quantum Copy Protection and Unclonable Cryptography
Jiahui Liu (remote)

9:50 - 10:20 Contributed talk

- Beating Classical Impossibility of Position Verification
Jiahui Liu, Qipeng Liu and Luowen Qian (remote)
- On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti and Luowen Qian (remote)

10:20 - 10:45 Break

10:45 - 12:00 Contributed talk

- Quantum Advice in the Quantum Random Oracle Model
Qipeng Liu (remote)
- Quantum Proofs of Deletion for Learning with Errors
Alexander Poremba (remote)
- A Note on Copy-Protection from Random Oracles
Fatih Kaleoglu and Prabhanjan Ananth (remote)
- Proofs of Quantumness from Trapdoor Permutations
Tomoyuki Morimae and Takashi Yamakawa (in person)
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Minki Hhan, Tomoyuki Morimae and Takashi Yamakawa (in person)

12:00 - 13:30 Lunch break

13:30 - 14:15 Invited talk

- How to Provably Delete Information
James Bartusek (in person)

14:15 - 15:00 Contributed talk

- Quantum Commitments and Signatures without One-Way Functions
Tomoyuki Morimae and Takashi Yamakawa (remote)
- Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more
Alexandru Gheorghiu, Tony Metger and Alexander Poremba (remote)
- On the necessity of collapsing
Marcel Dall'Agnol and Nicholas Spooner (remote)

15:00 - 15:25 Break

15:25 - 16:25 Tutorial talk

- Information Theory Tools in Quantum Cryptography
Alex Grilo (remote)