The knowledge complexity of interactive proof-systems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
- More efficient shuffle argument from unique factorization
- Adaptively-secure big-key identity-based encryption
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
- Batch arguments to NIZKs from one-way functions
- Security analysis of discrete logarithm based cryptosystems
- Challenging epistemology: Interactive proofs and zero knowledge
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Model independent approach to probabilistic models
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Efficient lattice-based polynomial evaluation and batch ZK arguments
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Are there interactive protocols for co-NP languages?
- Probabilistic quantifiers and games
- Entity authentication schemes using braid word reduction
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- NIWI and new notions of extraction for algebraic languages
- Modal and justification logics for multi-agent systems (invited talk)
- The Knowledge Complexity of Interactive Proof Systems
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol
- NP-completeness and physical zero-knowledge proof of Hotaru Beam
- Succinct classical verification of quantum computation
- Improved identification schemes based on error-correcting codes
- Concurrent knowledge extraction in public-key models
- On Emulating Interactive Proofs with Public Coins
- scientific article; zbMATH DE number 7525466 (Why is no real title available?)
- Probabilistic game automata
- Zero-knowledge proofs for committed symmetric Boolean functions
- On the concurrent composition of quantum zero-knowledge
- Random walks and concurrent zero-knowledge
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Physical ZKP protocols for Nurimisaki and Kurodoko
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Speeding up multi-scalar multiplications for pairing-based zkSNARKs
- Snarky ceremonies
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Searching for ELFs in the cryptographic forest
- Indistinguishable proofs of work or knowledge
- Complexity limitations on one-turn quantum refereed games
- On the design of cryptographic primitives
- A shuffle argument secure in the generic model
- Belief, awareness, and limited reasoning
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the security loss of unique signatures
- Round optimal black-box ``commit-and-prove
- Lattice-based inner product argument
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound
- A discrete logarithm implementation of perfect zero-knowledge blobs
- Survey of information security
- scientific article; zbMATH DE number 4180787 (Why is no real title available?)
- Tight state-restoration soundness in the algebraic group model
- PrORAM
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- scientific article; zbMATH DE number 4087662 (Why is no real title available?)
- On the power of rewinding simulators in functional encryption
- On the complexity of interactive proofs with bounded communication
- The graph clustering problem has a perfect zero-knowledge interactive proof
- scientific article; zbMATH DE number 176510 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- Efficient signature generation by smart cards
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- zk-SNARKs from codes with rank metrics
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Round-optimal perfect zero-knowledge proofs
- \textit{Ceno}: non-uniform, segment and parallel zero-knowledge virtual machine
- Steganography-free zero-knowledge
- A note on universal composable zero-knowledge in the common reference string model
- Uni/multi variate polynomial embeddings for zkSNARKs
- scientific article; zbMATH DE number 4106274 (Why is no real title available?)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Cryptanalysis of Harari's identification scheme
- Secure protocol transformations
- On some variations of two-way probabilistic finite automata models
- Secure electronic bills of lading: Blind counts and digital signatures
- Polynomial IOPs for linear algebra relations
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Spartan and bulletproofs are simulation-extractable (for free!)
- Statistical zero-knowledge languages can be recognized in two rounds
- Ligero: lightweight sublinear arguments without a trusted setup
- Mathematical problems in cryptology
- Task-structured probabilistic I/O automata
- Classical, quantum and nonsignalling resources in bipartite games
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Nova: recursive zero-knowledge arguments from folding schemes
- ZK-PCPs from leakage-resilient secret sharing
- On QA-NIZK in the BPK model
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)
