Pages that link to "Item:Q2931394"
From MaRDI portal
The following pages link to Zero-knowledge against quantum attacks (Q2931394):
Displaying 35 items.
- Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Protocols for quantum binary voting (Q2973383) (← links)
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications (Q3011901) (← links)
- Quantum Commitments from Complexity Assumptions (Q3012793) (← links)
- Increasing the power of the verifier in Quantum Zero Knowledge (Q3165950) (← links)
- Efficient zero-knowledge identification based on matrix completion problem (Q3381608) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Composable Security in the Bounded-Quantum-Storage Model (Q3519536) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- (Q5089146) (← links)
- (Q5189539) (redirect page) (← links)
- Algorithms and Computation (Q5191646) (← links)
- Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries (Q5270368) (← links)
- ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES (Q5300680) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311537) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies (Q5854432) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- Certified everlasting zero-knowledge proof for QMA (Q6097264) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP (Q6157505) (← links)
- Post-quantum insecurity from LWE (Q6169346) (← links)
- Universally composable \(\varSigma \)-protocols in the global random-oracle model (Q6169354) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
- Efficient Quantum Algorithms for Testing Symmetries of Open Quantum Systems (Q6181205) (← links)
- Watermarking PRFs and PKE against quantum adversaries (Q6536747) (← links)
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states (Q6562577) (← links)
- Unconditionally secure quantum commitments with preprocessing (Q6653000) (← links)
- Unconditionally secure commitments with quantum auxiliary inputs (Q6653002) (← links)
- Zero-knowledge proof systems for QMA (Q6663093) (← links)
