Back to Results
First PageMeta Content
Cryptography / Complexity classes / Randomized algorithms / Mathematics / Theory of computation / Probabilistically checkable proof / NP / IP / Zero-knowledge proof / Soundness / Computational complexity theory / Proof of secure erasure


Computational integrity with a public random string from quasi-linear PCPs. Eli Ben-Sasson1 Iddo Ben-Tov1 Alessandro Chiesa2 Ariel Gabizon1
Add to Reading List

Document Date: 2016-06-22 01:47:53


Open Document

File Size: 497,60 KB

Share Result on Facebook