The Knowledge Complexity of Interactive Proof Systems
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Definitions and properties of zero-knowledge proof systems
- Existence of 3-round zero-knowledge proof systems for NP
- Foundations of Cryptography
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 697823 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Lower bounds for non-black-box zero knowledge
- On probabilistic versus deterministic provers in the definition of proofs of knowledge
- On the Composition of Zero-Knowledge Proof Systems
- Strict polynomial-time in simulation and extraction
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Which Languages Have 4-Round Zero-Knowledge Proofs?
Cited in
(only showing first 100 items - show all)- An application of quantum finite automata to interactive proof systems
- Analyzing security protocols using time-bounded task-PIOAs
- Handling expected polynomial-time strategies in simulation-based security proofs
- Hybrid commitments and their applications to zero-knowledge proof systems
- New approaches for deniable authentication
- A secure and scalable group key exchange system
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- An introduction to randomized algorithms
- An interactive identification scheme based on discrete logarithms and factoring
- Multi-oracle interactive protocols with constant space verifiers
- A guide to completeness and complexity for modal logics of knowledge and belief
- An almost-constant round interactive zero-knowledge proof
- On being incoherent without being very hard
- A uniform-complexity treatment of encryption and zero-knowledge
- Graph isomorphism is low for PP
- On the communication complexity of zero-knowledge proofs
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- On hiding information from an oracle
- Quantifying knowledge complexity
- Self-testing/correcting with applications to numerical problems
- PSPACE is provable by two provers in one round
- BPP has subexponential time simulations unless EXPTIME has publishable proofs
- Randomness in interactive proofs
- Definitions and properties of zero-knowledge proof systems
- Three systems for cryptographic protocol analysis
- The power of adaptiveness and additional queries in random-self- reductions
- The random oracle hypothesis is false
- On the power of multi-prover interactive protocols
- Probabilistically checkable proofs and their consequences for approximation algorithms
- More on BPP and the polynomial-time hierarchy
- On the hardness of computing the permanent of random matrices
- Fully parallelized multi-prover protocols for NEXP-time
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- On the limits of nonapproximability of lattice problems
- Interactive and probabilistic proof-checking
- New efficient and secure protocols for verifiable signature sharing and other applications
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
- One-message zero knowledge and non-malleable commitments
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Fine-grained secure computation
- Pattern matching on encrypted streams
- The hunting of the SNARK
- Non-interactive secure computation from one-way functions
- On the tightness of forward-secure signature reductions
- Non-interactive proofs of proximity
- A black-box construction of non-malleable encryption from semantically secure encryption
- Randomized proofs in arithmetic
- Uniform generation of NP-witnesses using an NP-oracle
- Robust threshold DSS signatures
- PSPACE has constant-round quantum interactive proof systems
- A one-round, two-prover, zero-knowledge protocol for NP
- Practical and provably secure release of a secret and exchange of signatures
- The complexity of approximating a nonlinear program
- On constant-round concurrent non-malleable proof systems
- Public-coin parallel zero-knowledge for NP
- Arthur-Merlin games in Boolean decision trees
- On relationships between statistical zero-knowledge proofs
- Verification protocols with sub-linear communication for polynomial matrix operations
- New publicly verifiable computation for batch matrix multiplication
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- SPARKs: succinct parallelizable arguments of knowledge
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Compact NIZKs from standard assumptions on bilinear maps
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Classical proofs of quantum knowledge
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Efficient range proofs with transparent setup from bounded integer commitments
- Public verifiable private decision tree prediction
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Round-optimal black-box commit-and-prove with succinct communication
- (Commit-and-prove) predictable arguments with privacy
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- Interactive proofs for social graphs
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Formalizing data deletion in the context of the right to be forgotten
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Multi-theorem designated-verifier NIZK for QMA
- An algebraic framework for universal and updatable SNARKs
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Succinct non-interactive arguments via linear interactive proofs
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Cross-domain attribute-based access control encryption
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- An improved physical ZKP for Nonogram
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
- Affine automata verifiers
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- Layering quantum-resistance into classical digital signature algorithms
This page was built for publication: The Knowledge Complexity of Interactive Proof Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833627)
