On doubly-efficient interactive proof systems
From MaRDI portal
Recommendations
- Simple doubly-efficient interactive proof systems for locally-characterizable sets
- scientific article; zbMATH DE number 66620
- Doubly efficient interactive proofs over infinite and non-commutative rings
- On Prover-Efficient Public-Coin Emulation of Interactive Proofs
- scientific article; zbMATH DE number 4106274
Cited in
(15)- scientific article; zbMATH DE number 4195163 (Why is no real title available?)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- On Input Indistinguishable Proof Systems
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- On Prover-Efficient Public-Coin Emulation of Interactive Proofs
- Doubly efficient interactive proofs over infinite and non-commutative rings
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- Zero-knowledge in streaming interactive proofs
- How to prove false statements: practical attacks on Fiat-Shamir
- Zero-knowledge RAM: doubly efficient and black-box
- Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols
- Doubly-efficient batch verification in statistical zero-knowledge
- Local proofs approaching the witness length
- Polynomial-time pseudodeterministic construction of primes
This page was built for publication: On doubly-efficient interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571853)
