There is a list of resources provided below to give some ideas on topics of interest in quantum cryptography. An online course in quantum cryptography is also listed for those who wish to have some additional background.

You can access the spring 2019 website for the quantum cryptography reading group here.

Date | Speaker | Topic | Reading | |||
---|---|---|---|---|---|---|

February 12th | Yusuf Alnawakhtha | Offline Simon's Algorithm | "Quantum Attacks without Superposition Queries: The Offline Simon's Algorithm" |
|||

February 26th | Carl Miller |
The Fiat-Shamir Transformation in the Quantum Random Oracle Model |
"Security of the Fiat-Shamir Transformation in the Quantum Random Oracle Model" |
|||

Shih-Han Hung | Two Message Verification of Quantum Computation |
"Two Message Verification of Quantum Computation" |
||||

April 1st | Nishant Rodrigues | Device Independent QKD | "Fully Device Independent Quantum Key Distribution" |
|||

April 9th | Atul Mantri | Abstract Cryptography and Delegated Quantum Computation | "Abstract Cryptography" "Composable Security of Delegated Quantum Computation" "Computationally-Secure and Composable Remote State Preparation" |
|||

April 15th | Hong Hao Fu | Zero Knowledge Protocols | "Zero-Knowledge Against Quantum Attacks" |

We achieve this by upgrading the verification protocol of Mahadev in two steps. First, the protocol is repeated many times in parallel, yielding a four-message protocol with negligible soundness error. This enables the second step: the "challenge round" is eliminated via the Fiat-Shamir transform, in which the prover computes their own challenges using a public hash function.

We show that this protocol is secure under the same assumptions underlying many candidate schemes for post-quantum public-key cryptography. Specifically, it is secure in the Quantum Random Oracle Model, and assuming the quantum hardness of the Learning with Errors problem. The main technical advance in our security proof is a parallel repetition theorem for the Mahadev protocol.

In the second part, I will provide a proof sketch of the composable security of quantum cryptographic protocols such as delegated quantum computation and secure remote state preparation using the framework of abstract cryptography.

- A. Broadbent, C. Schaffner. "Quantum Cryptography Beyond Quantum Key Distribution"
- S. Wehner, D. Elkouss, R. Hanson. "Quantum internet: A vision for the road ahead"
**Online Course:**Quantum Cryptography by T. Vidick, S. Wehner