FRINK Linked Data Fragments server

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

• W2071520502 endingPage "64" @default.
• W2071520502 startingPage "1" @default.
• W2071520502 abstract "In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time or, in other words, a “muggle”.1 The verifier should be super-efficient and run in nearly linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result’s correctness in nearly linear time (instead of running the entire computation itself). Previously, related questions were considered in the holographic proof setting by Babai et al. [1991b] in the argument setting under computational assumptions by Kilian, and in the random oracle model by Micali [1994]. Our focus, however, is on the original interactive proof model where no assumptions are made on the computational power or adaptiveness of dishonest provers. Our main technical theorem gives a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth d and input length n . The verifier runs in time n · poly( d , log( n )) and space O (log( n )), the communication complexity is poly( d , log( n )), and the prover runs in time poly( n ). In particular, for languages computable by log-space uniform NC (circuits of polylog( n ) depth), the prover is efficient, the verifier runs in time n · polylog( n ) and space O (log( n )), and the communication complexity is polylog( n ). Using this theorem we make progress on several questions. --- We show how to construct 1-round computationally sound arguments with polylog communication for any log-space uniform NC computation. The verifier runs in quasi-linear time. This result uses a recent transformation of Kalai and Raz from public coin interactive proofs to 1-round arguments . The soundness of the argument system is based on the existence of a PIR scheme with polylog communication. --- We construct interactive proofs with public coin, log-space, poly-time verifiers for all of P are given. This settles an open question regarding the expressive power of proof systems with such verifiers. --- We construct zero-knowledge interactive proofs are given with communication complexity quasi-linear in the witness length for any NP language verifiable in NC , based on the existence of 1-way functions. --- We construct probabilistically checkable arguments (a model due to Kalai and Raz) of size polynomial in the witness length (rather than instance length) for any NP language verifiable in NC , under computational assumptions, are provided." @default.
• W2071520502 created "2016-06-24" @default.
• W2071520502 creator A5057788395 @default.
• W2071520502 creator A5070011898 @default.
• W2071520502 creator A5081254473 @default.
• W2071520502 date "2015-09-11" @default.
• W2071520502 modified "2023-09-23" @default.
• W2071520502 title "Delegating Computation" @default.
• W2071520502 cites W1511913323 @default.
• W2071520502 cites W1538440442 @default.
• W2071520502 cites W1540469777 @default.
• W2071520502 cites W1577653766 @default.
• W2071520502 cites W1630273691 @default.
• W2071520502 cites W167928972 @default.
• W2071520502 cites W174102541 @default.
• W2071520502 cites W186014684 @default.
• W2071520502 cites W1964821154 @default.
• W2071520502 cites W1970278864 @default.
• W2071520502 cites W1970606468 @default.
• W2071520502 cites W1980227445 @default.
• W2071520502 cites W1984685443 @default.
• W2071520502 cites W1992282993 @default.
• W2071520502 cites W1996839061 @default.
• W2071520502 cites W2010873187 @default.
• W2071520502 cites W2011112377 @default.
• W2071520502 cites W2015880590 @default.
• W2071520502 cites W2018925011 @default.
• W2071520502 cites W2019578639 @default.
• W2071520502 cites W2023675273 @default.
• W2071520502 cites W2023740004 @default.
• W2071520502 cites W2029859729 @default.
• W2071520502 cites W2031533839 @default.
• W2071520502 cites W2038691311 @default.
• W2071520502 cites W2041068798 @default.
• W2071520502 cites W2042194938 @default.
• W2071520502 cites W2044199052 @default.
• W2071520502 cites W2046176315 @default.
• W2071520502 cites W2049761975 @default.
• W2071520502 cites W2049982182 @default.
• W2071520502 cites W2053086236 @default.
• W2071520502 cites W2054019351 @default.
• W2071520502 cites W2057638793 @default.
• W2071520502 cites W2061707159 @default.
• W2071520502 cites W2067047774 @default.
• W2071520502 cites W2067596507 @default.
• W2071520502 cites W2070598115 @default.
• W2071520502 cites W2073346043 @default.
• W2071520502 cites W2075363121 @default.
• W2071520502 cites W2080578129 @default.
• W2071520502 cites W2082647621 @default.
• W2071520502 cites W2085025327 @default.
• W2071520502 cites W2086653003 @default.
• W2071520502 cites W2096390054 @default.
• W2071520502 cites W2097206148 @default.
• W2071520502 cites W2135952940 @default.
• W2071520502 cites W2142863519 @default.
• W2071520502 cites W2144238522 @default.
• W2071520502 cites W2148352980 @default.
• W2071520502 cites W2148634692 @default.
• W2071520502 cites W2152688060 @default.
• W2071520502 cites W2156708311 @default.
• W2071520502 cites W2159341052 @default.
• W2071520502 cites W2161979183 @default.
• W2071520502 cites W2166670067 @default.
• W2071520502 cites W2293021588 @default.
• W2071520502 cites W2293988196 @default.
• W2071520502 cites W2402663702 @default.
• W2071520502 cites W2914525031 @default.
• W2071520502 cites W2964279767 @default.
• W2071520502 cites W4180724 @default.
• W2071520502 doi "https://doi.org/10.1145/2699436" @default.
• W2071520502 hasPublicationYear "2015" @default.
• W2071520502 type Work @default.
• W2071520502 sameAs 2071520502 @default.
• W2071520502 citedByCount "119" @default.
• W2071520502 countsByYear W20715205022015 @default.
• W2071520502 countsByYear W20715205022016 @default.
• W2071520502 countsByYear W20715205022017 @default.
• W2071520502 countsByYear W20715205022018 @default.
• W2071520502 countsByYear W20715205022019 @default.
• W2071520502 countsByYear W20715205022020 @default.
• W2071520502 countsByYear W20715205022021 @default.
• W2071520502 countsByYear W20715205022022 @default.
• W2071520502 countsByYear W20715205022023 @default.
• W2071520502 crossrefType "journal-article" @default.
• W2071520502 hasAuthorship W2071520502A5057788395 @default.
• W2071520502 hasAuthorship W2071520502A5070011898 @default.
• W2071520502 hasAuthorship W2071520502A5081254473 @default.
• W2071520502 hasConcept C105605280 @default.
• W2071520502 hasConcept C108710211 @default.
• W2071520502 hasConcept C111919701 @default.
• W2071520502 hasConcept C11413529 @default.
• W2071520502 hasConcept C118615104 @default.
• W2071520502 hasConcept C148730421 @default.
• W2071520502 hasConcept C159718280 @default.
• W2071520502 hasConcept C171988527 @default.
• W2071520502 hasConcept C199360897 @default.
• W2071520502 hasConcept C203062551 @default.

• next