10:45
11:45

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncloneable encryption has remained elusive. A candidate for the unconditional unclonable bit problem, based on Clifford algebra, will be presented and strong evidence for the security of unclonable indistinguishability will be provided.

https://combalgo.labri.fr/pmwiki.php/Groupe/Info-Quantique

Room 178