The round complexity of proofs in the bounded quantum storage model
From MaRDI portal
Cites work
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Adaptive versus non-adaptive strategies in the quantum setting with applications
- Advances in Cryptology - CRYPTO 2003
- Algebraic methods for interactive proof systems
- An all-but-one entropic uncertainty relation, and application to password-based identification
- Classically verifiable NIZK for QMA with preprocessing
- Composable Security in the Bounded-Quantum-Storage Model
- Composing Quantum Protocols in a Classical Environment
- Computational Security of Quantum Encryption
- Concurrent composition in the bounded quantum storage model
- Constant-round interactive proofs for delegating computation
- Cryptography in the Bounded-Quantum-Storage Model
- Definitions and properties of zero-knowledge proof systems
- Delegating computation: interactive proofs for muggles
- Entanglement Sampling and Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- IP = PSPACE
- Multi-theorem designated-verifier NIZK for QMA
- Non-interactive Zaps and New Techniques for NIZK
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the (in)security of the Fiat-Shamir paradigm
- On the Composition of Zero-Knowledge Proof Systems
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Robust cryptography in the noisy-quantum-storage model
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Secure Identification and QKD in the Bounded-Quantum-Storage Model
- Unconditional Security From Noisy Quantum Storage
- Why ``Fiat-Shamir for proofs lacks a proof
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zero-knowledge against quantum attacks
This page was built for publication: The round complexity of proofs in the bounded quantum storage model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326592)
