Implementing Probabilistically Checkable Proofs of Proximity
Abstract: In this paper, we describe a proof-of-concept implementation of the probabilistically checkable proof of proximity (PCPP) system described by Ben-Sasson and Sudan in \\cite{bs05}. In particular, we implement a PCPP prover and verifier for Reed-Solomon codes; the prover converts an evaluat...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Idioma: | en_US |
| Publicado em: |
2005
|
| Acesso em linha: | http://hdl.handle.net/1721.1/30562 |