About this product

Product Identifiers

PublisherNow Publishers

ISBN-10168083424X

ISBN-139781680834246

eBay Product ID (ePID)12038730539

Product Key Features

Number of Pages106 Pages

LanguageEnglish

Publication NameOn Doubly-Efficient Interactive Proof Systems

SubjectComputer Science

Publication Year2018

TypeTextbook

Subject AreaComputers

AuthorOded Goldreich

SeriesFoundations and Trends in Theoretical Computer Science Ser.

FormatTrade Paperback

Dimensions

Item Weight5.7 Oz

Item Length9.2 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

Table Of Content1. Introduction2. Simple doubly-efficient interactive proof systems3. On the doubly-efficient interactive proof systems of GKR4. Overview of the doubly-efficient interactive proof systems of RRR5. EpilogueA. Defining interactive proofs and argumentsReferences

SynopsisAn interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier's strategy can be implemented in almost-linear time. Such proof systems make the benefits of interactive proof system available to real-life agents who are restricted to polynomial-time computation. On Doubly-Efficient Interactive Proof Systems surveys some of the known results regarding doubly-efficient interactive proof systems. It starts by presenting two simple constructions for t-no-CLIQUE, where the first construction offers the benefit of being generalized to any "locally characterizable" set, and the second construction offers the benefit of preserving the combinatorial flavor of the problem. It then turns to two more general constructions of doubly-efficient interactive proof system: the proof system for sets having (uniform) bounded-depth circuits and the proof system for sets that are recognized in polynomial-time and small space. The presentation of the GKR construction is complete and is somewhat different from the original presentation. A brief overview is provided for the RRR construction., Surveys some of the known results regarding doubly-efficient interactive proof systems, which make the benefits of interactive proof system available for a wider range of applications., An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier's strategy can be implemented in almost-linear time. Such proof systems make the benefits of interactive proof system available to real-life agents who are restricted to polynomial-time computation. On Doubly-Efficient Interactive Proof Systems surveys some of the known results regarding doubly-efficient interactive proof systems. It starts by presenting two simple constructions for t -no-CLIQUE, where the first construction offers the benefit of being generalized to any "locally characterizable" set, and the second construction offers the benefit of preserving the combinatorial flavor of the problem. It then turns to two more general constructions of doubly-efficient interactive proof system: the proof system for sets having (uniform) bounded-depth circuits and the proof system for sets that are recognized in polynomial-time and small space. The presentation of the GKR construction is complete and is somewhat different from the original presentation. A brief overview is provided for the RRR construction.