Provable security and the quantum random oracle model
Speaker: Kathrin Hövelmanns
Abstract: The aim of provable security is to reduce the risk that cryptographic designers need to find ad-hoc improvements for their designs due to emerging attacks. Although this risk might never be fully ruled out, provable security can serve as a tool to identify potential breaking points.
Many important proof techniques used in the are of provable security, however, did not originally consider attackers that are able to run quantum attacks, with an important example being random oracle techniques. To be able to reason about post-quantum security, it is necessary to adapt the provable security toolkit. In this session, I will give a short introduction into security proofs and the random oracle model, including examples related to NIST's post-quantum standardisation effort, and give examples how pre-quantum reasoning can be adapted such that it still works even if quantum attackers are added to the picture.