ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2011.11212
  4. Cited By
On The Round Complexity of Secure Quantum Computation

On The Round Complexity of Secure Quantum Computation

23 November 2020
James Bartusek
Andrea Coladangelo
Dakshita Khurana
Fermi Ma
ArXivPDFHTML

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

7 / 7 papers shown
Title
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA
Omri Shmueli
34
9
0
25 Jul 2020
Quantum Garbled Circuits
Quantum Garbled Circuits
Zvika Brakerski
Henry Yuen
47
23
0
01 Jun 2020
Post-Quantum Multi-Party Computation
Post-Quantum Multi-Party Computation
Amit Agarwal
James Bartusek
Vipul Goyal
Dakshita Khurana
Giulio Malavolta
19
8
0
23 May 2020
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical
  Circuits
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
G. Alagic
Zvika Brakerski
Y. Dulek
Christian Schaffner
28
21
0
13 May 2020
Secure Multi-party Quantum Computation with a Dishonest Majority
Secure Multi-party Quantum Computation with a Dishonest Majority
Y. Dulek
A. Grilo
S. Jeffery
Christian Majenz
Christian Schaffner
25
42
0
30 Sep 2019
Classical Homomorphic Encryption for Quantum Circuits
Classical Homomorphic Encryption for Quantum Circuits
U. Mahadev
55
160
0
07 Aug 2017
On Quantum Obfuscation
On Quantum Obfuscation
G. Alagic
Bill Fefferman
35
45
0
04 Feb 2016
1