Less is more: refinement proofs for probabilistic proofs

There has been intense interest over the last decade in implementations of probabilistic proofs (IPs, SNARKs, PCPs, and so on): protocols in which an untrusted party proves to a verifier that a given computation was executed properly, possibly in zero knowledge. Nevertheless, implementations still d...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Jiang, Kunming, Chait-Roth, Devora, DeStefano, Zachary, Walfish, Michael, Wies, Thomas
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Arithmetic arithmetic-circuits Benchmark testing Costs front-ends Privacy Probabilistic logic probabilistic-proofs Protocols R1CS-constraints refinement-proofs Security SNARKs verifiable-computation widgets zero-knowledge
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!