The Knowledge Complexity of Interactive Proof Systems
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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)- A practical group signature scheme based on rank metric
- Non-interactive zero-knowledge proofs with fine-grained security
- A black-box construction of non-malleable encryption from semantically secure encryption
- On the implausibility of constant-round public-coin zero-knowledge proofs
- Recent results in hardness of approximation
- Efficient, actively secure MPC with a dishonest majority: a survey
- Classically verifiable NIZK for QMA with preprocessing
- Physical zero-knowledge proof for ripple effect
- Randomness in interactive proofs
- On the power of multi-prover interactive protocols
- Playing Savitch and cooking games
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D.
- Rate-1 zero-knowledge proofs from one-way functions
- Instance-hiding interactive proofs (extended abstract)
- Homomorphic secret sharing with verifiable evaluation
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- Enhancements of trapdoor permutations
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Challenging epistemology: Interactive proofs and zero knowledge
- 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
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Arithmetization: A new method in structural complexity theory
- Verification protocols with sub-linear communication for polynomial matrix operations
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- On the Portability of Generalized Schnorr Proofs
- Speak much, remember little: cryptography in the bounded storage model, revisited
- The Knowledge Complexity of Interactive Proof Systems
- An interactive identification scheme based on discrete logarithms and factoring
- Unifying Zero-Knowledge Proofs of Knowledge
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Updatable NIZKs from non-interactive zaps
- The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- A simple and efficient framework of proof systems for NP
- Bicameral and auditably private signatures
- Fiat-Shamir security of FRI and related SNARKs
- Unclonable non-interactive zero-knowledge
- Zero knowledge and circuit minimization
- Interactive and probabilistic proof-checking
- On relationships between statistical zero-knowledge proofs
- The random oracle hypothesis is false
- The hidden subgroup problem and MKTP
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- Quantum computation vs. firewalls
- On Dinur’s proof of the PCP theorem
- Individual cryptography
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- scientific article; zbMATH DE number 828007 (Why is no real title available?)
- Beating the birthday paradox in dining cryptographer networks
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
- A one-round, two-prover, zero-knowledge protocol for NP
- On the power of statistical zero knowledge
- A note on constant-round zero-knowledge proofs of knowledge
- A general, flexible and efficient proof of inclusion and exclusion
- A framework for polynomial-time query learnability
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Parallel repetition of computationally sound protocols revisited
- New publicly verifiable computation for batch matrix multiplication
- 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
- An algebraic framework for universal and updatable SNARKs
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Verifying the first nonzero term: physical ZKPs for ABC end view, Goishi Hiroi, and Toichika
- Practical construction for secure trick-taking games even with cards set aside
- Physical zero-knowledge proofs for Five Cells
- Hardness of learning problems over Burnside groups of exponent 3
- Physical zero-knowledge proof for ball sort puzzle
- Structural complexity of rational interactive proofs
- scientific article; zbMATH DE number 1990814 (Why is no real title available?)
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Arthur-Merlin games in Boolean decision trees
- Zero-knowledge proofs of proximity
- An Equivalence Between Zero Knowledge and Commitments
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Quantum lower bounds for approximate counting via Laurent polynomials
- Non-interactive proofs of proximity
- Parallelizable delegation from LWE
- Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
- Analyzing security protocols using time-bounded task-PIOAs
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- An improved physical ZKP for nonogram and nonogram color
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On being incoherent without being very hard
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Efficient verifiable delay functions
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Distributed-prover interactive proofs
- Arithmetization-oriented APN permutations
- Complexity limitations on one-turn quantum refereed games
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- On the probabilistic closure of the loose unambiguous hierarchy
- NP-completeness and physical zero-knowledge proofs for Zeiger
- Escrow free attribute-based signature with self-revealability
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)
