Conference proceeding
TRUESET: Faster Verifiable Set Computations
PROCEEDINGS OF THE 23RD USENIX SECURITY SYMPOSIUM, pp.765-780
01 Jan 2014
Abstract
Verifiable computation (VC) enables thin clients to efficiently verify the computational results produced by a powerful server. Although VC was initially considered to be mainly of theoretical interest, over the last two years impressive progress has been made on implementing VC. Specifically, we now have open-source implementations of VC systems that handle all classes of computations expressed either as circuits or in the RAM model. Despite this very encouraging progress, new enhancements in the design and implementation of VC protocols are required to achieve truly practical VC for real-world applications.
In this work, we show that for functions that can be expressed efficiently in terms of set operations (e.g., a subset of SQL queries) VC can be enhanced to become drastically more practical: We present the design and prototype implementation of a novel VC scheme that achieves orders of magnitude speed-up in comparison with the state of the art. Specifically, we build and evaluate TRUESET, a system that can verifiably compute any polynomial-time function expressed as a circuit consisting of "set gates" such as union, intersection, difference and set cardinality. Moreover, TRUESET supports hybrid circuits consisting of both set gates and traditional arithmetic gates. Therefore, it does not lose any of the expressiveness of previous schemes-this also allows the user to choose the most efficient way to represent different parts of a computation. By expressing set computations as polynomial operations and introducing a novel Quadratic Polynomial Program technique, our experiments show that TRUESET achieves prover performance speed-up ranging from 30x to 150x and up to 97% evaluation key size reduction compared to the state-of-the-art.
Metrics
7 Record Views
Details
- Title
- TRUESET: Faster Verifiable Set Computations
- Creators
- Ahmed E. Kosba - Univ Maryland, Comp Sci Dept, College Pk, MD 20742 USADimitrios Papadopoulos - Boston UniversityCharalampos Papamanthou - Univ Maryland, Elect & Comp Engn Dept, College Pk, MD 20742 USAMahmoud F. Sayed - Univ Maryland, Comp Sci Dept, College Pk, MD 20742 USAElaine Shi - Univ Maryland, Comp Sci Dept, College Pk, MD 20742 USANikos Triandopoulos - Boston UniversityUSENIX Assoc
- Publication Details
- PROCEEDINGS OF THE 23RD USENIX SECURITY SYMPOSIUM, pp.765-780
- Conference
- 23RD USENIX SECURITY SYMPOSIUM, 23rd
- Publisher
- Usenix Assoc
- Number of pages
- 16
- Grant note
- Google Faculty Research Award; Google Incorporated CNS-1314857; CNS-1012798; CNS-1012910 / NSF; National Science Foundation (NSF)
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Mathematics
- Identifiers
- 991020531961004721
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Computer Science, Hardware & Architecture
- Computer Science, Software Engineering
- Computer Science, Theory & Methods