6533b82afe1ef96bd128b6e9

RESEARCH PRODUCT

Quantum Security Proofs Using Semi-classical Oracles

Andris AmbainisDominique UnruhMike Hamburg

subject

Provable securityFlexibility (engineering)Post-quantum cryptographyTheoretical computer scienceComputer sciencebusiness.industry0102 computer and information sciences02 engineering and technologyMathematical proofEncryption01 natural sciencesPublic-key cryptographyUnruh effect010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringParallelism (grammar)020201 artificial intelligence & image processingbusiness

description

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.

yearjournalcountryeditionlanguage
2019-01-01
https://doi.org/10.1007/978-3-030-26951-7_10