Succinct arguments in the quantum random oracle model (Q2175929): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable zero knowledge with no trusted setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aurora: transparent succinct arguments for R1CS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Oracle Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Oracles in a Quantum World / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based SNARGs and Their Application to More Efficient Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal SNARGs via linear multi-prover interactive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptanalysis of hash and claw-free functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir: from practice to theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fiat–Shamir Transformation in a Quantum World / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security of the Fiat-Shamir transformation in the quantum random-oracle model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leighton-Micali hash-based signatures in the quantum random-oracle model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of interactive proofs with bounded communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interactive proofs with a laconic prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegating Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive PCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting post-quantum Fiat-Shamir / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Proofs for Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round interactive proofs for delegating computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-quantum security of Fiat-Shamir / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge against quantum attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Identity-Based Encryption in the Quantum Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to record quantum queries, and applications to quantum indifferentiability / rank
 
Normal rank

Latest revision as of 13:21, 22 July 2024

scientific article
Language Label Description Also known as
English
Succinct arguments in the quantum random oracle model
scientific article

    Statements

    Succinct arguments in the quantum random oracle model (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    succinct arguments
    0 references
    quantum random oracle model
    0 references
    probabilistically checkable proofs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers