On The Round Complexity of Secure Quantum Computation

v1v2v3 (latest)

On The Round Complexity of Secure Quantum Computation

23 November 2020

Andrea Coladangelo

Dakshita Khurana

ArXiv (abs)PDF HTML

Papers citing "On The Round Complexity of Secure Quantum Computation"

9 / 9 papers shown

Title
Cryptomania v.s. Minicrypt in a Quantum World Longcheng Li Qian Li X. Li Qipeng Liu 158 1 0 08 Apr 2025
How (not) to Build Quantum PKE in Minicrypt Longcheng Li Qian Li X. Li Qipeng Liu 88 2 0 30 May 2024
Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions Samuel Bouaziz--Ermann A. Grilo Damien Vergnaud Q. Vu 135 3 0 06 Nov 2023
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge) James Bartusek Dakshita Khurana Akshayaram Srinivasan 55 5 0 20 Apr 2023
Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority Theodoros Kapourniotis E. Kashefi D. Leichtle Luka Music Harold Ollivier 18 9 0 15 Mar 2023
Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort Kai-Min Chung M. Huang Eric Tang Jiapeng Zhang 54 1 0 03 Nov 2022
Certified Everlasting Zero-Knowledge Proof for QMA Taiga Hiroka T. Morimae Ryo Nishimaki Takashi Yamakawa 73 14 0 29 Sep 2021
Classically Verifiable NIZK for QMA with Preprocessing T. Morimae Takashi Yamakawa 41 4 0 18 Feb 2021
Quantum Garbled Circuits Zvika Brakerski Henry Yuen 74 23 0 01 Jun 2020