CryptoDB
On the Efficiency of Generic, Quantum Cryptographic Constructions
NOTE: imports for ToSC and TCHES are no longer functioning.
Authors: |
|
---|---|
Download: | |
Abstract: | One of the central questions in cryptology is how efficient generic constructions of cryptographic primitives can be. Gennaro, Gertner, Katz, and Trevisan [SIAM J. of Compt., 2005] studied the lower bounds of the number of invocations of a (trapdoor) one-way permutation in order to construct cryptographic schemes, e.g., pseudorandom number generators, digital signatures, and public-key and symmetric-key encryption. Recently, quantum machines have been explored to _construct_ cryptographic primitives other than quantum key distribution. This paper studies the efficiency of _quantum_ black-box constructions of cryptographic primitives when the communications are _classical_. Following Gennaro et al., we give the lower bounds of the number of invocations of an underlying quantumly-computable quantum-one-way permutation when the _quantum_ construction of pseudorandom number generator and symmetric-key encryption is weakly black-box. Our results show that the quantum black-box constructions of pseudorandom number generator and symmetric-key encryption do not improve the number of invocations of an underlying quantumly-computable quantum-one-way permutation. |
BibTeX
@article{cic-2024-34099, title={On the Efficiency of Generic, Quantum Cryptographic Constructions}, journal={cic}, publisher={International Association for Cryptologic Research}, volume={1, Issue 1}, url={https://cic.iacr.org//p/1/1/8}, doi={10.62056/a66c0l5vt}, author={Keita Xagawa}, year=2024 }