(Post-Quantum) Cryptography
Collection
Talk Type
Subject
Abstract
In this talk, I will discuss two important cryptographic tasks in a post-quantum world. I will discuss the impossibility of bit-commitment and the possibility of physically unforgeable money in the framework of Generalized Probabilistic Theories. Our proofs rely crucially on cone programming, a natural generalization of semidefinite programming. This is based on work with John Selby, arXiv:1803.10279 and arXiv:1711.02662.