<--- Back to Details
First PageDocument Content
Complexity classes / Circuit complexity / Computational complexity theory / Zero-knowledge proof / Non-interactive zero-knowledge proof / SM-62 Snark / XTR / NC / NP / Proof of knowledge / Computer / ZK
Complexity classes
Circuit complexity
Computational complexity theory
Zero-knowledge proof
Non-interactive zero-knowledge proof
SM-62 Snark
XTR
NC
NP
Proof of knowledge
Computer
ZK

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Add to Reading List

Source URL: www.usenix.org

Download Document from Source Website

File Size: 506,96 KB

Share Document on Facebook

Similar Documents

RFCSchnorr Non-interactive Zero-Knowledge Proof

RFCSchnorr Non-interactive Zero-Knowledge Proof

DocID: 1uoRK - View Document

2015 IEEE Symposium on Security and Privacy  ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data Michael Backes

2015 IEEE Symposium on Security and Privacy ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data Michael Backes

DocID: 1pZM7 - View Document

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

DocID: 1lBYy - View Document

Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust†  Carmit Hazay‡

Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡

DocID: 1g45g - View Document

BRICS  Basic Research in Computer Science BRICS RSJ. Groth: Extracting Witnesses from Proofs of Knowledge  Extracting Witnesses from Proofs of

BRICS Basic Research in Computer Science BRICS RSJ. Groth: Extracting Witnesses from Proofs of Knowledge Extracting Witnesses from Proofs of

DocID: 1g0K6 - View Document