On the Computational Hardness Needed for Quantum Cryptography

Explore the computational foundations of quantum cryptography in this 48-minute lecture by Ran Canetti from Boston University. Delve into the concept of EFI pairs (efficiently samplable, statistically far, and computationally indistinguishable pairs of quantum states) and their pivotal role in quantum cryptography. Examine how EFI pairs serve as a potential minimal primitive for various quantum cryptographic applications, drawing parallels to the role of one-way functions in classical cryptography. Investigate the construction of EFI pairs from minimalistic versions of commitment schemes, oblivious transfer, and secure multiparty computation, as well as from QCZK proofs. Learn about the reciprocal relationship between EFI pairs and quantum computational zero-knowledge proofs for QIP. Gain insights into the ongoing research on minimal complexity assumptions in quantum cryptography and their implications for the field's future development.

On the Computational Hardness Needed for Quantum Cryptography