4 papers
On the Concurrent Composition of Quantum Zero-Knowledge
Prabhanjan Ananth, Kai-Min Chung, Rolando L. La Placa
We study the notion of zero-knowledge secure against quantum polynomial-time verifiers (referred to as quantum zero-knowledge) in the concurrent composition setting. Despite being…
Secure Software Leasing
Prabhanjan Ananth, Rolando L. La Placa
Formulating cryptographic definitions to protect against software piracy is an important research direction that has not received much attention. Since natural definitions using cl…
Secure Quantum Extraction Protocols
Prabhanjan Ananth, Rolando L. La Placa
Knowledge extraction, typically studied in the classical setting, is at the heart of several cryptographic protocols. We introduce the notion of secure quantum extraction protocols…
How many qubits are needed for quantum computational supremacy?
Alexander M. Dalzell, Aram W. Harrow, Dax Enshan Koh +1
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some so…