![]() ![]() 目前,针对interactive proofs的大量研究都着力于改进Verifier的complexity in terms of various resouce measures,如: 特别地,对于languages ccomputable by log-space unifrom ![]() ( n + d ) ⋅ p o l y l o g ( n ) and space 本文实现了a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth client可verify the result’s correctness in nearly-linear time (而不是run the entire computation itselt)。.server run a computation for a client 的同时,interactively prove the correctness of the result。.Verifier为super-efficient,run in nearly-linear time。.(honest)prover(又称为“muggle”) 为efficient, run in polynomial time。.在该论文中,关注的是interactive proofs for tractable languages。要求: ![]() Goldwasser等人2008年论文《 Delegating Computation: Interactive Proofs for Muggles》,该论文的full version版本见: full verion 版本的 Delegating Computation: Interactive Proofs for Muggles》。 ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |