FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3196102960> ?p ?o ?g. }

• W3196102960 startingPage "351" @default.
• W3196102960 abstract "Several research teams have recently been working toward the development of practical generalpurpose protocols for verifiable computation. These protocols enable a computationally weak verifier to offload computations to a powerful but untrusted prover, while providing the verifier with a guarantee that the prover performed the requested computations correctly. Despite substantial progress, existing implementations require further improvements before they become practical for most settings. The main bottleneck is typically the extra effort required by the prover to return an answer with a guarantee of correctness, compared to returning an answer with no guarantee. We describe a refinement of a powerful interactive proof protocol due to Goldwasser, Kalai, and Rothblum [21]. Cormode, Mitzenmacher, and Thaler [14] show how to implement the prover in this protocol in time O(S logS), where S is the size of an arithmetic circuit computing the function of interest. Our refinements apply to circuits with sufficiently “regular” wiring patterns; for these circuits, we bring the runtime of the prover down to O(S). That is, our prover can evaluate the circuit with a guarantee of correctness, with only a constant-factor blowup in work compared to evaluating the circuit with no guarantee. We argue that our refinements capture a large class of circuits, and we complement our theoretical results with experiments on problems such as matrix multiplication and determining the number of distinct elements in a data stream. Experimentally, our refinements yield a 200x speedup for the prover over the implementation of Cormode et al., and our prover is less than 10x slower than a C++ program that simply evaluates the circuit. Along the way, we describe a special-purpose protocol for matrix multiplication that is of interest in its own right. Our final contribution is the design of an interactive proof protocol targeted at general data parallel computation. Compared to prior work, this protocol can more efficiently verify complicated computations as long as that computation is applied independently to many different pieces of data. ∗Harvard University, School of Engineering and Applied Sciences. Supported by an NSF Graduate Research Fellowship and NSF grants CNS-1011840 and CCF-0915922." @default.
• W3196102960 created "2021-08-30" @default.
• W3196102960 creator A5080601320 @default.
• W3196102960 date "2013-01-01" @default.
• W3196102960 modified "2023-09-23" @default.
• W3196102960 title "Time-Optimal Interactive Proofs for Circuit Evaluation." @default.
• W3196102960 cites W104209573 @default.
• W3196102960 cites W1523833456 @default.
• W3196102960 cites W1527197079 @default.
• W3196102960 cites W1538440442 @default.
• W3196102960 cites W1540469777 @default.
• W3196102960 cites W1557386445 @default.
• W3196102960 cites W1594335079 @default.
• W3196102960 cites W1686241726 @default.
• W3196102960 cites W1890128745 @default.
• W3196102960 cites W1930567086 @default.
• W3196102960 cites W2018746447 @default.
• W3196102960 cites W2039487342 @default.
• W3196102960 cites W2041068798 @default.
• W3196102960 cites W2049982182 @default.
• W3196102960 cites W2051391952 @default.
• W3196102960 cites W2058426370 @default.
• W3196102960 cites W2080132708 @default.
• W3196102960 cites W2082647621 @default.
• W3196102960 cites W2116653107 @default.
• W3196102960 cites W2136936712 @default.
• W3196102960 cites W2144238522 @default.
• W3196102960 cites W2146099890 @default.
• W3196102960 cites W2147412664 @default.
• W3196102960 cites W2166670067 @default.
• W3196102960 cites W2169657197 @default.
• W3196102960 cites W2176939845 @default.
• W3196102960 cites W2192481898 @default.
• W3196102960 cites W2293988196 @default.
• W3196102960 cites W2402869180 @default.
• W3196102960 cites W2404121837 @default.
• W3196102960 cites W2405137585 @default.
• W3196102960 cites W2912272112 @default.
• W3196102960 cites W2950650152 @default.
• W3196102960 cites W2963893667 @default.
• W3196102960 cites W3028987847 @default.
• W3196102960 cites W53264231 @default.
• W3196102960 cites W1604022092 @default.
• W3196102960 hasPublicationYear "2013" @default.
• W3196102960 type Work @default.
• W3196102960 sameAs 3196102960 @default.
• W3196102960 citedByCount "0" @default.
• W3196102960 crossrefType "posted-content" @default.
• W3196102960 hasAuthorship W3196102960A5080601320 @default.
• W3196102960 hasConcept C108710211 @default.
• W3196102960 hasConcept C11413529 @default.
• W3196102960 hasConcept C149635348 @default.
• W3196102960 hasConcept C159718280 @default.
• W3196102960 hasConcept C173608175 @default.
• W3196102960 hasConcept C177264268 @default.
• W3196102960 hasConcept C199360897 @default.
• W3196102960 hasConcept C2524010 @default.
• W3196102960 hasConcept C2780513914 @default.
• W3196102960 hasConcept C33923547 @default.
• W3196102960 hasConcept C41008148 @default.
• W3196102960 hasConcept C45374587 @default.
• W3196102960 hasConcept C55439883 @default.
• W3196102960 hasConcept C68339613 @default.
• W3196102960 hasConcept C80444323 @default.
• W3196102960 hasConcept C85847156 @default.
• W3196102960 hasConceptScore W3196102960C108710211 @default.
• W3196102960 hasConceptScore W3196102960C11413529 @default.
• W3196102960 hasConceptScore W3196102960C149635348 @default.
• W3196102960 hasConceptScore W3196102960C159718280 @default.
• W3196102960 hasConceptScore W3196102960C173608175 @default.
• W3196102960 hasConceptScore W3196102960C177264268 @default.
• W3196102960 hasConceptScore W3196102960C199360897 @default.
• W3196102960 hasConceptScore W3196102960C2524010 @default.
• W3196102960 hasConceptScore W3196102960C2780513914 @default.
• W3196102960 hasConceptScore W3196102960C33923547 @default.
• W3196102960 hasConceptScore W3196102960C41008148 @default.
• W3196102960 hasConceptScore W3196102960C45374587 @default.
• W3196102960 hasConceptScore W3196102960C55439883 @default.
• W3196102960 hasConceptScore W3196102960C68339613 @default.
• W3196102960 hasConceptScore W3196102960C80444323 @default.
• W3196102960 hasConceptScore W3196102960C85847156 @default.
• W3196102960 hasLocation W31961029601 @default.
• W3196102960 hasOpenAccess W3196102960 @default.
• W3196102960 hasPrimaryLocation W31961029601 @default.
• W3196102960 hasRelatedWork W14116631 @default.
• W3196102960 hasRelatedWork W1510353087 @default.
• W3196102960 hasRelatedWork W1537750720 @default.
• W3196102960 hasRelatedWork W1569881051 @default.
• W3196102960 hasRelatedWork W1577352907 @default.
• W3196102960 hasRelatedWork W2028104839 @default.
• W3196102960 hasRelatedWork W2060813200 @default.
• W3196102960 hasRelatedWork W2154913653 @default.
• W3196102960 hasRelatedWork W2189898076 @default.
• W3196102960 hasRelatedWork W2295526563 @default.
• W3196102960 hasRelatedWork W2299263495 @default.
• W3196102960 hasRelatedWork W2338367696 @default.
• W3196102960 hasRelatedWork W2484472566 @default.
• W3196102960 hasRelatedWork W2519229610 @default.
• W3196102960 hasRelatedWork W2529702211 @default.

• next