Pages that link to "Item:Q2931394"
From MaRDI portal
The following pages link to Zero-knowledge against quantum attacks (Q2931394):
Displaying 50 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Quantum computation vs. firewalls (Q303315) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Faithful squashed entanglement (Q717116) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Quantum protocols for zero-knowledge systems (Q967279) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- Unconditionally secure multi-party quantum commitment scheme (Q1617190) (← links)
- On the time dependence of holographic complexity in a dynamical Einstein-Dilaton model (Q1635242) (← links)
- Comments on holographic complexity (Q1692991) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- On the time dependence of holographic complexity (Q1706998) (← links)
- Circuit complexity in quantum field theory (Q1709325) (← links)
- Holographic complexity equals which action? (Q1735648) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- Oracle separations between quantum and non-interactive zero-knowledge classes (Q2011030) (← links)
- Subsystem complexity after a global quantum quench (Q2047907) (← links)
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (Q2055676) (← links)
- Efficient simulation of random states and random unitaries (Q2055680) (← links)
- Threshold ring signatures: new definitions and post-quantum security (Q2055701) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- Classical proofs of quantum knowledge (Q2056758) (← links)
- Holographic complexity and de Sitter space (Q2087346) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Quantum indistinguishability for public key encryption (Q2118562) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Watermarking PRFs against quantum adversaries (Q2170100) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Complexity of mixed states in QFT and holography (Q2191647) (← links)
- Holographic complexity for defects distinguishes action from volume (Q2315688) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- Complexity of mixed Gaussian states from Fisher information geometry (Q2660245) (← links)
- Post-quantum verification of Fujisaki-Okamoto (Q2692346) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Relationships between quantum IND-CPA notions (Q2695636) (← links)
- Classical binding for quantum commitments (Q2695637) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Complexity equals anything. II. (Q2696885) (← links)
- Semantic Security and Indistinguishability in the Quantum World (Q2829943) (← links)
- Complete Problem for Perfect Zero-Knowledge Quantum Proof (Q2891386) (← links)
- Quantum Proofs of Knowledge (Q2894405) (← links)
- Zero-knowledge against quantum attacks (Q2931394) (← links)
