| dc.contributor.author | Bhattacharyya, Arnab | |
| dc.contributor.other | Complexity Theory | |
| dc.date.accessioned | 2005-12-22T02:33:55Z | |
| dc.date.available | 2005-12-22T02:33:55Z | |
| dc.date.issued | 2005-08-08 | |
| dc.identifier.other | MIT-CSAIL-TR-2005-051 | |
| dc.identifier.other | MIT-LCS-TR-998 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30562 | |
| dc.description.abstract | 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 evaluation of a polynomial on a linear set into a valid PCPP, while the verifier queries the evaluation and the PCPP to check that the evaluation is close to a Reed-Solomon codeword. We prove tight bounds on the various parameters associated with the prover and verifier and describe some interesting programmatic issues that arise during their implementation. | |
| dc.format.extent | 16 p. | |
| dc.format.extent | 13280259 bytes | |
| dc.format.extent | 636640 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | |
| dc.title | Implementing Probabilistically Checkable Proofs of Proximity | |
