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:
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Springer
2017
|
| Subjects: | |
| Online Access: | http://repository.vnu.edu.vn/handle/VNU_123/27032 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Vietnam National University, Hanoi |
| Language: | English |