Rational proofs
We study a new type of proof system, where an unbounded prover and a polynomial time verifier interact, on inputs a string x and a function f, so that the Verifier may learn f(x). The novelty of our setting is that there no longer are "good" or "malicious" provers, but only ratio...
| Үндсэн зохиолчид: | , |
|---|---|
| Бусад зохиолчид: | |
| Формат: | Өгүүллэг |
| Хэл сонгох: | en_US |
| Хэвлэсэн: |
Association for Computing Machinery (ACM)
2012
|
| Онлайн хандалт: | http://hdl.handle.net/1721.1/72431 https://orcid.org/0000-0001-9156-2428 https://orcid.org/0000-0002-0816-4064 |