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. 2405.18275
  4. Cited By
The Round Complexity of Proofs in the Bounded Quantum Storage Model

The Round Complexity of Proofs in the Bounded Quantum Storage Model

28 May 2024
A. Grilo
Philippe Lamontagne
ArXivPDFHTML

Papers citing "The Round Complexity of Proofs in the Bounded Quantum Storage Model"

2 / 2 papers shown
Title
Classically Verifiable NIZK for QMA with Preprocessing
Classically Verifiable NIZK for QMA with Preprocessing
T. Morimae
Takashi Yamakawa
21
4
0
18 Feb 2021
Cryptography from Noisy Storage
Cryptography from Noisy Storage
S. Wehner
Christian Schaffner
B. Terhal
84
124
0
19 Nov 2007
1