Verifying Computations without Reexecuting Them.
The authors discuss potential problems with the reliability of computations performed by remote computers and consider different methods of verification that do not entail replicating the results. The authors describe a framework for addressing the problem in theory, then examine solutions posited b...
| Publicado en: | Communications of the ACM Vol. 58; no. 2; pp. 74 - 85 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Feb2015
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=100777461&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 100777461 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Feb2015 vid: 58 iid: 2 pid: 68 pub: Association for Computing Machinery artinfo: ui: 100777461 10.1145/2641562 ppf: 74 ppct: 11 formats: tig: atl: Verifying Computations without Reexecuting Them. aug: au: WALFISH, MICHAEL BLUMBERG, ANDREW J. affil: Associate professor, computer science department, New York University, New York City Associate professor of mathematics, University of Texas at Austin su: Verification of computer systems Verification of numerical calculations Cloud computing Distributed computing Client/server computing Software verification sug: subj: Verification of computer systems Verification of numerical calculations Cloud computing Distributed computing Client/server computing Software verification ab: The authors discuss potential problems with the reliability of computations performed by remote computers and consider different methods of verification that do not entail replicating the results. The authors describe a framework for addressing the problem in theory, then examine solutions posited by various researchers in published papers. They conclude with a discussion of performance that covers the verifying party's variable costs, the size and amortization of the verifier's setup costs, and overhead costs. INSETS: Encoding a Circuit¿s Execution in a Polynomial;Probabilistically Checking a Transcript¿s Validity;Probabilistically Checkable Proofs (simplified). pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2015 holdings: @attributes: islocal: N |
|---|