Full accounting for verifiable outsourcing

Riad S. Wahby, Ye Ji, Andrew J. Blumberg, Abhi Shelat, Justin Thaler, Michael Walfish, Thomas Wies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds to analyze whether outsourcing is justified, they generally ignore prover costs. Verifiable ASICs (VA)-in which the prover is a custom chip-is the other way around: Its cost calculations ignore precomputation. This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe's base is an interactive proof geared to dataparallel computation. Giraffe makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3×, both of which are of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol's data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500× larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.

Original languageEnglish (US)
Title of host publicationCCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
PublisherAssociation for Computing Machinery
Pages2071-2086
Number of pages16
VolumePart F131467
ISBN (Electronic)9781450349468
DOIs
StatePublished - Oct 30 2017
Event24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 - Dallas, United States
Duration: Oct 30 2017Nov 3 2017

Other

Other24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017
CountryUnited States
CityDallas
Period10/30/1711/3/17

Fingerprint

Outsourcing
Costs
Application specific integrated circuits
Hardware

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

Wahby, R. S., Ji, Y., Blumberg, A. J., Shelat, A., Thaler, J., Walfish, M., & Wies, T. (2017). Full accounting for verifiable outsourcing. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (Vol. Part F131467, pp. 2071-2086). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133984

Full accounting for verifiable outsourcing. / Wahby, Riad S.; Ji, Ye; Blumberg, Andrew J.; Shelat, Abhi; Thaler, Justin; Walfish, Michael; Wies, Thomas.

CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Vol. Part F131467 Association for Computing Machinery, 2017. p. 2071-2086.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wahby, RS, Ji, Y, Blumberg, AJ, Shelat, A, Thaler, J, Walfish, M & Wies, T 2017, Full accounting for verifiable outsourcing. in CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. vol. Part F131467, Association for Computing Machinery, pp. 2071-2086, 24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, United States, 10/30/17. https://doi.org/10.1145/3133956.3133984
Wahby RS, Ji Y, Blumberg AJ, Shelat A, Thaler J, Walfish M et al. Full accounting for verifiable outsourcing. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Vol. Part F131467. Association for Computing Machinery. 2017. p. 2071-2086 https://doi.org/10.1145/3133956.3133984
Wahby, Riad S. ; Ji, Ye ; Blumberg, Andrew J. ; Shelat, Abhi ; Thaler, Justin ; Walfish, Michael ; Wies, Thomas. / Full accounting for verifiable outsourcing. CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Vol. Part F131467 Association for Computing Machinery, 2017. pp. 2071-2086
@inproceedings{d8363eb61cd8430f84d106ba6b5a08c9,
title = "Full accounting for verifiable outsourcing",
abstract = "Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds to analyze whether outsourcing is justified, they generally ignore prover costs. Verifiable ASICs (VA)-in which the prover is a custom chip-is the other way around: Its cost calculations ignore precomputation. This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe's base is an interactive proof geared to dataparallel computation. Giraffe makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3×, both of which are of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol's data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500× larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.",
author = "Wahby, {Riad S.} and Ye Ji and Blumberg, {Andrew J.} and Abhi Shelat and Justin Thaler and Michael Walfish and Thomas Wies",
year = "2017",
month = "10",
day = "30",
doi = "10.1145/3133956.3133984",
language = "English (US)",
volume = "Part F131467",
pages = "2071--2086",
booktitle = "CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Full accounting for verifiable outsourcing

AU - Wahby, Riad S.

AU - Ji, Ye

AU - Blumberg, Andrew J.

AU - Shelat, Abhi

AU - Thaler, Justin

AU - Walfish, Michael

AU - Wies, Thomas

PY - 2017/10/30

Y1 - 2017/10/30

N2 - Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds to analyze whether outsourcing is justified, they generally ignore prover costs. Verifiable ASICs (VA)-in which the prover is a custom chip-is the other way around: Its cost calculations ignore precomputation. This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe's base is an interactive proof geared to dataparallel computation. Giraffe makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3×, both of which are of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol's data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500× larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.

AB - Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds to analyze whether outsourcing is justified, they generally ignore prover costs. Verifiable ASICs (VA)-in which the prover is a custom chip-is the other way around: Its cost calculations ignore precomputation. This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe's base is an interactive proof geared to dataparallel computation. Giraffe makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3×, both of which are of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol's data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500× larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.

UR - http://www.scopus.com/inward/record.url?scp=85041436790&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041436790&partnerID=8YFLogxK

U2 - 10.1145/3133956.3133984

DO - 10.1145/3133956.3133984

M3 - Conference contribution

AN - SCOPUS:85041436790

VL - Part F131467

SP - 2071

EP - 2086

BT - CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

PB - Association for Computing Machinery

ER -