On the complexity of interactive arguments
From MaRDI portal
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Advances in Cryptology - CRYPTO 2003
- Bit commitment using pseudorandomness
- Collision Resistance from Multi-collision Resistance
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Computationally Sound Proofs
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
- Foundations of Cryptography
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lower bound on SNARGs in the random oracle model
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New hash functions and their use in authentication and set equality
- On interactive proofs with a laconic prover (extended abstract)
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- On the size of pairing-based non-interactive arguments
- Perfect Non-interactive Zero Knowledge for NP
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Separation Results on the “One-More” Computational Problems
- SNARGs for \(\mathcal{P}\) from LWE
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Sumcheck arguments and their applications
- The relationship between public key encryption and oblivious transfer
- Theory of Cryptography
- Transparent SNARKs from DARK compilers
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zaps and their applications
This page was built for publication: On the complexity of interactive arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443205)