The following pages link to (Q4736850):
Displaying 17 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- From golden to unimodular cryptography (Q1694553) (← links)
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions (Q2100831) (← links)
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- Quantum algorithms for the Goldreich-Levin learning problem (Q2684273) (← links)
- Classical binding for quantum commitments (Q2695637) (← links)
- Computational Security of Quantum Encryption (Q2953808) (← links)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP (Q6157505) (← links)
- Constructive post-quantum reductions (Q6163970) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
- Revocable cryptography from learning with errors (Q6587947) (← links)
- A modular approach to unclonable cryptography (Q6652999) (← links)
- Zero-knowledge proof systems for QMA (Q6663093) (← links)
