Corpus ID: 10737364

On Probabilistic Checking in Perfect Zero Knowledge

@article{BenSasson2016OnPC,
  title={On Probabilistic Checking in Perfect Zero Knowledge},
  author={E. Ben-Sasson and A. Chiesa and Michael A. Forbes and A. Gabizon and Michael Riabzev and N. Spooner},
  journal={Electron. Colloquium Comput. Complex.},
  year={2016},
  volume={23},
  pages={156}
}
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive PCPs (IPCPs) [KR08], where the verifier first receives from the prover a PCP and then engages with the prover in an Interactive Proof (IP). 2. The complexity class NEXP has PZK proofs in the model of Interactive Oracle Proofs (IOPs) [BCS16,RRR16], where the… Expand
A Zero Knowledge Sumcheck and its Applications
Zero-Knowledge Proofs of Proximity
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
Worst-Case to Average Case Reductions for the Distance to a Code
DEEP-FRI: Sampling outside the box improves soundness
Scalable, transparent, and post-quantum secure computational integrity
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols
...
1
2
...

References

SHOWING 1-10 OF 62 REFERENCES
Interactive Oracle Proofs
A one-round, two-prover, zero-knowledge protocol for NP
On Efficient Zero-Knowledge PCPs
Non-deterministic exponential time has two-prover interactive protocols
Languages with Efficient Zero-Knowledge PCP's are in SZK
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Delegating Computation
...
1
2
3
4
5
...