The knowledge complexity of interactive proof-systems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A note on universal composable zero-knowledge in the common reference string model
- Belief, awareness, and limited reasoning
- Partitioned encryption and achieving simultaneity by partitioning
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- Probabilistic quantifiers and games
- Zero-knowledge proofs of identity
- Graph isomorphism is in the low hierarchy
- Relativized Arthur-Merlin versus Merlin-Arthur games
- Are there interactive protocols for co-NP languages?
- Efficient signature generation by smart cards
- On games of incomplete information
- Probabilistic complexity classes and lowness
- The complexity of the max word problem and the power of one-way interactive proof systems
- Round-optimal perfect zero-knowledge proofs
- Definitions and properties of zero-knowledge proof systems
- Dynamic sizing of multilayer perceptrons
- The knowledge complexity of quadratic residuosity languages
- Improved identification schemes based on error-correcting codes
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Decision algorithms for multiplayer noncooperative games of incomplete information
- Round optimal black-box ``commit-and-prove
- On the security loss of unique signatures
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Task-structured probabilistic I/O automata
- Probabilistic game automata
- Proving properties of interactive proofs by a generalized counting technique
- On the knowledge complexity of \(\mathcal N\mathcal P\)
- Mathematical problems in cryptology
- A low communication competitive interactive proof system for promised quadratic residuosity
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\)
- Placing conditional disclosure of secrets in the communication complexity universe
- Transparent SNARKs from DARK compilers
- Stacked garbling for disjunctive zero-knowledge proofs
- Statistical ZAPR arguments from bilinear maps
- Statistical Zaps and new oblivious transfer protocols
- Boosting verifiable computation on encrypted data
- Non-interactive zero knowledge from sub-exponential DDH
- Order-C secure multiparty computation for highly repetitive circuits
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- On succinct arguments and witness encryption from groups
- Covert authentication from lattices
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- Zero-knowledge proofs for committed symmetric Boolean functions
- On the concurrent composition of quantum zero-knowledge
- Tight state-restoration soundness in the algebraic group model
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- A logic of interactive proofs
- ZK-PCPs from leakage-resilient secret sharing
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- On the complexity of collision resistant hash functions: new and old black-box separations
- Random walks and concurrent zero-knowledge
- Observation and interaction. Invited paper
- Survey of information security
- On the power of rewinding simulators in functional encryption
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Cheat sensitive quantum bit commitment via pre- and post-selected quantum states
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
- Entity authentication schemes using braid word reduction
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Lattice-based secret handshakes with reusable credentials
- Blind key-generation attribute-based encryption for general predicates
- Generalized proofs of knowledge with fully dynamic setup
- On communication models and best-achievable security in two-round MPC
- Oblivious transfer from trapdoor permutations in minimal rounds
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Concurrent knowledge extraction in public-key models
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Three-player entangled XOR games are NP-hard to approximate
- Computational complexity and knowledge complexity (extended abstract)
- A lattice-based group signature scheme with message-dependent opening
- On garbling schemes with and without privacy
- Secure protocol transformations
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Fine-Grained Cryptography
- Multiple usage of random bits in finite automata
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound
- On the complexity of interactive proofs with bounded communication
- The graph clustering problem has a perfect zero-knowledge interactive proof
- Zero-Knowledge Accumulators and Set Algebra
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A shuffle argument secure in the generic model
- Indistinguishable proofs of work or knowledge
- Protocols for quantum binary voting
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
- Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
- Fully simulatable quantum-secure coin-flipping and applications
- Precise time and space simulatable zero-knowledge
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 Q4365519)
