On Doubly-Efficient Interactive Proof Systems
Seiten
2018
now publishers Inc (Verlag)
978-1-68083-424-6 (ISBN)
now publishers Inc (Verlag)
978-1-68083-424-6 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
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. This book surveys some of the known results regarding doubly-efficient interactive proof systems.
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. This book 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.
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. This book 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.
1. Introduction
2. Simple doubly-efficient interactive proof systems
3. On the doubly-efficient interactive proof systems of GKR
4. Overview of the doubly-efficient interactive proof systems of RRR
5. Epilogue
A. Defining interactive proofs and arguments
References
| Erscheinungsdatum | 07.06.2018 |
|---|---|
| Reihe/Serie | Foundations and Trends® in Theoretical Computer Science |
| Verlagsort | Hanover |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 162 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| ISBN-10 | 1-68083-424-X / 168083424X |
| ISBN-13 | 978-1-68083-424-6 / 9781680834246 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …
Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90
