Theory of Cryptography
A probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classi-cal proof. Computationally sound (CS) proofs improve upon PCPs by additionally shortening the length of the transmitted proof to be poly-logarithmic in the length of the...
Saved in:
| 其他作者: | |
|---|---|
| 格式: | 圖書 |
| 語言: | English |
| 出版: |
Springer
2017
|
| 主題: | |
| 在線閱讀: | http://repository.vnu.edu.vn/handle/VNU_123/27032 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|