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.
CITATION STYLE
Ambainis, A., Hamburg, M., & Unruh, D. (2019). Quantum Security Proofs Using Semi-classical Oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11693 LNCS, pp. 269–295). Springer Verlag. https://doi.org/10.1007/978-3-030-26951-7_10
Mendeley helps you to discover research relevant for your work.