搜索结果: 1-2 共查到“Proofs of Proximity”相关记录2条 . 查询时间(0.078 秒)
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
Probabilistically Checkable Proofs Zero-Knowledge Verifiable Secret Sharing
2017/2/28
A probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form "x∈Lx∈L" by querying only fe...
Interactive proofs of proximity (Ergun, Kumar and Rubinfeld, Information & Computation, 2004 and Rothblum, Vadhan and Wigderson, STOC 2013), or IPPs, are interactive proofs in which the verifier runs ...