Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Goldin, Eli"'
We construct a quantum oracle relative to which BQP = QCMA but quantum-computation-classical-communication (QCCC) key exchange, QCCC commitments, and two-round quantum key distribution exist. We also construct an oracle relative to which BQP = QMA, b
Externí odkaz:
http://arxiv.org/abs/2410.14792
We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribution of binary strings over which it is hard to approximate Kolmogorov
Externí odkaz:
http://arxiv.org/abs/2410.04984
Recent work has introduced the "Quantum-Computation Classical-Communication" (QCCC) (Chung et. al.) setting for cryptography. There has been some evidence that One Way Puzzles (OWPuzz) are the natural central cryptographic primitive for this setting
Externí odkaz:
http://arxiv.org/abs/2402.17715
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent computati
Externí odkaz:
http://arxiv.org/abs/2312.08363
