Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Riabzev, Michael"'
Autor:
Ben-Sasson, Eli, Chiesa, Alessandro, Forbes, Michael A., Gabizon, Ariel, Riabzev, Michael, Spooner, Nicholas
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 (IPCP
Externí odkaz:
http://arxiv.org/abs/1610.03798
The family of Reed-Solomon (RS) codes plays a prominent role in the construction of quasilinear probabilistically checkable proofs (PCPs) and interactive oracle proofs (IOPs) with perfect zero knowledge and polylogarithmic verifiers. The large concre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b7506176dc6e914356ab358231e60af