International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Quantum Security Proofs Using Semi-classical Oracles

Authors:
Andris Ambainis
Mike Hamburg
Dominique Unruh
Download:
DOI: 10.1007/978-3-030-26951-7_10
Search ePrint
Search Google
Abstract: We present an improved version of the one-way to hiding (O2H) Theorem by Unruh, J ACM 2015. Our new O2H Theorem gives higher flexibility (arbitrary joint distributions of oracles and inputs, multiple reprogrammed points) as well as tighter bounds (removing square-root factors, taking parallelism into account). The improved O2H Theorem makes use of a new variant of quantum oracles, semi-classical oracles, where queries are partially measured. The new O2H Theorem allows us to get better security bounds in several public-key encryption schemes.
Video from CRYPTO 2019
Video provided under Creative Commons / CC BY 3.0
BibTeX
@article{crypto-2019-29889,
  title={Quantum Security Proofs Using Semi-classical Oracles},
  booktitle={Advances in Cryptology – CRYPTO 2019},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={11693},
  pages={269-295},
  doi={10.1007/978-3-030-26951-7_10},
  author={Andris Ambainis and Mike Hamburg and Dominique Unruh},
  year=2019
}