Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleJune 2018
Primitives towards verifiable computation: a survey
Frontiers of Computer Science: Selected Publications from Chinese Universities (FCS), Volume 12, Issue 3Pages 451–478https://doi.org/10.1007/s11704-016-6148-4Verifiable computation (VC) paradigm has got the captivation that in real term is highlighted by the concept of third party computation. In more explicate terms, VC allows resource constrained clients/organizations to securely outsource expensive ...
- research-articleJanuary 2013
A Parallel Repetition Theorem for Any Interactive Argument
SIAM Journal on Computing (SICOMP), Volume 42, Issue 6Pages 2487–2501https://doi.org/10.1137/100810630A fundamental question in the study of protocols is characterizing the effect parallel repetition has on the soundness error. While parallel repetition reduces the soundness error in interactive proofs and in special cases of interactive arguments (e.g., ...
- research-articleJune 2011
Separating succinct non-interactive arguments from all falsifiable assumptions
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingPages 99–108https://doi.org/10.1145/1993636.1993651An argument system for NP is succinct, if its communication complexity is polylogarithmic the instance and witness sizes. The seminal works of Kilian '92 and Micali '94 show that such arguments can be constructed under standard cryptographic hardness ...
- ArticleAugust 2010
Improved delegation of computation using fully homomorphic encryption
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schemes, a delegator outsources the computation of a function F on many, ...
- ArticleOctober 2009
A Parallel Repetition Theorem for Any Interactive Argument
FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer SciencePages 241–250The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an exponential rate) the error in interactive proofs and (at a weak exponential ...