Quantum proofs of knowledge
From MaRDI portal
Recommendations
Cited in
(67)- On the hardness of the computational ring-LWR problem and its applications
- CSIDH: an efficient post-quantum commutative group action
- Everlasting multi-party computation
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Efficient simulation of random states and random unitaries
- Threshold ring signatures: new definitions and post-quantum security
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Classical proofs of quantum knowledge
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Secure quantum extraction protocols
- A black-box approach to post-quantum zero-knowledge in constant rounds
- On the concurrent composition of quantum zero-knowledge
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Watermarking PRFs against quantum adversaries
- Non-malleable commitments against quantum attacks
- Cryptographic reverse firewalls for interactive proof systems
- Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images
- Naor-Yung paradigm with shared randomness and applications
- Post-quantum verification of Fujisaki-Okamoto
- The round complexity of quantum zero-knowledge
- Relationships between quantum IND-CPA notions
- Classical binding for quantum commitments
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Semantic security and indistinguishability in the quantum world
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Collapse-binding quantum commitments without random oracles
- On the connection between leakage tolerance and adaptive security
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
- General Properties of Quantum Zero-Knowledge Proofs
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- General properties of quantum bit commitments (extended abstract)
- Black-box separations for non-interactive classical commitments in a quantum world
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Post-quantum insecurity from LWE
- Quantum rewinding for many-round protocols
- Universal reductions: reductions relative to stateful oracles
- Tracing quantum state distinguishers via backtracking
- Commitments to quantum states
- Watermarking PRFs and PKE against quantum adversaries
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH
- Zero-knowledge proof systems for QMA
- Cryptographic reverse firewalls for interactive proof systems
- Post-quantum zero-knowledge with space-bounded simulation
- Straight-line knowledge extraction for multi-round protocols
- How to model unitary oracles
- The space-time cost of purifying quantum computations
- On digital signatures based on group actions: QROM security and ring signatures
- Almost-total puzzles and their applications
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
- Quantum rewinding for IOP-based succinct arguments
- The algebraic isogeny model: a general model with applications to SQIsign and key exchanges
- On quantum simulation-soundness
- A note on the minimality of one-way functions in post-quantum cryptography
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Quantum proofs of knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894405)
