Taking proof-based verified computation a few steps closer to practicality

Srinath Setty; Victor Vu; Nikhil Panpalia; Benjamin Braun; Andrew J. Blumberg; Michael Walfish

Taking proof-based verified computation a few steps closer to practicality

Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.

Original language	English (US)
Pages	253-268
Number of pages	16
State	Published - 2012
Event	21st USENIX Security Symposium - Bellevue, United States Duration: Aug 8 2012 → Aug 10 2012

Conference

Conference	21st USENIX Security Symposium
Country/Territory	United States
City	Bellevue
Period	8/8/12 → 8/10/12

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Safety, Risk, Reliability and Quality

Cite this

@conference{ae59d30ee0314abfbe45ead01f3df1fd,

title = "Taking proof-based verified computation a few steps closer to practicality",

abstract = "We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.",

author = "Srinath Setty and Victor Vu and Nikhil Panpalia and Benjamin Braun and Blumberg, {Andrew J.} and Michael Walfish",

year = "2012",

language = "English (US)",

pages = "253--268",

}

TY - CONF

T1 - Taking proof-based verified computation a few steps closer to practicality

AU - Setty, Srinath

AU - Vu, Victor

AU - Panpalia, Nikhil

AU - Braun, Benjamin

AU - Blumberg, Andrew J.

AU - Walfish, Michael

PY - 2012

Y1 - 2012

N2 - We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.

AB - We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.

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

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

M3 - Paper

AN - SCOPUS:85076228457

SP - 253

EP - 268

T2 - 21st USENIX Security Symposium

Y2 - 8 August 2012 through 10 August 2012

ER -

Taking proof-based verified computation a few steps closer to practicality

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this