[PDF] Top 20 Multi-Client Non-Interactive Verifiable Computation

... the client. This may be related to the nature of the computation being performed — ...the client of a particular result because it will have beneficial conse- quences for the server — or may simply ... See full document

... inherently interactive since it executes two 2PC protocols, one after the other, where the second 2PC is used to recover from potential cheating, with no obvious way of making the protocol ...working ... See full document

... on verifiable stream computation focused on non-interactive protocols, as in the annotated data streams model of Chakrabarti et ...“barely interactive” in the sense that the prover and ... See full document

... long computation, how can I check that the result is correct without re-doing the computation myself? This is the question that efficient verifiable computation deals ...the computation ... See full document

... parallelizable computation). And it does not support non-deterministic circuits, which can be extremely useful for representing high-level programs as circuits [15, 17, 26, 61, 69, 71]; operations such as ... See full document

... of non-interactive verifiable computation in which there is only one round of interaction between the client and the server each time a computation is performed and introduced a ... See full document

... Chung et al. [12] combine the GKR protocol with fully homomorphic encryption (FHE) to give reusable, non-interactive protocols of polylogarithmic cost for any problem in NC. Papamanthou et al. [37] give ... See full document

... good interactive protocol makes use of a Cut&Choose technique (like the one discussed in Section ...traditional non-universal proof schemes, it is common for the researchers to seek out an alternative ... See full document

... holomorphic verifiable tag technique, and design an efficient and publicly verifiable inner product computation scheme on the dynamic outsourced data streams under multiple ...challenging ... See full document

... a non-interactive privately verifiable delegation scheme for non- deterministic computations, that is sound under standard sub-exponential hardness ...a non-interactive, pri- ... See full document

... a non-verifiable, multi-input outsourced computation setting using homomorphic Ciphertext-Policy ABE and fully homomorphic ...of verifiable computation, but limited their scope ... See full document

... whichrealizes non interactive fine-grained access control mechanism,expands one-to-one model to one to many model on encryption anddecryption, greatly enriches the flexibility of encryption policyand ... See full document

... of non- interactive delegation of computation: A client wants to delegate the computation of a large circuit to an untrusted worker and wants some insurance that the output given by the ... See full document

... obtain interactive UC secure computation, Moran and Segev [MS08] work in a model with only uni-directional transfer of ...of computation and communication complexities, because it relies on running ... See full document

... Pairings. Pairing-based cryptography is demanded in most cryptographic so- lutions like one round tripartite key exchange in Joux [26], identity-based en- cryption scheme in [9] and short signatures of Boneh, Lynn, and ... See full document

... Homomorphic encryption in a multi-user setting is considered in (Xiao et al., 2012). The authors propose a new homomorphic symmetric encryp- tion scheme that is shown to be secure under a factoring assumption, ... See full document

... Consider the following scenario: Goldman Sachs, which has collected in-depth market research and analysis on various companies, wishes to offer a paid service to high-profile investors who are interested in using this ... See full document

... Multiparty computation can be used for privacy-friendly out- sourcing of computations on private inputs of multiple ...several computation parties; if not too many are corrupted ...all computation ... See full document

... the client (or delegator) C (trusted but resource- constrained part) and servers U (potentially untrusted but powerful part), where U can consist of one or more ...the computation of certain functions to U ... See full document

... (Succinct Non-interactive Argument of Knowl- edge) with preprocessing [22, 41], which is to say that it is a protocol with the following structure and ...the verifiable computation context, ... See full document